Submission #3430588
Source Code Expand
#include<iostream> using namespace std; using lint=long long; int main(){ lint N,T; cin>>N>>T; lint dup=0; lint t[200000]; for(int i=0;i<N;i++) cin>>t[i]; for(int i=1;i<N;i++){ lint dif=t[i]-t[i-1]; if(dif<T) dup+=T-dif; } cout<<N*T-dup<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Sentou |
User | oevl |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 298 Byte |
Status | AC |
Exec Time | 79 ms |
Memory | 1792 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | example0, example1, example2, example3, example4 |
All | example0, example1, example2, example3, example4, maxrand0, maxrand1, maxrand2, rand0, rand1, rand2, rand3, rand4 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
example0 | AC | 1 ms | 256 KB |
example1 | AC | 1 ms | 256 KB |
example2 | AC | 1 ms | 256 KB |
example3 | AC | 1 ms | 256 KB |
example4 | AC | 1 ms | 256 KB |
maxrand0 | AC | 79 ms | 1792 KB |
maxrand1 | AC | 79 ms | 1792 KB |
maxrand2 | AC | 79 ms | 1792 KB |
rand0 | AC | 1 ms | 256 KB |
rand1 | AC | 1 ms | 256 KB |
rand2 | AC | 1 ms | 256 KB |
rand3 | AC | 1 ms | 256 KB |
rand4 | AC | 1 ms | 256 KB |