답안 #518808

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
518808 2022-01-24T19:08:35 Z sliviu 쌀 창고 (IOI11_ricehub) C++17
100 / 100
12 ms 1488 KB
#include <bits/stdc++.h>
#include "ricehub.h"

using namespace std;

int besthub(int n, int L, int a[], long long cmax) {
	vector<long long> s(n + 1);
	for (int i = 1; i <= n; ++i)
		s[i] = s[i - 1] + a[i - 1];
	int ans = 0;
	for (int i = 1, j = 1; i <= n; ++i) {
		auto cost = [&](int l, int r) {
			int m = (l + r) / 2;
			return 1LL * (m - l) * a[m - 1] - (s[m - 1] - s[i - 1]) + s[r] - s[m] - 1LL * (r - m) * a[m - 1];
		};
		while (j + 1 <= n && cost(i, j + 1) <= cmax)
			++j;
		ans = max(ans, j - i + 1);
	}
	return ans;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 0 ms 204 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 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 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 464 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 12 ms 1392 KB Output is correct
4 Correct 11 ms 1384 KB Output is correct
5 Correct 5 ms 852 KB Output is correct
6 Correct 5 ms 848 KB Output is correct
7 Correct 10 ms 1392 KB Output is correct
8 Correct 10 ms 1488 KB Output is correct
9 Correct 5 ms 844 KB Output is correct
10 Correct 6 ms 852 KB Output is correct
11 Correct 12 ms 1452 KB Output is correct
12 Correct 12 ms 1412 KB Output is correct
13 Correct 5 ms 848 KB Output is correct
14 Correct 5 ms 848 KB Output is correct
15 Correct 9 ms 1100 KB Output is correct
16 Correct 10 ms 1156 KB Output is correct
17 Correct 11 ms 1284 KB Output is correct
18 Correct 10 ms 1320 KB Output is correct
19 Correct 11 ms 1300 KB Output is correct
20 Correct 11 ms 1352 KB Output is correct