oj.uz

Submission #233117

# Submission time Handle Problem Language Result Execution time Memory
233117 2020-05-19T11:47:08 Z crossing0ver Rice Hub (IOI11_ricehub) C++17
0 / 100
 9 ms 640 KB 
#include<bits/stdc++.h>
#include "ricehub.h"
using namespace std;
int besthub(int n, int L, int X[], long long B){ 
	long long sum = 0;
	int num = 0;
	int last = 0;
	vector<long long> PR(n);
	int ans = 0,ps = 0;
	for (int i = 0 ; i < n; i++) {
		sum += X[i];
		PR[i] = sum;         
		num++;                   
		while (true) {
		long long  e = sum/num;
		int pos = lower_bound(X + last, X + i+1, e) - X;
		long long D = 0; 
		long long s = X[pos]*(pos - last + 1) - (PR[pos] - (last ? PR[last-1] : 0)) + (PR[i] - PR[pos]) -X[pos]*( i - pos);
		if (s <= B)
		if (ans < i - last + 1) 
			ans = i - last + 1, ps = X[pos];
		D = s;                                   
		pos = upper_bound(X + last, X + i+1, e) - X - 1;
		if (pos <= i && pos >= last) 
		s =X[pos]*(pos - last + 1) - (PR[pos] - (last ? PR[last-1] : 0)) + (PR[i] - PR[pos]) -X[pos]*( i - pos);
		D = min(D,s);
			if (s <= B)
		if (ans < i - last + 1)        
			ans = i - last + 1, ps = X[pos];
		if (D > B) {
			
			last++;
			num--;
			continue;
		}                      
		else break;
		}
	}
	return ps;
}   /*
main() {
	int n,L;
	long long B;
	cin >> n >> L >> B;   int X[n];
	for (int i = 0; i < n ; i++) cin >> X[i];
	cout << besthub(n,L,X,B);
}
					   )           */

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 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 4 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

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

Subtask #4
0 / 32.0

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