#include "closing.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int max_score(int N, int X, int Y, ll K, vector<int> U, vector<int> V, vector<int> W) {
vector<ll> pfs(N);
for (int i = 0; i < N - 1; i++) {
pfs[i + 1] = pfs[i] + W[i];
}
auto dis = [&](int x, int y) {
if (x > y) swap(x, y);
return pfs[y] - pfs[x];
};
vector<ll> one(N), two(N), s1(N + 1), s2(N + 1);
for (int i = 0; i < N; i++) {
tie(one[i], two[i]) = minmax(dis(X, i), dis(Y, i));
s1[i + 1] = s1[i] + one[i];
s2[i + 1] = s2[i] + two[i];
}
int ans = 0;
{
auto a(one); sort(a.begin(), a.end());
ll sum = 0; int cnt = 0;
while (cnt < N && sum + a[cnt] <= K) sum += a[cnt++];
ans = max(ans, cnt);
}
for (int i = 0; i <= Y; i++) {
ll s = s1[N];
int l = 0, r = N - 1;
for (int j = i; j < N; j++) {
s += two[j] - one[j];
if (r < j) r++;
while (s > K && (l < min(i, X) || r > max(j, Y))) {
if (l < min(i, X) && (r == max(j, Y) || one[l] > one[r])) s -= one[l++];
else s -= one[r--];
}
if (s > K) break;
{
int l1 = l, r1 = r;
int l2 = i, r2 = j;
assert(l1 <= r1);
assert(l2 <= r2);
assert(l1 <= min(X, l2) && r1 >= max(Y, r2));
// assert(s2[r2 + 1] - s2[l2] + s1[l2] - s1[l1] + s1[r1 + 1] - s1[r2 + 1] <= K);
ans = max(ans, r1 - l1 + 1 + r2 - l2 + 1);
}
}
}
for (int l2 = 0; l2 < N; l2++) {
for (int r2 = l2; r2 < N; r2++) {
for (int l1 = 0; l1 <= min(X, l2); l1++) {
for (int r1 = max(Y, r2); r1 < N; r1++) {
if (s2[r2 + 1] - s2[l2] + s1[l2] - s1[l1] + s1[r1 + 1] - s1[r2 + 1] <= K) {
ans = max(ans, r1 - l1 + 1 + r2 - l2 + 1);
}
}
}
}
}
return ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
436 KB |
1st lines differ - on the 1st token, expected: '6', found: '5' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1008 ms |
16472 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Incorrect |
1 ms |
348 KB |
1st lines differ - on the 1st token, expected: '30', found: '38' |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Incorrect |
1 ms |
348 KB |
1st lines differ - on the 1st token, expected: '30', found: '38' |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Incorrect |
1 ms |
348 KB |
1st lines differ - on the 1st token, expected: '30', found: '38' |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
436 KB |
1st lines differ - on the 1st token, expected: '6', found: '5' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
436 KB |
1st lines differ - on the 1st token, expected: '6', found: '5' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
436 KB |
1st lines differ - on the 1st token, expected: '6', found: '5' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
436 KB |
1st lines differ - on the 1st token, expected: '6', found: '5' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
436 KB |
1st lines differ - on the 1st token, expected: '6', found: '5' |
2 |
Halted |
0 ms |
0 KB |
- |