#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<vector<pair<ll,ll>>>graph;
vector<bool> vis;
void dfs1(vector<ll> &dist, int x, ll d){
vis[x] = true;
dist[x] = d;
for (auto [y, w] : graph[x]){
if (!vis[y]){
dfs1(dist, y, d + w);
}
}
}
void dfs2(vector<pair<ll,ll>>dist, int x, ll d){
vis[x] = true;
dist[x].first= d;
for (auto [y, w] : graph[x]){
if (!vis[y]){
dfs2(dist, y, d + w);
}
}
}
int max_score(int N, int X, int Y, ll K, vector<int> U, vector<int> V, vector<int> W){
graph.assign(N,vector<pair<ll,ll>>());
for(int i=0;i<(N-1);i++){
graph[U[i]].push_back({V[i],W[i]});
graph[V[i]].push_back({U[i],W[i]});
}
//Calculo de distancia.
vis.assign(N,false);
vector<ll>distX(N);
dfs1(distX,X,0);
vis.assign(N,false);
vector<ll>distY(N);
dfs1(distY,Y,0);
vis.assign(N,false);
vector<pair<ll,ll>>orden;
for(int i=0;i<N;i++){
pair<ll,ll>par;
par.first=0;
par.second=i;
orden.push_back(par);
}
dfs2(orden,max_element(distX.begin(),distX.end())-distX.begin(),0);
sort(orden.begin(),orden.end());
int pos_x;
int pos_y;
for(int i=0;i<N;i++){
if(orden[i].second==X){
pos_x=i;
}
else if(orden[i].second==Y){
pos_y=i;
}
}
pos_x++;
pos_y++;
vector<ll>prefix1(N+1,0);
for(int i=0;i<N;i++){
prefix1[i+1]=prefix1[i]+distX[orden[i].second];
}
vector<ll>prefix2(N+1,0);
for(int i=0;i<N;i++){
prefix2[i+1]=prefix2[i]+distY[orden[i].second];
}
int ans=0;
for(int i=0;i<pos_x;i++){
for(int j=i;j<=N;j++){
for(int k=0;k<pos_y;k++){
for(int l=k;l<=N;l++){
if((prefix1[j]-prefix1[i]+prefix2[l]-prefix2[k])<=K){
ans=max((j-i+l-k),ans);
}
}
}
}
}
return ans;
}
Compilation message
closing.cpp: In function 'int max_score(int, int, int, ll, std::vector<int>, std::vector<int>, std::vector<int>)':
closing.cpp:47:6: warning: 'pos_x' may be used uninitialized in this function [-Wmaybe-uninitialized]
47 | int pos_x;
| ^~~~~
closing.cpp:48:6: warning: 'pos_y' may be used uninitialized in this function [-Wmaybe-uninitialized]
48 | int pos_y;
| ^~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
348 KB |
1st lines differ - on the 1st token, expected: '6', found: '4' |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
813 ms |
2097152 KB |
Execution killed with signal 9 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
348 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
348 KB |
1st lines differ - on the 1st token, expected: '30', found: '24' |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
348 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
348 KB |
1st lines differ - on the 1st token, expected: '30', found: '24' |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
348 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
348 KB |
1st lines differ - on the 1st token, expected: '30', found: '24' |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
348 KB |
1st lines differ - on the 1st token, expected: '6', found: '4' |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
348 KB |
1st lines differ - on the 1st token, expected: '6', found: '4' |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
348 KB |
1st lines differ - on the 1st token, expected: '6', found: '4' |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
348 KB |
1st lines differ - on the 1st token, expected: '6', found: '4' |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
348 KB |
1st lines differ - on the 1st token, expected: '6', found: '4' |
| 2 |
Halted |
0 ms |
0 KB |
- |
