# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1029437 | XJP12 | Boxes with souvenirs (IOI15_boxes) | C++14 | 0 ms | 348 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "boxes.h"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
ll delivery(int n, int k, int L, int positions[]){
ll l=(ll)L;
if(k==1){
ll ans=0;
for(int i=0; i<n; i++){
ans+=min(positions[i],L-positions[i])*2;
}
return ans;
}
if(k==n){
vi pos;
set<ll> z;
for(int i=0; i<n; i++){
int size=(int)z.size();
z.insert(positions[i]);
if((int)z.size()!=size){
pos.push_back(positions[i]);
}
}
int x=-1,y=-1;
for(int i=0; i<pos.size(); i++){
if(pos[i]*2>=l) break;
x = i;
}
for(int i=pos.size()-1; i>=0; i--){
if((l-pos[i])*2>l) break;
y = i;
}
long long ans=0;
if(x!=-1) ans+=pos[x]*2;
if(y!=-1) ans+=(n-pos[y])*2;
ans=min(l, ans);
if(x==-1 && y==-1) ans=l;
return ans;
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |