# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
618911 | A_D | Boxes with souvenirs (IOI15_boxes) | C++14 | 1 ms | 340 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 "boxes.h"
#include <bits/stdc++.h>
const int N=1e7+10;
long long pre[N];
long long suf[N];
int hhhh[N];
using namespace std;
long long delivery(int N, int K, int L, int p[]) {
for(int i=0;i<N;i++){
hhhh[i]=p[i];
}
sort(hhhh,hhhh+N);
for(int i=0;i<N;i++){
p[i]=hhhh[i];
}
long long ans=1e18;
long long me=0,cur=0,lst=0;
// cout<<5<<"\n";
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... |