oj.uz

Submission #417744

# Submission time Handle Problem Language Result Execution time Memory
417744 2021-06-04T08:26:49 Z Mohammed_Atalah Rice Hub (IOI11_ricehub) C++17
68 / 100
 1000 ms 1740 KB 
#include "ricehub.h"
#include <bits/stdc++.h>

using namespace std;

int besthub(int R, int L, int X[], long long B)
{


	int left = 0; int right = 0;
	int mx = R;
	int res = 0;
	while (right < mx && left < mx) {
		if (X[right] - X[left] > B) {
			left++;
		}
		int mid = left + ((right - left) / 2);
		int total = 0;
		int rice = 1;
		for (int i = left; i < mid; i++) {
			total += X[mid] - X[i];
			rice++;
		}
		for (int i = mid + 1; i < right + 1; i++) {
			total += X[i] - X[mid];
			rice++;
		}
		if (total > B) {
			left++;
		} else {
			right++;
			if (rice > res) {
				res = rice;
			}
		}
	}

	return res;

}

Subtask #1
17.0 / 17.0

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

Subtask #2
25.0 / 25.0

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

Subtask #3
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 280 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 312 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 2 ms 204 KB Output is correct
20 Correct 1 ms 304 KB Output is correct
21 Correct 3 ms 316 KB Output is correct
22 Correct 3 ms 332 KB Output is correct
23 Correct 8 ms 332 KB Output is correct
24 Correct 7 ms 332 KB Output is correct
25 Correct 8 ms 332 KB Output is correct
26 Correct 8 ms 332 KB Output is correct
27 Correct 8 ms 332 KB Output is correct
28 Correct 8 ms 332 KB Output is correct

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 460 KB Output is correct
2 Correct 6 ms 460 KB Output is correct
3 Execution timed out 1079 ms 1740 KB Time limit exceeded
4 Halted 0 ms 0 KB -