/* made by amunduzbaev */
//~ #include <ext/pb_ds/assoc_container.hpp>
//~ #include <ext/pb_ds/tree_policy.hpp>
#include "bits/stdc++.h"
using namespace std;
//~ using namespace __gnu_pbds;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define NeedForSpeed ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vv vector
#define mem(arr, v) memset(arr, v, sizeof arr)
#define int long long
#define degub(x) cout<<#x<<" : "<<x<<"\n"
#define GG cout<<"here\n";
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef vector<int> vii;
typedef vector<pii> vpii;
template<class T> bool umin(T& a, const T& b) { return a > b ? a = b, true : false; }
template<class T> bool umax(T& a, const T& b) { return a < b ? a = b, true : false; }
template<int sz> using tut = array<int, sz>;
void usaco(string s) { freopen((s+".in").c_str(),"r",stdin);
freopen((s+".out").c_str(),"w",stdout); NeedForSpeed }
//~ template<class T> using oset = tree<T,
//~ null_type, less_equal<T>, rb_tree_tag,
//~ tree_order_statistics_node_update> ordered_set;
const int N = 2e5+5;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);
#define MULTI 0
int n, m, k, s, t, q, ans, res[N], a[N];
int cost[N], par[N], used[N];
map<pii, bool> mm;
vpii edges[N];
int dfs(int u, int t, int p = -1, int dup = 0, int ddown = 0){
int up = 0;
for(auto x : edges[u]) if(x.ff == p && t && (!used[x.ff] || !used[u])) dup += x.ss, up = x.ss;
cost[u] = -dup + ddown;
//~ cout<<u<<" "<<dup<<" "<<ddown<<"\n";
for(auto x : edges[u]){
if(x.ff == p) continue;
par[x.ff] = u;
up += dfs(x.ff, t, u, dup, ddown + ((!used[x.ff] || !used[u]) ? x.ss : 0));
}
return up;
}
void solve(int t_case){
cin>>n;
int rr = 0;
for(int i=1;i<n;i++){
int a, b, c, d; cin>>a>>b>>c>>d;
edges[a].pb({b, c}), edges[b].pb({a, d});
rr += d, rr += c;
}
int tot = dfs(1, 1);
for(int i=1;i<=n;i++) umax(res[1], cost[i] + tot);
dfs(1, 0);
int cur = 1, cc = 0;
for(int i=1;i<=n;i++) if(cost[i] > cost[cur]) cur = i;
cc = cost[cur];
while(cur) used[cur] = 1, cur = par[cur];
dfs(1, 0);
for(int i=2;i<=n;i++){
int v = 1;
for(int i=1;i<=n;i++) if(cost[i] > cost[v]) v = i;
//~ for(int i=1;i<=n;i++) cout<<cost[i]<<" ";
//~ cout<<"\n";
//~ cout<<tot<<" "<<cc<<"\n\n";
res[i] = tot + cc + cost[v];
while(v) used[v] = 1, v = par[v];
dfs(1, 0);
}
cin>>q;
for(int i=0;i<q;i++){
cin>>m;
cout<<rr - res[m]<<"\n";
}
}
signed main(){
NeedForSpeed
if(MULTI){
int t; cin>>t;
for(int t_case = 1; t_case <= t; t_case++) solve(t_case);
} else solve(1);
return 0;
}
Compilation message
designated_cities.cpp: In function 'void usaco(std::string)':
designated_cities.cpp:34:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
34 | void usaco(string s) { freopen((s+".in").c_str(),"r",stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
designated_cities.cpp:35:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
35 | freopen((s+".out").c_str(),"w",stdout); NeedForSpeed }
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
4940 KB |
Output is correct |
| 2 |
Incorrect |
3 ms |
4940 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
4940 KB |
Output is correct |
| 2 |
Execution timed out |
2092 ms |
19904 KB |
Time limit exceeded |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
4992 KB |
Output is correct |
| 2 |
Execution timed out |
2082 ms |
19900 KB |
Time limit exceeded |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
4940 KB |
Output is correct |
| 2 |
Incorrect |
3 ms |
4940 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
4940 KB |
Output is correct |
| 2 |
Execution timed out |
2092 ms |
19904 KB |
Time limit exceeded |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
4940 KB |
Output is correct |
| 2 |
Incorrect |
3 ms |
4940 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
