답안 #234954

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
234954	2020-05-26T12:30:18 Z	Nodir_Bobiev	쌀 창고 (IOI11_ricehub)	C++17	17 / 100	33 ms	2560 KB

ricehub

#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;

int besthub(int R, int L, int X[], long long B)
{
	int ans = 0;
	long long sumL[R+2]={}, sumR[R+2]={};
	for( int i = 1; i <= R; i ++ ){
		sumL[i] = sumL[i-1] + X[i-1];
	}
	for( int i = R; i >= 1; i -- ){
		sumR[i] = sumR[i+1] + X[i-1];
	}
	int l = 1, r = 1;
	while( r <= R ){
		//cout << l << ' '<< r << endl;
		long long mid = (sumL[r]-sumL[l-1])/(r-l+1);
		int ll = l, rr = r+1;
		while( rr-ll>1 ){
			int mm=(ll+rr)>>1;
			if(X[mm-1]>mid)
				rr = mm;
			else
				ll = mm;
		}
		bool t = false;
		if( X[ll-1]*1ll*(ll-l+1)-(sumL[ll]-sumL[l-1])+
			(sumR[ll]-sumR[r+1])-X[ll-1]*1ll*(r-ll+1) <= B )
			t = true;
		if( ++ll <= r && X[ll-1]*1ll*(ll-l+1)-(sumL[ll]-sumL[l-1])+
						(sumR[ll]-sumR[r+1])-X[ll-1]*1ll*(r-ll+1) <= B )
			t = true;
		if( t ){
			ans = max(ans, r-l+1);
			r++;
		}
		else l ++;
	}
	return ans;
}

Subtask #1

17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	256 KB	Output is correct
2	Correct	5 ms	256 KB	Output is correct
3	Correct	4 ms	256 KB	Output is correct
4	Correct	4 ms	256 KB	Output is correct
5	Correct	5 ms	384 KB	Output is correct

Subtask #2

0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	256 KB	Output is correct
2	Correct	5 ms	256 KB	Output is correct
3	Correct	5 ms	256 KB	Output is correct
4	Correct	4 ms	256 KB	Output is correct
5	Correct	4 ms	384 KB	Output is correct
6	Correct	5 ms	256 KB	Output is correct
7	Correct	4 ms	256 KB	Output is correct
8	Correct	4 ms	384 KB	Output is correct
9	Correct	5 ms	384 KB	Output is correct
10	Correct	4 ms	256 KB	Output is correct
11	Correct	4 ms	256 KB	Output is correct
12	Correct	4 ms	256 KB	Output is correct
13	Correct	5 ms	384 KB	Output is correct
14	Correct	4 ms	256 KB	Output is correct
15	Correct	4 ms	256 KB	Output is correct
16	Correct	4 ms	384 KB	Output is correct
17	Correct	4 ms	256 KB	Output is correct
18	Correct	4 ms	256 KB	Output is correct
19	Correct	4 ms	256 KB	Output is correct
20	Correct	4 ms	256 KB	Output is correct
21	Correct	5 ms	384 KB	Output is correct
22	Correct	4 ms	384 KB	Output is correct
23	Correct	4 ms	384 KB	Output is correct
24	Correct	5 ms	256 KB	Output is correct
25	Correct	5 ms	256 KB	Output is correct
26	Correct	5 ms	384 KB	Output is correct
27	Incorrect	5 ms	384 KB	Output isn't correct
28	Halted	0 ms	0 KB	-

Subtask #3

0 / 26.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	256 KB	Output is correct
2	Correct	5 ms	256 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	5 ms	256 KB	Output is correct
5	Correct	6 ms	256 KB	Output is correct
6	Correct	5 ms	256 KB	Output is correct
7	Correct	5 ms	384 KB	Output is correct
8	Correct	5 ms	384 KB	Output is correct
9	Correct	5 ms	256 KB	Output is correct
10	Correct	4 ms	256 KB	Output is correct
11	Correct	5 ms	384 KB	Output is correct
12	Correct	5 ms	384 KB	Output is correct
13	Correct	5 ms	256 KB	Output is correct
14	Correct	5 ms	384 KB	Output is correct
15	Correct	4 ms	256 KB	Output is correct
16	Correct	5 ms	384 KB	Output is correct
17	Correct	5 ms	384 KB	Output is correct
18	Correct	5 ms	384 KB	Output is correct
19	Correct	5 ms	384 KB	Output is correct
20	Correct	6 ms	384 KB	Output is correct
21	Correct	6 ms	384 KB	Output is correct
22	Correct	6 ms	384 KB	Output is correct
23	Correct	5 ms	384 KB	Output is correct
24	Correct	6 ms	384 KB	Output is correct
25	Correct	6 ms	384 KB	Output is correct
26	Correct	6 ms	384 KB	Output is correct
27	Incorrect	7 ms	384 KB	Output isn't correct
28	Halted	0 ms	0 KB	-

Subtask #4

0 / 32.0

#	결과	실행 시간	메모리	Grader output
1	Correct	9 ms	640 KB	Output is correct
2	Correct	9 ms	640 KB	Output is correct
3	Correct	31 ms	2304 KB	Output is correct
4	Correct	31 ms	2304 KB	Output is correct
5	Correct	16 ms	1280 KB	Output is correct
6	Correct	15 ms	1280 KB	Output is correct
7	Correct	28 ms	2304 KB	Output is correct
8	Correct	28 ms	2304 KB	Output is correct
9	Correct	18 ms	1280 KB	Output is correct
10	Correct	18 ms	1280 KB	Output is correct
11	Correct	33 ms	2304 KB	Output is correct
12	Correct	32 ms	2304 KB	Output is correct
13	Correct	17 ms	1664 KB	Output is correct
14	Correct	21 ms	1664 KB	Output is correct
15	Correct	25 ms	2560 KB	Output is correct
16	Incorrect	26 ms	2560 KB	Output isn't correct
17	Halted	0 ms	0 KB	-