Submission #3007475
Source Code Expand
#include <cstdio> #include <cstring> #include <queue> #include <algorithm> #include <cmath> #include <vector> #include <iostream> #include <stack> #include <set> #include <map> using namespace std; const int MAX=1e5+5; int n,x[MAX],a,b; long long ans; int main(){ int i; scanf("%d%d%d",&n,&a,&b); for(i=0;i<n;i++) scanf("%d",&x[i]); for(i=1;i<n;i++){ if((long long)a*(x[i]-x[i-1])<b) ans+=(long long)a*(x[i]-x[i-1]); else ans+=b; } printf("%lld\n",ans); return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Walk and Teleport |
User | shuuichi |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 513 Byte |
Status | AC |
Exec Time | 12 ms |
Memory | 640 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:20:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d%d",&n,&a,&b); ^ ./Main.cpp:22:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&x[i]); ^
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 | 12 ms | 640 KB |
subtask_1_balancedmax_02.txt | AC | 12 ms | 640 KB |
subtask_1_max_01.txt | AC | 12 ms | 640 KB |
subtask_1_max_02.txt | AC | 12 ms | 640 KB |
subtask_1_min_01.txt | AC | 1 ms | 256 KB |
subtask_1_onlya_01.txt | AC | 7 ms | 384 KB |
subtask_1_onlyamax_01.txt | AC | 12 ms | 640 KB |
subtask_1_onlyb_01.txt | AC | 4 ms | 384 KB |
subtask_1_onlybmax_01.txt | AC | 12 ms | 640 KB |
subtask_1_rand_01.txt | AC | 8 ms | 512 KB |
subtask_1_rand_02.txt | AC | 11 ms | 512 KB |
subtask_1_rand_03.txt | AC | 6 ms | 384 KB |