# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
263341 | 2020-08-13T15:49:56 Z | Berted | 쌀 창고 (IOI11_ricehub) | C++14 | 22 ms | 2560 KB |
#include "ricehub.h" #include <iostream> #define ll long long using namespace std; ll pref[100001]; int besthub(int R, int L, int X[], ll B) { int ret = 0; for (int i = 1; i <= R; i++) pref[i] = pref[i - 1] + X[i - 1]; int rg = 0; ll s = 0; for (int lf = 1; lf <= R; lf++) { rg = max(lf, rg); int md = lf + rg >> 1; s = pref[rg] - pref[md] - (pref[md - ((lf - rg + 1) & 1)] - pref[lf - 1]); while (rg <= R && s <= B) { rg++; md = lf + rg >> 1; s = pref[rg] - pref[md] - (pref[md - ((lf - rg + 1) & 1)] - pref[lf - 1]); } ret = max(ret, rg - lf); } return ret; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Correct | 1 ms | 384 KB | Output is correct |
3 | Correct | 0 ms | 384 KB | Output is correct |
4 | Correct | 1 ms | 384 KB | Output is correct |
5 | Correct | 1 ms | 372 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Correct | 0 ms | 384 KB | Output is correct |
3 | Correct | 1 ms | 384 KB | Output is correct |
4 | Correct | 1 ms | 384 KB | Output is correct |
5 | Correct | 1 ms | 384 KB | Output is correct |
6 | Correct | 1 ms | 384 KB | Output is correct |
7 | Correct | 1 ms | 384 KB | Output is correct |
8 | Correct | 1 ms | 380 KB | Output is correct |
9 | Correct | 1 ms | 384 KB | Output is correct |
10 | Correct | 1 ms | 384 KB | Output is correct |
11 | Correct | 1 ms | 384 KB | Output is correct |
12 | Correct | 1 ms | 384 KB | Output is correct |
13 | Correct | 0 ms | 384 KB | Output is correct |
14 | Correct | 0 ms | 384 KB | Output is correct |
15 | Correct | 1 ms | 384 KB | Output is correct |
16 | Correct | 1 ms | 384 KB | Output is correct |
17 | Correct | 1 ms | 384 KB | Output is correct |
18 | Correct | 1 ms | 384 KB | Output is correct |
19 | Correct | 1 ms | 384 KB | Output is correct |
20 | Correct | 1 ms | 384 KB | Output is correct |
21 | Correct | 1 ms | 384 KB | Output is correct |
22 | Correct | 1 ms | 384 KB | Output is correct |
23 | Correct | 1 ms | 384 KB | Output is correct |
24 | Correct | 1 ms | 384 KB | Output is correct |
25 | Correct | 1 ms | 384 KB | Output is correct |
26 | Correct | 1 ms | 384 KB | Output is correct |
27 | Correct | 1 ms | 384 KB | Output is correct |
28 | Correct | 1 ms | 384 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Correct | 0 ms | 384 KB | Output is correct |
3 | Correct | 1 ms | 384 KB | Output is correct |
4 | Correct | 1 ms | 384 KB | Output is correct |
5 | Correct | 1 ms | 384 KB | Output is correct |
6 | Correct | 1 ms | 384 KB | Output is correct |
7 | Correct | 1 ms | 416 KB | Output is correct |
8 | Correct | 1 ms | 384 KB | Output is correct |
9 | Correct | 1 ms | 384 KB | Output is correct |
10 | Correct | 1 ms | 384 KB | Output is correct |
11 | Correct | 1 ms | 384 KB | Output is correct |
12 | Correct | 1 ms | 384 KB | Output is correct |
13 | Correct | 1 ms | 384 KB | Output is correct |
14 | Correct | 1 ms | 384 KB | Output is correct |
15 | Correct | 1 ms | 384 KB | Output is correct |
16 | Correct | 1 ms | 384 KB | Output is correct |
17 | Correct | 1 ms | 384 KB | Output is correct |
18 | Correct | 1 ms | 384 KB | Output is correct |
19 | Correct | 1 ms | 384 KB | Output is correct |
20 | Correct | 1 ms | 384 KB | Output is correct |
21 | Correct | 1 ms | 384 KB | Output is correct |
22 | Correct | 2 ms | 384 KB | Output is correct |
23 | Correct | 1 ms | 384 KB | Output is correct |
24 | Correct | 2 ms | 384 KB | Output is correct |
25 | Correct | 2 ms | 384 KB | Output is correct |
26 | Correct | 1 ms | 384 KB | Output is correct |
27 | Correct | 2 ms | 384 KB | Output is correct |
28 | Correct | 1 ms | 384 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 768 KB | Output is correct |
2 | Correct | 3 ms | 640 KB | Output is correct |
3 | Correct | 20 ms | 2552 KB | Output is correct |
4 | Correct | 19 ms | 2552 KB | Output is correct |
5 | Correct | 9 ms | 1280 KB | Output is correct |
6 | Correct | 7 ms | 1280 KB | Output is correct |
7 | Correct | 14 ms | 2268 KB | Output is correct |
8 | Correct | 15 ms | 2304 KB | Output is correct |
9 | Correct | 7 ms | 1280 KB | Output is correct |
10 | Correct | 7 ms | 1152 KB | Output is correct |
11 | Correct | 18 ms | 2560 KB | Output is correct |
12 | Correct | 22 ms | 2560 KB | Output is correct |
13 | Correct | 8 ms | 1280 KB | Output is correct |
14 | Correct | 11 ms | 1280 KB | Output is correct |
15 | Correct | 16 ms | 2048 KB | Output is correct |
16 | Correct | 14 ms | 2048 KB | Output is correct |
17 | Correct | 17 ms | 2304 KB | Output is correct |
18 | Correct | 17 ms | 2296 KB | Output is correct |
19 | Correct | 17 ms | 2432 KB | Output is correct |
20 | Correct | 17 ms | 2432 KB | Output is correct |