oj.uz

Submission #719547

# Submission time Handle Problem Language Result Execution time Memory
719547 2023-04-06T09:34:20 Z mseebacher Rice Hub (IOI11_ricehub) C++17
68 / 100
 1000 ms 2508 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++){
		for(int j = 0;j<R;j++){
			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);
		}
	}
  return ans;
}

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 308 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 308 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 308 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 2 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 308 KB Output is correct

Subtask #3
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 4 ms 212 KB Output is correct
4 Correct 3 ms 324 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 3 ms 212 KB Output is correct
8 Correct 4 ms 212 KB Output is correct
9 Correct 1 ms 304 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 2 ms 212 KB Output is correct
12 Correct 2 ms 324 KB Output is correct
13 Correct 4 ms 320 KB Output is correct
14 Correct 4 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 3 ms 216 KB Output is correct
18 Correct 2 ms 216 KB Output is correct
19 Correct 3 ms 324 KB Output is correct
20 Correct 3 ms 216 KB Output is correct
21 Correct 59 ms 380 KB Output is correct
22 Correct 58 ms 380 KB Output is correct
23 Correct 67 ms 340 KB Output is correct
24 Correct 67 ms 340 KB Output is correct
25 Correct 79 ms 388 KB Output is correct
26 Correct 67 ms 340 KB Output is correct
27 Correct 67 ms 384 KB Output is correct
28 Correct 62 ms 340 KB Output is correct

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 912 ms 468 KB Output is correct
2 Correct 894 ms 596 KB Output is correct
3 Execution timed out 1084 ms 2508 KB Time limit exceeded
4 Halted 0 ms 0 KB -