# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
128261 | 2019-07-10T15:28:45 Z | MohamedAhmed04 | 선물상자 (IOI15_boxes) | C++14 | 3 ms | 376 KB |
#include "boxes.h" //#include "grader.cpp" #include <bits/stdc++.h> using namespace std ; const int MAX = 1e7 + 5 ; int pref[MAX] , suff[MAX] ; long long delivery(int N, int K, int L, int p[]) { long long last = 0 ; pref[0] = p[0] * 1ll ; for(int i = 1 ; i < N ; ++i) { pref[i] = pref[i-1] ; if(i % K == 0) pref[i] += (min(p[i-1] , L - p[i-1]) * 1ll + p[i-1] * 1ll) * 1ll ; pref[i] += (p[i] * 1ll - p[i-1] * 1ll) * 1ll ; } suff[N-1] = L - p[N-1] * 1ll ; int cnt = 0 ; for(int i = N-2 ; i >= 0 ; --i) { cnt++ ; suff[i] = suff[i+1] ; if(cnt % K == 0) suff[i] += (min(p[i+1] , L - p[i+1]) * 1ll + (L - p[i+1]) * 1ll) * 1ll ; suff[i] += (p[i+1] * 1ll - p[i] * 1ll) * 1ll ; } long long ans = suff[0] + min(L - p[0] , p[0]) * 1ll; ans = min(ans , pref[N-1] + min(L - p[N-1] , p[N-1]) * 1ll) ; for(int i = 0 ; i < N-1 ; ++i) ans = min(ans , (pref[i] + min((L - p[i]) * 1ll , p[i] * 1ll) * 1ll + suff[i+1] + min((L - p[i+1]) * 1ll , p[i+1] * 1ll) * 1ll ) * 1ll ) ; return ans ; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | 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 | 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 | 376 KB | Output is correct |
6 | Correct | 2 ms | 376 KB | Output is correct |
7 | Correct | 3 ms | 376 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Incorrect | 2 ms | 376 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | 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 | 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 | Correct | 2 ms | 376 KB | Output is correct |
2 | Incorrect | 2 ms | 376 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |