Submission #1337648
Source Code Expand
#pragma region include #include <iostream> #include <iomanip> #include <stdio.h> #include <sstream> #include <algorithm> #include <cmath> #include <complex> #include <string> #include <cstring> #include <vector> #include <tuple> #include <bitset> #include <queue> #include <complex> #include <set> #include <map> #include <stack> #include <list> #include <fstream> #include <random> //#include <time.h> #include <ctime> #pragma endregion //#include ///////// #define REP(i, x, n) for(int i = x; i < n; ++i) #define rep(i,n) REP(i,0,n) ///////// #pragma region typedef typedef long long LL; typedef long double LD; typedef unsigned long long ULL; #pragma endregion //typedef ////定数 const int INF = (int)1e9; const LL MOD = (LL)1e9+7; const LL LINF = (LL)1e18; const double PI = acos(-1.0); const double EPS = 1e-9; ///////// using namespace::std; void solve(){ int N; LL A,B; cin >> N >> A >> B; vector<LL> X(N); for(int i=0;i<N;++i){ cin >> X[i]; } LL ans = 0; for(int i=1;i<N;++i){ if( A*(X[i]-X[i-1]) < B ){ ans += A*(X[i]-X[i-1]); }else{ ans += B; } } cout << ans << endl; } #pragma region main signed main(void){ std::cin.tie(0); std::ios::sync_with_stdio(false); std::cout << std::fixed;//小数を10進数表示 cout << setprecision(16);//小数点以下の桁数を指定//coutとcerrで別 solve(); } #pragma endregion //main()
Submission Info
Submission Time | |
---|---|
Task | D - Walk and Teleport |
User | akarin55 |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 1453 Byte |
Status | AC |
Exec Time | 11 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 | 1 ms | 256 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 | 11 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 | 7 ms | 768 KB |
subtask_1_rand_02.txt | AC | 9 ms | 896 KB |
subtask_1_rand_03.txt | AC | 5 ms | 512 KB |