oj.uz

답안 #234946

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
234946 2020-05-26T11:56:36 Z Nodir_Bobiev 쌀 창고 (IOI11_ricehub) C++17
26 / 100
 1000 ms 3328 KB 
#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];
	}
	for( int i = 1; i <= R; i ++ ){
		int l = 1, r = R+1;
		while( r - l > 1 ){
			int m = ( l + r ) >> 1;
			long long mn = 1e18;
			for( int j = max(i-m+1,1); j <= min(i,R-m+1); j++){
				int k = j + m-1;
				mn = min(mn, X[i-1]*1ll*(i-j+1)-(sumL[i]-sumL[j-1]) + 
							(sumR[i]-sumR[k+1])-X[i-1]*1ll*(k-i+1)  );
			}
			if( mn <= B ) {
				ans = max(m, ans);
				l = m;
			}else{
				r = m;
			}
		}
	}
	return ans;
}

Subtask #1
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 6 ms 384 KB Output is correct
8 Correct 6 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 6 ms 384 KB Output is correct
12 Correct 6 ms 384 KB Output is correct
13 Correct 6 ms 384 KB Output is correct
14 Correct 6 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 6 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 6 ms 384 KB Output is correct
19 Correct 6 ms 384 KB Output is correct
20 Correct 6 ms 384 KB Output is correct
21 Correct 41 ms 384 KB Output is correct
22 Correct 41 ms 384 KB Output is correct
23 Correct 35 ms 512 KB Output is correct
24 Correct 49 ms 512 KB Output is correct
25 Correct 41 ms 504 KB Output is correct
26 Correct 48 ms 384 KB Output is correct
27 Correct 118 ms 496 KB Output is correct
28 Correct 112 ms 512 KB Output is correct

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 399 ms 888 KB Output is correct
2 Correct 400 ms 884 KB Output is correct
3 Execution timed out 1088 ms 3328 KB Time limit exceeded
4 Halted 0 ms 0 KB -