Submission #3416544
Source Code Expand
#include<iostream> using namespace std; long long b,a[100000000],s,m,n,t; int main() { cin>>b>>m>>n; for(int i=1;i<=b;i++) cin>>a[i]; for(int i=1;i<=b-1;i++) { t=(a[i+1]-a[i])*m; s+=t>n?n:t; } cout<<s; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Walk and Teleport |
User | vjudge1 |
Language | Bash (GNU bash v4.3.11) |
Score | 0 |
Code Size | 228 Byte |
Status | RE |
Exec Time | 2 ms |
Memory | 572 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | RE | 2 ms | 572 KB |
sample_02.txt | RE | 2 ms | 568 KB |
sample_03.txt | RE | 2 ms | 568 KB |
subtask_1_balancedmax_01.txt | RE | 2 ms | 572 KB |
subtask_1_balancedmax_02.txt | RE | 2 ms | 572 KB |
subtask_1_max_01.txt | RE | 2 ms | 572 KB |
subtask_1_max_02.txt | RE | 2 ms | 572 KB |
subtask_1_min_01.txt | RE | 2 ms | 572 KB |
subtask_1_onlya_01.txt | RE | 2 ms | 572 KB |
subtask_1_onlyamax_01.txt | RE | 2 ms | 572 KB |
subtask_1_onlyb_01.txt | RE | 2 ms | 568 KB |
subtask_1_onlybmax_01.txt | RE | 2 ms | 572 KB |
subtask_1_rand_01.txt | RE | 2 ms | 572 KB |
subtask_1_rand_02.txt | RE | 2 ms | 568 KB |
subtask_1_rand_03.txt | RE | 2 ms | 572 KB |