oj.uz

Submission #719556

# Submission time Handle Problem Language Result Execution time Memory
719556 2023-04-06T09:41:25 Z mseebacher Rice Hub (IOI11_ricehub) C++17
0 / 100
 1000 ms 468 KB 
#include <bits/stdc++.h> 

using namespace std;

int besthub(int R, int L, int x[], long long B)
{
	vector<long long> pref(R+1,0);
	for(int i = 0;i<R;i++){
		pref[i+1] = pref[i]+x[i];
	}
	int ans = 0;
	for(int i = 0;i<R;i++){
		int l = 0;
		int r = R;
		int j = 0;
		while(l<=r){
			j = (l+r)/2;
			int mid = (i+j) >> 1;
			long long cost = (long long)(mid-i)*x[mid]*1LL-(pref[mid]-pref[i]); // Seg unten
			cost += (long long)(pref[j+1]-pref[mid+1])-(j-mid)*x[mid]*1LL; // seg oben
			if(cost <= B) {
				ans = max(ans,j-i+1);
				l = j+1;
			}else r = j;
		}
	}
  return ans;
}

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1079 ms 212 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1071 ms 212 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1066 ms 212 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1075 ms 468 KB Time limit exceeded
2 Halted 0 ms 0 KB -