Submission #1588742
Source Code Expand
#include<bits/stdc++.h> using namespace std; typedef long long ll; int main(){ ll N, a, b; cin>>N>>a>>b; vector <ll> x; for(ll i=0;i<N;i++){ ll xx; cin>>xx; x.push_back(xx); } ll res=0; for(int i=1;i<N;i++){ if(a*(x[i]-x[i-1])<b){ res+=a*(x[i]-x[i-1]); } else{ res+=b; } } cout<<res<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Walk and Teleport |
User | agony |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 572 Byte |
Status | AC |
Exec Time | 43 ms |
Memory | 1400 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 | 41 ms | 1400 KB |
subtask_1_balancedmax_02.txt | AC | 41 ms | 1400 KB |
subtask_1_max_01.txt | AC | 41 ms | 1400 KB |
subtask_1_max_02.txt | AC | 41 ms | 1400 KB |
subtask_1_min_01.txt | AC | 1 ms | 256 KB |
subtask_1_onlya_01.txt | AC | 22 ms | 892 KB |
subtask_1_onlyamax_01.txt | AC | 43 ms | 1400 KB |
subtask_1_onlyb_01.txt | AC | 11 ms | 640 KB |
subtask_1_onlybmax_01.txt | AC | 41 ms | 1400 KB |
subtask_1_rand_01.txt | AC | 26 ms | 892 KB |
subtask_1_rand_02.txt | AC | 34 ms | 1400 KB |
subtask_1_rand_03.txt | AC | 16 ms | 892 KB |