Submission #1694445
Source Code Expand
#include<iostream> #include<iomanip> #include<math.h> #include<vector> #include<algorithm> #include<set> #include<map> #include<queue> #include<stack> #include<string> #include<time.h> #define INF 1000000000ll #define MOD 1000000007ll #define EPS 1e-10 #define REP(i,m) for(long long i=0; i<m; ++i) #define FOR(i,n,m) for(long long i=n; i<m; ++i) #define DUMP(n,a) for(long long dump=0; dump<n; ++dump) { cout<<a[dump]; if(dump!=n-1) cout<<" "; else cout<<endl; } #define ALL(v) v.begin(),v.end() #define pb push_back using namespace std; typedef long long ll; typedef pair<ll, ll> P; typedef long double ld; int main() { cin.tie(0); ios::sync_with_stdio(false); ll n,a,b; cin>>n>>a>>b; vector<ll> x(n); REP(i,n) cin>>x[i]; ll ret=0; REP(i,n-1) { if((x[i+1]-x[i])*a>b) ret+=b; else ret+=(x[i+1]-x[i])*a; } cout<<ret<<endl; }
Submission Info
Submission Time | |
---|---|
Task | D - Walk and Teleport |
User | gazelle |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 878 Byte |
Status | AC |
Exec Time | 12 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 | 3 ms | 384 KB |
subtask_1_balancedmax_01.txt | AC | 11 ms | 1024 KB |
subtask_1_balancedmax_02.txt | AC | 11 ms | 1024 KB |
subtask_1_max_01.txt | AC | 11 ms | 1024 KB |
subtask_1_max_02.txt | AC | 12 ms | 1024 KB |
subtask_1_min_01.txt | AC | 1 ms | 256 KB |
subtask_1_onlya_01.txt | AC | 6 ms | 640 KB |
subtask_1_onlyamax_01.txt | AC | 11 ms | 1024 KB |
subtask_1_onlyb_01.txt | AC | 4 ms | 512 KB |
subtask_1_onlybmax_01.txt | AC | 11 ms | 1024 KB |
subtask_1_rand_01.txt | AC | 8 ms | 768 KB |
subtask_1_rand_02.txt | AC | 10 ms | 896 KB |
subtask_1_rand_03.txt | AC | 5 ms | 512 KB |