답안 #460578

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
460578	2021-08-09T07:39:29 Z	fuad27	쌀 창고 (IOI11_ricehub)	C++14	100 / 100	20 ms	1756 KB

ricehub

#include "ricehub.h"
#include<bits/stdc++.h>
using namespace std;
int besthub(int R, int L, int x[], long long B) {
	int MAX = 0;
	long long c = 0;
	for(int i = 0, j = 0;j<R;j++) {
		c += x[j] - x[(i + j)/2];
		while(B - c < 0) {
			 c -= x[(i + 1 + j)/2] - x[i];
			 i++;
		}
		MAX = max(MAX, j-i+1);
	}
	return MAX;
}/*
int main () {
	int X[5] = {1, 2, 10, 12, 14};
	cerr<<besthub(5, 20, X, 6);			
}*/

Subtask #1

17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 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	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 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	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	0 ms	204 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	1 ms	204 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	204 KB	Output is correct
17	Correct	0 ms	204 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	0 ms	204 KB	Output is correct
20	Correct	0 ms	204 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	1 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	1 ms	204 KB	Output is correct
27	Correct	1 ms	204 KB	Output is correct
28	Correct	1 ms	204 KB	Output is correct

Subtask #3

26.0 / 26.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 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	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	0 ms	204 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	2 ms	204 KB	Output is correct
21	Correct	2 ms	204 KB	Output is correct
22	Correct	1 ms	300 KB	Output is correct
23	Correct	2 ms	204 KB	Output is correct
24	Correct	1 ms	204 KB	Output is correct
25	Correct	1 ms	204 KB	Output is correct
26	Correct	1 ms	320 KB	Output is correct
27	Correct	1 ms	204 KB	Output is correct
28	Correct	1 ms	204 KB	Output is correct

Subtask #4

32.0 / 32.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	332 KB	Output is correct
2	Correct	3 ms	460 KB	Output is correct
3	Correct	14 ms	1652 KB	Output is correct
4	Correct	20 ms	1756 KB	Output is correct
5	Correct	6 ms	796 KB	Output is correct
6	Correct	7 ms	844 KB	Output is correct
7	Correct	12 ms	1432 KB	Output is correct
8	Correct	13 ms	1396 KB	Output is correct
9	Correct	6 ms	780 KB	Output is correct
10	Correct	6 ms	716 KB	Output is correct
11	Correct	14 ms	1660 KB	Output is correct
12	Correct	15 ms	1724 KB	Output is correct
13	Correct	7 ms	844 KB	Output is correct
14	Correct	7 ms	848 KB	Output is correct
15	Correct	10 ms	1356 KB	Output is correct
16	Correct	10 ms	1372 KB	Output is correct
17	Correct	14 ms	1532 KB	Output is correct
18	Correct	12 ms	1484 KB	Output is correct
19	Correct	14 ms	1612 KB	Output is correct
20	Correct	14 ms	1612 KB	Output is correct