# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
65266 | 2018-08-07T09:04:58 Z | KHUSRAV | 선물상자 (IOI15_boxes) | C++14 | 2 ms | 380 KB |
#include "boxes.h" #include<bits/stdc++.h> using namespace std ; pair<long long , long long> dppred[10000001] , dpfirst[10000001]; long long delivery(int N, int K, int L, int p[]) { deque<int> dq ; if(p[0] <= L / 2){ dppred[0] = {p[0] * 2 , K - 1}; dpfirst[0] = {p[0] * 2 , K - 1}; } else{ dppred[0] = {(L - p[0]) * 2 , K - 1}; dpfirst[0] = {(L - p[0]) * 2 , K - 1}; } for(int i = 1 ; i < N ; i++){ if(p[i] <= L / 2){ dppred[i] = {p[i] * 2 + dppred[i - 1].first, K - 1}; dpfirst[i] = {p[i] * 2 + dppred[i - 1].first, K - 1}; } else{ dppred[i] = {(L - p[i]) * 2 + dppred[i - 1].first, K - 1}; dpfirst[i] = {(L - p[i]) * 2 + dppred[i - 1].first, K - 1}; } if(dppred[i - 1].second > 0){ int k = dppred[i - 1].second; int l = p[i - 1]; int s = dppred[i - 1].first , g; if(l <= L / 2) g = l; else g = L - l ; if(p[i] <= L / 2){ if(dppred[i].first > s - g + (p[i] - p[i - 1]) + p[i]){ dppred[i].first = s - g + (p[i] - p[i - 1]) + p[i]; dppred[i].second = dppred[i - 1].second - 1 ; } } else{ if(dppred[i].first > s - g + (p[i] - p[i - 1]) + L - p[i]){ dppred[i].first = s - g + (p[i] - p[i - 1]) + L - p[i]; dppred[i].second = dppred[i - 1].second - 1 ; } } } if(dpfirst[i - 1].second > 0){ int k = dpfirst[i - 1].second; int l = p[i - 1]; int s = dpfirst[i - 1].first , g; if(l <= L / 2) g = l; else g = L - l ; if(p[i] <= L / 2){ if(dppred[i].first > s - g + (p[i] - p[i - 1]) + p[i]){ dppred[i].first = s - g + (p[i] - p[i - 1]) + p[i]; dppred[i].second = dpfirst[i - 1].second - 1 ; } } else{ if(dpfirst[i].first > s - g + (p[i] - p[i - 1]) + L - p[i]){ dppred[i].first = s - g + (p[i] - p[i - 1]) + L - p[i]; dppred[i].second = dpfirst[i - 1].second - 1 ; } } } } return dppred[N - 1].first ; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Correct | 2 ms | 376 KB | Output is correct |
5 | Correct | 2 ms | 348 KB | Output is correct |
6 | Correct | 2 ms | 380 KB | Output is correct |
7 | Correct | 2 ms | 376 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Incorrect | 2 ms | 376 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Correct | 2 ms | 376 KB | Output is correct |
5 | Correct | 2 ms | 348 KB | Output is correct |
6 | Correct | 2 ms | 380 KB | Output is correct |
7 | Correct | 2 ms | 376 KB | Output is correct |
8 | Correct | 2 ms | 376 KB | Output is correct |
9 | Incorrect | 2 ms | 376 KB | Output isn't correct |
10 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Correct | 2 ms | 376 KB | Output is correct |
5 | Correct | 2 ms | 348 KB | Output is correct |
6 | Correct | 2 ms | 380 KB | Output is correct |
7 | Correct | 2 ms | 376 KB | Output is correct |
8 | Correct | 2 ms | 376 KB | Output is correct |
9 | Incorrect | 2 ms | 376 KB | Output isn't correct |
10 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Correct | 2 ms | 376 KB | Output is correct |
5 | Correct | 2 ms | 348 KB | Output is correct |
6 | Correct | 2 ms | 380 KB | Output is correct |
7 | Correct | 2 ms | 376 KB | Output is correct |
8 | Correct | 2 ms | 376 KB | Output is correct |
9 | Incorrect | 2 ms | 376 KB | Output isn't correct |
10 | Halted | 0 ms | 0 KB | - |