#include <bits/stdc++.h>
#include "closing.h"
using namespace std;
vector<pair<int, long long>> adj[200005];
long long D[200005][2];
vector<long long> pL, pR, pM;
void dfs(int X, int p, int st) {
for(auto u : adj[X]) {
if(u.first == p) continue;
D[u.first][st] = D[X][st] + u.second;
dfs(u.first, X, st);
}
}
long long sum(int l, int r, vector<long long> arr) {
return arr[r] - (l > 0 ? arr[l - 1] : 0);
}
int max_score(int N, int X, int Y, long long K,
vector<int> U, vector<int> V, vector<int> W) {
pL.resize(N); pR.resize(N); pM.resize(N);
for(int l = 0; l < N; l++) D[l][0] = D[l][1] = 2e18 + 7, adj[l].clear();
for(int l = 0; l < N - 1; l++) {
adj[U[l]].push_back({V[l], W[l]});
adj[V[l]].push_back({U[l], W[l]});
}
if(X > Y) swap(X, Y);
D[X][0] = 0, D[Y][1] = 0;
dfs(X, X, 0); dfs(Y, Y, 1);
for(int l = 0; l < N; l++) {
pL[l] = D[l][0];
pR[l] = D[l][1];
pM[l] = min(D[l][0], D[l][1]);
if(l > 0) {
pL[l] += pL[l - 1];
pR[l] += pR[l - 1];
pM[l] += pM[l - 1];
}
}
int res = 0;
for(int l = 0; l < N; l++) {
for(int i = l; i < N; i++) {
int lo = l, hi = i;
long long calc = sum(l, i, pL) + sum(l, i, pR) - sum(l, i, pM);
if(calc > K) continue;
int cur = i - l + 1;
priority_queue<pair<int, long long>, vector<pair<int, long long>>, greater<pair<int, long long>>> pq;
if(i < N - 1) pq.push({min(D[i + 1][0], D[i + 1][1]), i + 1});
if(l > 0) pq.push({min(D[l - 1][0], D[l - 1][1]), l - 1});
while(!pq.empty()) {
int x = pq.top().second; long long w = pq.top().first;
pq.pop(); calc += w;
if(calc > K) break;
++cur; lo = min(lo, x), hi = max(hi, x);
if(x > i && x < N - 1) pq.push({min(D[x + 1][0], D[x + 1][1]), x + 1});
if(x < l && x > 0) pq.push({min(D[x - 1][0], D[x - 1][1]), x - 1});
}
if(X >= lo && Y <= hi) res = max(res, cur);
}
}
vector<int> belong(N, -1);
belong[X] = 0, belong[Y] = 1;
priority_queue<array<long long, 3>, vector<array<long long, 3>>, greater<array<long long, 3>>> pq;
pq.push({0, X, 0}); pq.push({0, Y, 1});
int cur = 0; long long calc = 0;
while(!pq.empty()) {
int a = pq.top()[1], st = pq.top()[2];
long long w = pq.top()[0]; pq.pop();
if(calc + w > K) break;
if(belong[a] != -1) continue;
belong[a] = st; calc += w; cur++;
if(a > 0) {
int b = a - 1;
if(belong[b] == -1) {
array<long long, 3> arr = {D[b][st], b, st};
pq.push(arr);
}
}
if(a < N - 1) {
int b = a + 1;
if(belong[b] == -1) {
array<long long, 3> arr = {D[b][st], b, st};
pq.push(arr);
}
}
}
res = max(res, cur);
return res;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
5980 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 |
1061 ms |
38628 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
5976 KB |
1st lines differ - on the 1st token, expected: '3', found: '2' |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
5976 KB |
1st lines differ - on the 1st token, expected: '3', found: '2' |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
5976 KB |
1st lines differ - on the 1st token, expected: '3', found: '2' |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
5980 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 |
2 ms |
5980 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 |
2 ms |
5980 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 |
2 ms |
5980 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 |
2 ms |
5980 KB |
1st lines differ - on the 1st token, expected: '6', found: '5' |
| 2 |
Halted |
0 ms |
0 KB |
- |
