Submission #1231125
Source Code Expand
#include<bits/stdc++.h> using namespace std; #define FOR(i,a,b) for(int i=(a);i<(b);i++) #define REP(i,n) for(int i=0;i<(n);i++) #define VS vector<string> #define ll long long int int main(void) { ll n; ll a; ll b; ll ans=0; cin >> n >> a >> b; ll x[n]; REP(i,n) { cin >> x[i]; } ll dis[n-1]; REP(i,n-1) { dis[i] = x[i+1] - x[i]; } REP(i,n-1) { if(dis[i]*a > b) ans += b; else ans += a*dis[i]; } cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | D - Walk and Teleport |
User | kanra824 |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 623 Byte |
Status | AC |
Exec Time | 41 ms |
Memory | 1792 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 | 9 ms | 764 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |
subtask_1_balancedmax_01.txt | AC | 41 ms | 1792 KB |
subtask_1_balancedmax_02.txt | AC | 41 ms | 1792 KB |
subtask_1_max_01.txt | AC | 41 ms | 1792 KB |
subtask_1_max_02.txt | AC | 41 ms | 1792 KB |
subtask_1_min_01.txt | AC | 1 ms | 256 KB |
subtask_1_onlya_01.txt | AC | 21 ms | 1024 KB |
subtask_1_onlyamax_01.txt | AC | 41 ms | 1792 KB |
subtask_1_onlyb_01.txt | AC | 11 ms | 640 KB |
subtask_1_onlybmax_01.txt | AC | 41 ms | 1792 KB |
subtask_1_rand_01.txt | AC | 26 ms | 1280 KB |
subtask_1_rand_02.txt | AC | 34 ms | 1536 KB |
subtask_1_rand_03.txt | AC | 16 ms | 768 KB |