# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
344940 | 2021-01-06T19:25:08 Z | ogibogi2004 | Boxes with souvenirs (IOI15_boxes) | C++14 | 1 ms | 364 KB |
#include "boxes.h" #include <bits/stdc++.h> using namespace std; #define ll long long ll ans=2e17; long long delivery(int N, int K, int L, int p[]) { vector<ll>xd; for(ll i=0;i<N;i++)xd.push_back(p[i]); ll l=0,r=N-1,k=K,n=N,of=L,s,sl=0,sr=0; for(ll i=n-1;i>min(k-1,n-1);i--) { if((n-1-i)%k==0||i-1<=min(k-1,n-1)) { sr+=(of-xd[i])*2; } } for(ll i=0;i<n+1;i++) { ll i2=min(i+k-1,n-1);s=0; if(i2>=i) { s+=of; } ans=min(ans,sl+sr+s); //cout<<i<<":"<<sl<<" "<<sr<<" "<<s<<endl; if(i%k==0) { sl+=xd[i]*2; } else { sl-=xd[i-1]*2; sl+=xd[i]*2; } if(i+k<n) { sr-=(of-xd[i+k])*2; if((n-(i+k))%k!=0&&i+k+1<n) { sr+=(of-xd[i+k+1])*2; } } } return ans; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Incorrect | 1 ms | 364 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Correct | 1 ms | 364 KB | Output is correct |
3 | Correct | 1 ms | 364 KB | Output is correct |
4 | Correct | 1 ms | 364 KB | Output is correct |
5 | Incorrect | 1 ms | 364 KB | Output isn't correct |
6 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 364 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Incorrect | 1 ms | 364 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Incorrect | 1 ms | 364 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Incorrect | 1 ms | 364 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |