#include <bits/stdc++.h>
using namespace std;
#define dbgv(v) cout<<#v<<" = "; f(i,0,v.size()) cout<<v[i]<<" "; cout<<endl
#define dbga(a,x,y) cout<<#a<<" = "; f(i,x,y) cout<<a[i]<<" "; cout<<endl
#define erorp(x) cout<<#x<<"={"<<(x.F)<<" , "<<x.S<<"}"<<endl
#define eror(x) cout<<#x<<'='<<(x)<<endl
#define f_(i,a,b) for(int i=a;i>=b;i--)
#define f(i,a,b) for(int i=a;i<b;i++)
#define nb(x) __builtin_popcount(x)
#define all(v) v.begin(),v.end()
#define bit(n,k) (((n)>>(k))&1)
#define Add(x,y) x=(x+y)%mod
#define maxm(a,b) a=max(a,b)
#define minm(a,b) a=min(a,b)
#define lst(x) x[x.size()-1]
#define sz(x) int(x.size())
#define mp make_pair
#define ll long long
#define pb push_back
#define S second
#define F first
#define int ll
const int N=1e6+99,inf=1e15;
int n,t,X,Y,q,to[N],w[N],res[N],ans[N],pes[N];
pair<int,int> dp[N];
vector<int> g[N];
void dfs1(int u,int p){
for(auto id : g[u]){
int v=to[id];
if(v==p) continue ;
res[1]+=w[id];
dfs1(v,u);
}
}
void dfs2(int u,int p){
vector<pair<int,int> > vec(3);
for(auto id : g[u]){
int v=to[id];
if(v==p) continue ;
res[v]=res[u]-w[id]+w[id^1];
dfs2(v,u);
dp[v].F+=w[id];
vec[0]=dp[v];
sort(all(vec));
}
if(vec[2].S==0){
dp[u]={0,u};
}
else{
dp[u]=vec[2];
}
pes[u]=inf;
if(vec[1].S!=0 && res[u]-vec[1].F-vec[2].F<ans[2]){
ans[2]=res[u]-vec[1].F-vec[2].F;
X=vec[1].S;
Y=vec[2].S;
}
minm(ans[1],res[u]);
}
void find(){
fill(ans,ans+N,inf);
dfs1(1,0);
dfs2(1,0);
//cout<<ans[1]<<" "<<ans[2]<<endl;
}
main(){
ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
cin>>n;
f(i,1,n){
int u,v;
cin>>u>>v>>w[2*i]>>w[2*i+1];
to[2*i]=v;
to[2*i+1]=u;
g[u].pb(2*i);
g[v].pb(2*i+1);
}
find();
cin>>q;
while(q--){
int x;
cin>>x;
cout<<ans[x]<<'\n';
}
}
Compilation message
designated_cities.cpp:70:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
70 | main(){
| ^~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
16 ms |
31596 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
15 ms |
31604 KB |
Output is correct |
2 |
Correct |
239 ms |
51608 KB |
Output is correct |
3 |
Correct |
314 ms |
76120 KB |
Output is correct |
4 |
Correct |
236 ms |
51596 KB |
Output is correct |
5 |
Correct |
221 ms |
51544 KB |
Output is correct |
6 |
Correct |
249 ms |
55088 KB |
Output is correct |
7 |
Correct |
193 ms |
51640 KB |
Output is correct |
8 |
Correct |
328 ms |
76648 KB |
Output is correct |
9 |
Correct |
147 ms |
52060 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
16 ms |
31616 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
16 ms |
31596 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
15 ms |
31604 KB |
Output is correct |
2 |
Correct |
239 ms |
51608 KB |
Output is correct |
3 |
Correct |
314 ms |
76120 KB |
Output is correct |
4 |
Correct |
236 ms |
51596 KB |
Output is correct |
5 |
Correct |
221 ms |
51544 KB |
Output is correct |
6 |
Correct |
249 ms |
55088 KB |
Output is correct |
7 |
Correct |
193 ms |
51640 KB |
Output is correct |
8 |
Correct |
328 ms |
76648 KB |
Output is correct |
9 |
Correct |
147 ms |
52060 KB |
Output is correct |
10 |
Incorrect |
16 ms |
31616 KB |
Output isn't correct |
11 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
16 ms |
31596 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |