답안 #31243

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
31243 2017-08-15T11:57:50 Z 14kg 쌀 창고 (IOI11_ricehub) C++11
100 / 100
29 ms 5020 KB
#include "ricehub.h"
#define f(x,y) (long long)(in[y+1]-in[(x+y)/2+1-(y-x+1)%2])

int besthub(int n, int max_L, int in[], long long B){
    int x=0, y=0, out=0;
    long long sum=0;

    while(x<n){
        while(y+1<n && sum+f(x,y)<=B) sum+=f(x,y), y++;
        out=out>y-x+1?out:y-x+1;
        sum-=(long long)(in[(x+y)/2+1-(y-x+1)%2]-in[x]), x++;
    } return out;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 5020 KB Output is correct
2 Correct 0 ms 5020 KB Output is correct
3 Correct 0 ms 5020 KB Output is correct
4 Correct 0 ms 5020 KB Output is correct
5 Correct 0 ms 5020 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 5020 KB Output is correct
2 Correct 0 ms 5020 KB Output is correct
3 Correct 0 ms 5020 KB Output is correct
4 Correct 0 ms 5020 KB Output is correct
5 Correct 0 ms 5020 KB Output is correct
6 Correct 0 ms 5020 KB Output is correct
7 Correct 0 ms 5020 KB Output is correct
8 Correct 0 ms 5020 KB Output is correct
9 Correct 0 ms 5020 KB Output is correct
10 Correct 0 ms 5020 KB Output is correct
11 Correct 0 ms 5020 KB Output is correct
12 Correct 0 ms 5020 KB Output is correct
13 Correct 0 ms 5020 KB Output is correct
14 Correct 0 ms 5020 KB Output is correct
15 Correct 0 ms 5020 KB Output is correct
16 Correct 0 ms 5020 KB Output is correct
17 Correct 0 ms 5020 KB Output is correct
18 Correct 0 ms 5020 KB Output is correct
19 Correct 0 ms 5020 KB Output is correct
20 Correct 0 ms 5020 KB Output is correct
21 Correct 0 ms 5020 KB Output is correct
22 Correct 0 ms 5020 KB Output is correct
23 Correct 0 ms 5020 KB Output is correct
24 Correct 0 ms 5020 KB Output is correct
25 Correct 0 ms 5020 KB Output is correct
26 Correct 0 ms 5020 KB Output is correct
27 Correct 0 ms 5020 KB Output is correct
28 Correct 0 ms 5020 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 5020 KB Output is correct
2 Correct 0 ms 5020 KB Output is correct
3 Correct 0 ms 5020 KB Output is correct
4 Correct 0 ms 5020 KB Output is correct
5 Correct 0 ms 5020 KB Output is correct
6 Correct 0 ms 5020 KB Output is correct
7 Correct 0 ms 5020 KB Output is correct
8 Correct 0 ms 5020 KB Output is correct
9 Correct 0 ms 5020 KB Output is correct
10 Correct 0 ms 5020 KB Output is correct
11 Correct 0 ms 5020 KB Output is correct
12 Correct 0 ms 5020 KB Output is correct
13 Correct 0 ms 5020 KB Output is correct
14 Correct 0 ms 5020 KB Output is correct
15 Correct 0 ms 5020 KB Output is correct
16 Correct 0 ms 5020 KB Output is correct
17 Correct 0 ms 5020 KB Output is correct
18 Correct 0 ms 5020 KB Output is correct
19 Correct 0 ms 5020 KB Output is correct
20 Correct 0 ms 5020 KB Output is correct
21 Correct 0 ms 5020 KB Output is correct
22 Correct 0 ms 5020 KB Output is correct
23 Correct 0 ms 5020 KB Output is correct
24 Correct 0 ms 5020 KB Output is correct
25 Correct 0 ms 5020 KB Output is correct
26 Correct 0 ms 5020 KB Output is correct
27 Correct 0 ms 5020 KB Output is correct
28 Correct 0 ms 5020 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5020 KB Output is correct
2 Correct 0 ms 5020 KB Output is correct
3 Correct 19 ms 5020 KB Output is correct
4 Correct 19 ms 5020 KB Output is correct
5 Correct 6 ms 5020 KB Output is correct
6 Correct 6 ms 5020 KB Output is correct
7 Correct 13 ms 5020 KB Output is correct
8 Correct 9 ms 5020 KB Output is correct
9 Correct 0 ms 5020 KB Output is correct
10 Correct 3 ms 5020 KB Output is correct
11 Correct 19 ms 5020 KB Output is correct
12 Correct 23 ms 5020 KB Output is correct
13 Correct 6 ms 5020 KB Output is correct
14 Correct 6 ms 5020 KB Output is correct
15 Correct 16 ms 5020 KB Output is correct
16 Correct 16 ms 5020 KB Output is correct
17 Correct 16 ms 5020 KB Output is correct
18 Correct 23 ms 5020 KB Output is correct
19 Correct 29 ms 5020 KB Output is correct
20 Correct 13 ms 5020 KB Output is correct