oj.uz

Submission #781198

# Submission time Handle Problem Language Result Execution time Memory
781198 2023-07-12T22:31:01 Z zsombor Rice Hub (IOI11_ricehub) C++17
100 / 100
 26 ms 3352 KB 
#include <iostream>
#include <vector>
#include "ricehub.h"
using namespace std;
using ll = long long;

int n, ans;
ll m;
vector <ll> r(1e5 + 1, 0);
vector <ll> p(1e5 + 1, 0);

ll sum(int L, int R) {
	return p[R] - p[L - 1];
}

ll distL(int i, int cnt) {
	int L = i - cnt < 1 ? 1 : i - cnt;
	return r[i] * (i - L) - sum(L, i - 1);
}

ll distR(int i, int cnt) {
	int R = i + cnt > n ? n : i + cnt;
	return sum(i + 1, R) - r[i] * (R - i);
}

ll dist(int i, int cnt) {
	return distL(i, cnt) + distR(i, cnt);
}

void solve(int i) {
	int a = 0, b = n, c;
	while (b - a > 1) {
		c = (a + b) / 2;
		dist(i, c) <= m ? a = c : b = c;
	}
	int L = max(1, i - a), R = min(n, i + a);
	ans = max(ans, R - L + 1);
	if (L > 1 && dist(i, a) + r[i] - r[L - 1] < m) ans = max(ans, R - L + 2);
	if (R < n && dist(i, a) + r[R + 1] - r[i] < m) ans = max(ans, R - L + 2);
}

int besthub(int N, int L, int R[], ll M) {
	n = N; m = M;
	for (int i = 1; i <= n; i++) {
		r[i] = R[i - 1];
		p[i] = p[i - 1] + r[i];
	}
	for (int i = 1; i <= n; i++) solve(i);
	return ans;
}

Subtask #1
17.0 / 17.0

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

Subtask #2
25.0 / 25.0

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

Subtask #3
26.0 / 26.0

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

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2072 KB Output is correct
2 Correct 5 ms 2004 KB Output is correct
3 Correct 22 ms 3296 KB Output is correct
4 Correct 26 ms 3352 KB Output is correct
5 Correct 11 ms 2440 KB Output is correct
6 Correct 11 ms 2432 KB Output is correct
7 Correct 21 ms 3060 KB Output is correct
8 Correct 22 ms 3064 KB Output is correct
9 Correct 11 ms 2256 KB Output is correct
10 Correct 11 ms 2264 KB Output is correct
11 Correct 23 ms 3248 KB Output is correct
12 Correct 23 ms 3296 KB Output is correct
13 Correct 11 ms 2476 KB Output is correct
14 Correct 12 ms 2484 KB Output is correct
15 Correct 17 ms 2872 KB Output is correct
16 Correct 18 ms 2900 KB Output is correct
17 Correct 23 ms 3184 KB Output is correct
18 Correct 21 ms 3184 KB Output is correct
19 Correct 22 ms 3204 KB Output is correct
20 Correct 22 ms 3176 KB Output is correct