This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define pb push_back
#define ii pair<int,int>
#define all(x) (x).begin(),(x).end()
#define INF 100000000000000000
#define modulo 1000000007
#define mod 998244353
#define int long long int
using namespace std;
vector<int> adj[200005];
vector<int> val(200005);
vector<int> ans(200005, 0);
map<ii, int> cost;
int S = 0;
void dfs1(int x, int pre, int& v){
for(int i = 0; i < adj[x].size(); i++){
int y = adj[x][i];
if(y == pre) continue;
v += cost[{y, x}];
dfs1(y, x, v);
}
}
void dfs2(int x, int pre, int v){
val[x] = v;
for(int i = 0; i < adj[x].size(); i++){
int y = adj[x][i];
if(y == pre) continue;
dfs2(y, x, v - cost[{y, x}] + cost[{x, y}]);
}
}
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// freopen("q.gir","r",stdin);
// freopen("q.cik","w",stdout);
int n;
cin >> n;
for(int i = 0; i < n - 1; i++){
int x, y, a, b;
cin >> x >> y >> a >> b;
adj[x].pb(y);
adj[y].pb(x);
cost[{x, y}] = a;
cost[{y, x}] = b;
S += a + b;
}
int w = 0;
dfs1(1, 0, w);
dfs2(1, 0, w);
ans[1] = S - *max_element(all(val));
int q;
cin >> q;
while(q--){
int k;
cin >> k;
cout << ans[k] << "\n";
}
}
Compilation message (stderr)
designated_cities.cpp: In function 'void dfs1(long long int, long long int, long long int&)':
designated_cities.cpp:18:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i = 0; i < adj[x].size(); i++){
~~^~~~~~~~~~~~~~~
designated_cities.cpp: In function 'void dfs2(long long int, long long int, long long int)':
designated_cities.cpp:27:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i = 0; i < adj[x].size(); i++){
~~^~~~~~~~~~~~~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |