# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
702675 | jhnah917 | Designated Cities (JOI19_designated_cities) | C++14 | 213 ms | 33976 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;
using ll = long long;
int N, Q;
vector<pair<ll,ll>> G[202020];
ll Sum, C[202020], C1;
void TreeDP(int v, int b=-1, ll up=0, ll dw=0){
for(auto [i,w] : G[v]) if(i == b) C1 += w, up += w;
C[v] = dw - up;
for(auto [i,w] : G[v]) if(i != b) TreeDP(i, v, up, dw+w);
}
int main(){
ios_base::sync_with_stdio(false); cin.tie(nullptr);
cin >> N;
for(int i=1; i<N; i++){
int a, b, c, d; cin >> a >> b >> c >> d; Sum += c + d;
G[a].emplace_back(b, c); G[b].emplace_back(a, d);
}
cin >> Q; assert(Q == 1);
TreeDP(1);
for(int q=1; q<=Q; q++){
int t; cin >> t; assert(t == 1);
cout << Sum - (C1 + *max_element(C+1, C+N+1)) << "\n";
}
}
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... |