Submission #1071405
Source Code Expand
//ABC 052-D #define _USE_MATH_DEFINES #include <iostream> #include <cmath> #include <stdlib.h> #include <algorithm> #include <cstdio> #include <vector> #include <cstring> #include <numeric> #include <string> #include <map> #include <sstream> using namespace std; int main() { int Town; long Teleport, Distance[100000], Walk, ans = 0; cin >> Town >> Walk >> Teleport >> Distance[0]; for (int i = 1; i < Town; i++) { cin >> Distance[i]; ans += min(Teleport,Walk*(Distance[i] - Distance[i - 1])); } cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | D - Walk and Teleport |
User | Isaac_Hokton |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 562 Byte |
Status | AC |
Exec Time | 47 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 | 46 ms | 1024 KB |
subtask_1_balancedmax_02.txt | AC | 47 ms | 1024 KB |
subtask_1_max_01.txt | AC | 47 ms | 1024 KB |
subtask_1_max_02.txt | AC | 47 ms | 1024 KB |
subtask_1_min_01.txt | AC | 3 ms | 256 KB |
subtask_1_onlya_01.txt | AC | 25 ms | 640 KB |
subtask_1_onlyamax_01.txt | AC | 47 ms | 1024 KB |
subtask_1_onlyb_01.txt | AC | 13 ms | 384 KB |
subtask_1_onlybmax_01.txt | AC | 47 ms | 1024 KB |
subtask_1_rand_01.txt | AC | 30 ms | 768 KB |
subtask_1_rand_02.txt | AC | 39 ms | 896 KB |
subtask_1_rand_03.txt | AC | 19 ms | 512 KB |