Submission #1065563
Source Code Expand
#include<iostream> #include<vector> #include<string> #include<algorithm> #include<map> #include<set> #include<utility> #include<cmath> #include<cstring> #include<queue> #include<stack> #include<cstdio> #include<sstream> #include<iomanip> #define loop(i,a,b) for(int i=a;i<b;i++) #define rep(i,a) loop(i,0,a) #define pb push_back #define mp make_pair #define all(in) in.begin(),in.end() #define shosu(x) fixed<<setprecision(x) using namespace std; //kaewasuretyuui typedef long long ll; typedef pair<int,int> pii; typedef vector<ll> vi; typedef vector<vi> vvi; typedef vector<pii> vp; typedef vector<vp> vvp; typedef vector<string> vs; typedef vector<double> vd; typedef vector<vd> vvd; typedef pair<int,pii> pip; typedef vector<pip>vip; const double PI=acos(-1); const double EPS=1e-7; const int inf=1e8; int main(){ ll n,s,t; cin>>n>>s>>t; ll out=0; vi in(n); rep(i,n)cin>>in[i]; rep(i,n-1){ ll a=(in[i+1]-in[i])*s; out+=min<ll>(a,t); } cout<<out<<endl; }
Submission Info
Submission Time | |
---|---|
Task | D - Walk and Teleport |
User | ixmel_rd |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 1047 Byte |
Status | AC |
Exec Time | 43 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 | 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 | 2 ms | 256 KB |
sample_02.txt | AC | 2 ms | 256 KB |
sample_03.txt | AC | 2 ms | 256 KB |
subtask_1_balancedmax_01.txt | AC | 43 ms | 1024 KB |
subtask_1_balancedmax_02.txt | AC | 42 ms | 1024 KB |
subtask_1_max_01.txt | AC | 42 ms | 1024 KB |
subtask_1_max_02.txt | AC | 42 ms | 1024 KB |
subtask_1_min_01.txt | AC | 2 ms | 256 KB |
subtask_1_onlya_01.txt | AC | 23 ms | 640 KB |
subtask_1_onlyamax_01.txt | AC | 43 ms | 1024 KB |
subtask_1_onlyb_01.txt | AC | 12 ms | 384 KB |
subtask_1_onlybmax_01.txt | AC | 43 ms | 1024 KB |
subtask_1_rand_01.txt | AC | 28 ms | 768 KB |
subtask_1_rand_02.txt | AC | 36 ms | 896 KB |
subtask_1_rand_03.txt | AC | 18 ms | 512 KB |