# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
203260 | 2020-02-20T00:49:19 Z | Rakhmand | Designated Cities (JOI19_designated_cities) | C++14 | 8 ms | 2808 KB |
// // ROIGold.cpp // Main calisma // // Created by Rakhman on 05/02/2019. // Copyright © 2019 Rakhman. All rights reserved. // #include <cstring> #include <vector> #include <list> #include <map> #include <set> #include <deque> #include <stack> #include <bitset> #include <algorithm> #include <functional> #include <numeric> #include <utility> #include <sstream> #include <iostream> #include <iomanip> #include <cstdio> #include <queue> #include <cmath> #include <cstdlib> #include <ctime> #include <cassert> #include <iterator> #define ios ios_base::sync_with_stdio(0), cout.tie(0), cin.tie(0); #define S second #define F first #define pb push_back #define nl '\n' #define NL cout << '\n'; #define EX exit(0) #define all(s) s.begin(), s.end() #define FOR(i, start, finish, k) for(int i = start; i <= finish; i += k) const int MXN = 1e5 + 1; const long long MNN = 1e6 + 200; const long long MOD = 1e9 + 7; const long long INF = 1e18; const int OO = 1e9 + 500; typedef long long llong; typedef unsigned long long ullong; using namespace std; void istxt(bool yes){ if(yes == 1){ freopen("balancing.in", "r", stdin); //freopen("/Users/rakhmanabdirashov/Desktop/folder/Programming/Road2Master/Road2Master/e.txt", "w", stdout); }else{ freopen("/Users/rakhmanabdirashov/Desktop/folder/Programming/Road2Master/Road2Master/input.txt", "r", stdin); } } int n, q; llong sum, ans, roads; vector<pair<int, int> > g[MXN]; void dfs(int v, int p){ for(int i = 0; i < g[v].size(); i++){ int to = g[v][i].F, cost = g[v][i].S; if(to == p) { roads += cost; continue; } dfs(to, v); } } void dfs2(int v, int p){ for(int i = 0; i < g[v].size(); i++){ int to = g[v][i].F; if(to == p){ roads -= g[v][i].S; continue; } } ans = max(ans, roads); for(int i = 0; i < g[v].size(); i++){ int to = g[v][i].F; if(to == p){ continue; } roads += g[v][i].S; dfs2(to, v); roads -= g[v][i].S; } } int main () { ios; istxt(0); cin >> n; for(int i = 1; i < n; i++){ int u, v, a, b; cin >> u >> v >> a >> b; g[u].pb({v, a}); g[v].pb({u, b}); sum += a + b; } dfs(1, 0); ans = roads; dfs2(1, 0); cin >> q; while(q--){ int x; cin >> x; cout << sum - ans << nl; } return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 8 ms | 2808 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 8 ms | 2808 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 8 ms | 2680 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 8 ms | 2808 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 8 ms | 2808 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 8 ms | 2808 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |