# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
127119 | wilwxk | Designated Cities (JOI19_designated_cities) | C++14 | 423 ms | 39496 KiB |
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>
using namespace std;
typedef long long ll;
const int MAXN=2e5+5;
vector<tuple<int, ll, ll> > g[MAXN];
ll dp[MAXN];
ll respf[MAXN], somaf;
int n, q;
void predfs(int cur, int p) {
for(auto aresta : g[cur]) {
int viz; ll peso, rpeso;
tie(viz, peso, rpeso)=aresta;
if(viz==p) continue;
predfs(viz, cur);
dp[cur]+=dp[viz]+rpeso;
}
}
void dfs(int cur, int p) {
respf[1]=max(respf[1], dp[cur]);
// printf("dp[%d]= %lld\n", cur, dp[cur]);
for(auto aresta : g[cur]) {
int viz; ll peso, rpeso;
tie(viz, peso, rpeso)=aresta;
if(viz==p) continue;
ll dpc=dp[cur], dpv=dp[viz];
dp[cur]-=(dp[viz]+rpeso);
dp[viz]+=(dp[cur]+peso);
dfs(viz, cur);
dp[cur]=dpc;
dp[viz]=dpv;
}
}
int main() {
scanf("%d", &n);
for(int i=1; i<n; i++) {
int a, b, c, d; scanf("%d %d %d %d", &a, &b, &c, &d);
g[a].push_back({b, c, d}); g[b].push_back({a, d, c});
somaf+=c; somaf+=d;
}
predfs(1, 1);
dfs(1, 1);
scanf("%d", &q);
while(q--) {
int val; scanf("%d", &val);
printf("%lld\n", somaf-respf[val]);
}
}
Compilation message (stderr)
# | 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... |