# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
101332 | 2019-03-18T13:30:17 Z | ansol4328 | 선물상자 (IOI15_boxes) | C++11 | 4 ms | 512 KB |
#include<stdio.h> #include<vector> #include<algorithm> using namespace std; long long delivery(int N, int K, int L, int *positions) { long long res=0; int st=positions[0]==0; vector<int> lst1, lst2; for(int i=st ; i<N ; i++) { if(positions[i]>L/2) break; lst1.push_back(positions[i]); positions[i]=-1; } for(int i=N-1 ; i>=0 ; i--) { if(positions[i]==-1) break; lst2.push_back(positions[i]); positions[i]=-1; } int idx1=-1, idx2=-1; for(int i=K-1 ; i<lst1.size() ; idx1=i, i+=K) res+=2*lst1[i]; for(int i=K-1 ; i<lst2.size() ; idx2=i, i+=K) res+=2*(L-lst1[i]); int rm1=lst1.size()-idx1-1, rm2=lst2.size()-idx2-1; int v1=0, v2=L, v3=L; if(rm1) v1+=2*lst1[lst1.size()-1]; if(rm2) v1+=2*(L-lst2[lst2.size()-1]); if(rm1+rm2>=K) { int x=rm1+rm2-K; if(x) { v2+=2*(L-lst2[idx2+x]); v3+=2*lst1[idx1+x]; } } res+=min(v1,min(v2,v3)); return res; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | Output is correct |
2 | Incorrect | 2 ms | 384 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | Output is correct |
2 | Correct | 2 ms | 384 KB | Output is correct |
3 | Correct | 2 ms | 384 KB | Output is correct |
4 | Correct | 2 ms | 256 KB | Output is correct |
5 | Correct | 0 ms | 256 KB | Output is correct |
6 | Runtime error | 4 ms | 512 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
7 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 384 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | Output is correct |
2 | Incorrect | 2 ms | 384 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | Output is correct |
2 | Incorrect | 2 ms | 384 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | Output is correct |
2 | Incorrect | 2 ms | 384 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |