#include <bits/stdc++.h>
#include "closing.h"
using namespace std;
struct BIT
{
int n;
vector<long long> ft;
void init(int N)
{
n = N + 5;
ft.assign(n + 5, 0);
}
void add(int pos, long long val)
{
for (pos = pos + 1; pos <= n; pos += pos & -pos) ft[pos] += val;
}
long long get(int pos, long long res = 0)
{
for (pos = pos + 1; pos > 0; pos -= pos & -pos) res += ft[pos];
return res;
}
};
const int MXN = 2e5 + 5;
int n, x, y;
long long k;
vector<array<long long, 2>> adj[MXN];
long long d[2][MXN], p[3][MXN];
void dfs(int a, int p, int t)
{
for (const array<long long, 2> &v : adj[a])
{
if (v[0] == p) continue;
d[t][v[0]] = d[t][a] + v[1];
dfs(v[0], a, t);
}
}
int max_score(int N, int X, int Y, long long K, vector<int> U, vector<int> V, vector<int> W)
{
n = N, x = X, y = Y, k = K;
for (int i = 0; i < n; i++)
{
d[0][i] = d[1][i] = 0;
adj[i].clear();
}
int f = 1;
for (int i = 0; i < n - 1; i++)
{
adj[U[i]].push_back({V[i], W[i]});
adj[V[i]].push_back({U[i], W[i]});
f &= U[i] == i && V[i] == i + 1;
}
dfs(x, x, 0);
dfs(y, y, 1);
int ans = 0;
{
vector<long long> v;
for (int i = 0; i < n; i++) v.push_back(min(d[0][i], d[1][i]));
sort(v.begin(), v.end());
long long k1 = k;
for (int i = 0; i < n; i++)
{
k1 -= v[i];
if (k1 < 0) break;
ans++;
}
}
return 0;
if (f) return ans;
for (int j = 0; j < 3; j++)
{
for (int i = 0; i < N; i++)
{
if (j < 2) p[j][i] = (i ? p[j][i - 1] : 0) + d[j][i];
else p[j][i] = (i ? p[j][i - 1] : 0) + max(d[0][k], d[1][k]);
}
}
BIT ft, cnt;
for (int i = 0; i < n; i++)
{
ft.init(n), cnt.init(n);
vector<array<long long, 2>> v;
vector<int> idx(n, -1);
for (int j = 0; j < min(i, X); j++) v.push_back({d[0][j], j});
for (int j = max(i, Y) + 1; j < n; j++) v.push_back({d[1][j], j});
sort(v.begin(), v.end());
for (int i = 0; i < v.size(); i++)
{
idx[v[i][1]] = i;
ft.add(i, v[i][0]);
cnt.add(i, 1);
}
for (int j = i; j < n; j++)
{
if (max(i, X) > min(j, Y)) continue;
long long k1 = k - (p[2][j] - (i ? p[2][i - 1] : 0));
if (X < i) k1 -= p[0][i - 1] - (X ? p[0][X - 1] : 0);
if (j < Y) k1 -= p[1][Y] - p[1][j];
if (k1 < 0) continue;
int res = max(j, Y) - min(i, X) + 1 + (j - i + 1);
int l = 0, r = n - 1;
while (l < r)
{
int mid = (l + r + 1) >> 1;
if (ft.get(mid) <= k1) l = mid;
else r = mid - 1;
}
res += cnt.get(l);
ans = max(ans, res);
if (idx[j] != -1) ft.add(idx[j], -v[idx[j]][0]), cnt.add(idx[j], -1);
}
}
return ans;
}
Compilation message
closing.cpp: In function 'int max_score(int, int, int, long long int, std::vector<int>, std::vector<int>, std::vector<int>)':
closing.cpp:92:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::array<long long int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
92 | for (int i = 0; i < v.size(); i++)
| ~~^~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
8536 KB |
1st lines differ - on the 1st token, expected: '6', found: '0' |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
119 ms |
31128 KB |
1st lines differ - on the 1st token, expected: '451', found: '0' |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
8636 KB |
1st lines differ - on the 1st token, expected: '3', found: '0' |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
8636 KB |
1st lines differ - on the 1st token, expected: '3', found: '0' |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
8636 KB |
1st lines differ - on the 1st token, expected: '3', found: '0' |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
8536 KB |
1st lines differ - on the 1st token, expected: '6', found: '0' |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
8536 KB |
1st lines differ - on the 1st token, expected: '6', found: '0' |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
8536 KB |
1st lines differ - on the 1st token, expected: '6', found: '0' |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
8536 KB |
1st lines differ - on the 1st token, expected: '6', found: '0' |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
8536 KB |
1st lines differ - on the 1st token, expected: '6', found: '0' |
| 2 |
Halted |
0 ms |
0 KB |
- |
