oj.uz

Submission #234976

# Submission time Handle Problem Language Result Execution time Memory
234976 2020-05-26T13:21:35 Z Nodir_Bobiev Rice Hub (IOI11_ricehub) C++17
0 / 100
 7 ms 768 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];
	}
	int l = 1, r = 1;
	while( r <= R ){
		//cout << l << ' '<< r << endl;
		int ll = (l+r)>>2;
		bool t = false;
		if( X[ll-1]*(ll-l+1)-(sumL[ll]-sumL[l-1])+
			(sumR[ll]-sumR[r+1])-X[ll-1]*(r-ll+1) <= B )
			t = true;
		if( ++ll <= r && X[ll-1]*(ll-l+1)-(sumL[ll]-sumL[l-1])+
						(sumR[ll]-sumR[r+1])-X[ll-1]*(r-ll+1) <= B )
			t = true;
		if( t ){
			ans = max(ans, r-l+1);
			r++;
		}
		else l ++;
	}
	return ans;
}

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 768 KB Output isn't correct
2 Halted 0 ms 0 KB -