Submission #1789651
Source Code Expand
#include <iostream>
#include <string>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <numeric>
#define FOR(i, f, n) for(int (i) = (f); (i) < (n); (i)++)
#define RFOR(i, f, n) for(int (i) = (f); (i) >= (n); (i)--)
#define rep(i, n) for(int (i) = 0; (i) < (n); (i)++)
#define rrep(i, n) for(int (i) = (n); (i) >= 0; (i)--)
#define step(i, f, n, a) for(int (i) = (f); (i) < (n); (i)+=a)
#define rstep(i, f, n, a) for(int (i) = (f); (i) >= (n); (i)-=a)
#define p(...) printf(__VA_ARGS__); cout << endl;
#define gets(x) x; cin >> x;
#define puts(x) x; cout << x << endl;
#define list_input(x, n) x[(n)]; for(int (i) = 0; (i) < (n); (i)++) cin >> x[i];
#define lambda(a, b, c) [](const a, const b){ return c ;}
#define key(t, x, compare) [](const t& a, const t& b){ return a x compare b x ;}
using namespace std;
using pii = pair<int, int>;
int main(){
long long n, a, b, result = 0;
cin >> n >> a >> b;
long long x[n];
rep(i, n){
gets(x[i])
}
rep(i, n-1){
result += min( (x[i+1]-x[i])*a, b);
}
puts(result)
}
Submission Info
Submission Time |
|
Task |
D - Walk and Teleport |
User |
KeitaKishida0811 |
Language |
C++14 (GCC 5.4.1) |
Score |
500 |
Code Size |
1147 Byte |
Status |
AC |
Exec Time |
41 ms |
Memory |
1024 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
500 / 500 |
Status |
|
|
Set Name |
Test Cases |
Sample |
sample_01.txt, sample_02.txt, sample_03.txt |
All |
sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_balancedmax_01.txt, subtask_1_balancedmax_02.txt, subtask_1_max_01.txt, subtask_1_max_02.txt, subtask_1_min_01.txt, subtask_1_onlya_01.txt, subtask_1_onlyamax_01.txt, subtask_1_onlyb_01.txt, subtask_1_onlybmax_01.txt, subtask_1_rand_01.txt, subtask_1_rand_02.txt, subtask_1_rand_03.txt |
Case Name |
Status |
Exec Time |
Memory |
sample_01.txt |
AC |
1 ms |
256 KB |
sample_02.txt |
AC |
1 ms |
256 KB |
sample_03.txt |
AC |
1 ms |
256 KB |
subtask_1_balancedmax_01.txt |
AC |
40 ms |
1024 KB |
subtask_1_balancedmax_02.txt |
AC |
41 ms |
1024 KB |
subtask_1_max_01.txt |
AC |
41 ms |
1024 KB |
subtask_1_max_02.txt |
AC |
41 ms |
1024 KB |
subtask_1_min_01.txt |
AC |
1 ms |
256 KB |
subtask_1_onlya_01.txt |
AC |
21 ms |
640 KB |
subtask_1_onlyamax_01.txt |
AC |
41 ms |
1024 KB |
subtask_1_onlyb_01.txt |
AC |
11 ms |
384 KB |
subtask_1_onlybmax_01.txt |
AC |
41 ms |
1024 KB |
subtask_1_rand_01.txt |
AC |
26 ms |
768 KB |
subtask_1_rand_02.txt |
AC |
34 ms |
896 KB |
subtask_1_rand_03.txt |
AC |
16 ms |
512 KB |