Submission #1065664
Source Code Expand
#include <algorithm> #include <bitset> #include <cassert> #include <climits> #include <cmath> #include <cstdio> #include <cstdlib> #include <cstring> #include <deque> #include <iomanip> #include <iostream> #include <map> #include <numeric> #include <queue> #include <set> #include <stack> #include <string> #define int long long #define ll long long #define pb push_back #define mp make_pair #define pii pair<int,int> #define vi vector<int> #define all(a) (a).begin(),(a).end() #define F first #define S second #define sz(x) (int)x.size() #define hell 1000000007 #define endl '\n' #define rep(i,a,b) for(int i=a;i<b;i++) using namespace std; void solve(){ int N,A,B; cin>>N>>A>>B; vi x(N); rep(i,0,N)cin>>x[i]; int ans=0; rep(i,1,N){ ans+=min(B,A*(x[i]-x[i-1])); } cout<<ans; } signed main(){ ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t=1; // cin>>t; while(t--){ solve(); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Walk and Teleport |
User | praran26 |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 1072 Byte |
Status | AC |
Exec Time | 14 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 | 3 ms | 256 KB |
sample_02.txt | AC | 3 ms | 256 KB |
sample_03.txt | AC | 3 ms | 256 KB |
subtask_1_balancedmax_01.txt | AC | 14 ms | 1024 KB |
subtask_1_balancedmax_02.txt | AC | 14 ms | 1024 KB |
subtask_1_max_01.txt | AC | 13 ms | 1024 KB |
subtask_1_max_02.txt | AC | 14 ms | 1024 KB |
subtask_1_min_01.txt | AC | 3 ms | 256 KB |
subtask_1_onlya_01.txt | AC | 8 ms | 640 KB |
subtask_1_onlyamax_01.txt | AC | 14 ms | 1024 KB |
subtask_1_onlyb_01.txt | AC | 5 ms | 384 KB |
subtask_1_onlybmax_01.txt | AC | 14 ms | 1024 KB |
subtask_1_rand_01.txt | AC | 9 ms | 768 KB |
subtask_1_rand_02.txt | AC | 12 ms | 896 KB |
subtask_1_rand_03.txt | AC | 7 ms | 512 KB |