답안 #502841

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
502841	2022-01-06T16:00:47 Z	wind_reaper	쌀 창고 (IOI11_ricehub)	C++17	100 / 100	14 ms	1732 KB

ricehub

#include <bits/stdc++.h>
#include "ricehub.h"

using namespace std;

int besthub(int R, int L, int X[], long long int B){
	long long int temp = 0; int ans = 0;
	
	for(int l = 0, r = 0; l < R; l++){
		while(r + 1 < R && temp + X[r + 1] - X[(l + r + 1) / 2] <= B){
			temp += X[r + 1] - X[(l + r + 1)/2];
			r++;
			ans = max(ans, r - l + 1);
		}
		temp += X[l] - X[(r + l + 1)/2];
	}
	
	return ans;
}

Subtask #1

17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	300 KB	Output is correct
2	Correct	0 ms	300 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	1 ms	296 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct

Subtask #2

25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	300 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	0 ms	304 KB	Output is correct
13	Correct	1 ms	304 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	0 ms	304 KB	Output is correct
17	Correct	0 ms	204 KB	Output is correct
18	Correct	0 ms	308 KB	Output is correct
19	Correct	0 ms	204 KB	Output is correct
20	Correct	0 ms	204 KB	Output is correct
21	Correct	0 ms	204 KB	Output is correct
22	Correct	0 ms	204 KB	Output is correct
23	Correct	0 ms	204 KB	Output is correct
24	Correct	0 ms	204 KB	Output is correct
25	Correct	0 ms	204 KB	Output is correct
26	Correct	0 ms	204 KB	Output is correct
27	Correct	1 ms	204 KB	Output is correct
28	Correct	0 ms	204 KB	Output is correct

Subtask #3

26.0 / 26.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	300 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Correct	0 ms	204 KB	Output is correct
17	Correct	0 ms	308 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	1 ms	312 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct
21	Correct	1 ms	324 KB	Output is correct
22	Correct	1 ms	332 KB	Output is correct
23	Correct	1 ms	320 KB	Output is correct
24	Correct	1 ms	332 KB	Output is correct
25	Correct	1 ms	320 KB	Output is correct
26	Correct	1 ms	332 KB	Output is correct
27	Correct	1 ms	316 KB	Output is correct
28	Correct	1 ms	332 KB	Output is correct

Subtask #4

32.0 / 32.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	436 KB	Output is correct
2	Correct	2 ms	424 KB	Output is correct
3	Correct	12 ms	1732 KB	Output is correct
4	Correct	12 ms	1672 KB	Output is correct
5	Correct	5 ms	752 KB	Output is correct
6	Correct	6 ms	820 KB	Output is correct
7	Correct	13 ms	1444 KB	Output is correct
8	Correct	11 ms	1440 KB	Output is correct
9	Correct	6 ms	708 KB	Output is correct
10	Correct	5 ms	688 KB	Output is correct
11	Correct	13 ms	1700 KB	Output is correct
12	Correct	11 ms	1712 KB	Output is correct
13	Correct	5 ms	840 KB	Output is correct
14	Correct	9 ms	844 KB	Output is correct
15	Correct	9 ms	1360 KB	Output is correct
16	Correct	9 ms	1332 KB	Output is correct
17	Correct	9 ms	1484 KB	Output is correct
18	Correct	11 ms	1676 KB	Output is correct
19	Correct	11 ms	1604 KB	Output is correct
20	Correct	14 ms	1732 KB	Output is correct