# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
161551 | 2019-11-03T06:01:50 Z | arnold518 | Beads and wires (APIO14_beads) | C++14 | 1000 ms | 8452 KB |
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; const int MAXN = 2e5; int N; vector<pii> adj[MAXN+10]; ll dp1[MAXN+10], dp2[MAXN+10]; void dfs(int now, int bef, int par) { ll val=0; for(pii nxt : adj[now]) { if(nxt.first==bef) continue; dfs(nxt.first, now, nxt.second); dp2[now]+=dp1[nxt.first]; val=max(val, par-dp1[nxt.first]+dp2[nxt.first]+nxt.second); } dp1[now]=dp2[now]+val; } int main() { int i, j; scanf("%d", &N); for(i=1; i<N; i++) { int u, v, w; scanf("%d%d%d", &u, &v, &w); adj[u].push_back({v, w}); adj[v].push_back({u, w}); } ll ans=0; for(i=1; i<=N; i++) { memset(dp1, 0, sizeof(dp1)); memset(dp2, 0, sizeof(dp2)); dfs(i, i, 0); ans=max(ans, dp2[i]); } printf("%lld", ans); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 10 ms | 8184 KB | Output is correct |
2 | Correct | 11 ms | 8184 KB | Output is correct |
3 | Correct | 11 ms | 8184 KB | Output is correct |
4 | Correct | 11 ms | 8184 KB | Output is correct |
5 | Correct | 11 ms | 8184 KB | Output is correct |
6 | Correct | 11 ms | 8184 KB | Output is correct |
7 | Correct | 11 ms | 8184 KB | Output is correct |
8 | Correct | 12 ms | 8184 KB | Output is correct |
9 | Correct | 12 ms | 8184 KB | Output is correct |
10 | Correct | 11 ms | 8156 KB | Output is correct |
11 | Correct | 11 ms | 8184 KB | Output is correct |
12 | Correct | 11 ms | 8184 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 10 ms | 8184 KB | Output is correct |
2 | Correct | 11 ms | 8184 KB | Output is correct |
3 | Correct | 11 ms | 8184 KB | Output is correct |
4 | Correct | 11 ms | 8184 KB | Output is correct |
5 | Correct | 11 ms | 8184 KB | Output is correct |
6 | Correct | 11 ms | 8184 KB | Output is correct |
7 | Correct | 11 ms | 8184 KB | Output is correct |
8 | Correct | 12 ms | 8184 KB | Output is correct |
9 | Correct | 12 ms | 8184 KB | Output is correct |
10 | Correct | 11 ms | 8156 KB | Output is correct |
11 | Correct | 11 ms | 8184 KB | Output is correct |
12 | Correct | 11 ms | 8184 KB | Output is correct |
13 | Correct | 27 ms | 8312 KB | Output is correct |
14 | Correct | 28 ms | 8140 KB | Output is correct |
15 | Correct | 26 ms | 8184 KB | Output is correct |
16 | Correct | 43 ms | 8184 KB | Output is correct |
17 | Correct | 42 ms | 8184 KB | Output is correct |
18 | Correct | 46 ms | 8184 KB | Output is correct |
19 | Correct | 45 ms | 8312 KB | Output is correct |
20 | Correct | 41 ms | 8184 KB | Output is correct |
21 | Correct | 44 ms | 8184 KB | Output is correct |
22 | Correct | 42 ms | 8184 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 10 ms | 8184 KB | Output is correct |
2 | Correct | 11 ms | 8184 KB | Output is correct |
3 | Correct | 11 ms | 8184 KB | Output is correct |
4 | Correct | 11 ms | 8184 KB | Output is correct |
5 | Correct | 11 ms | 8184 KB | Output is correct |
6 | Correct | 11 ms | 8184 KB | Output is correct |
7 | Correct | 11 ms | 8184 KB | Output is correct |
8 | Correct | 12 ms | 8184 KB | Output is correct |
9 | Correct | 12 ms | 8184 KB | Output is correct |
10 | Correct | 11 ms | 8156 KB | Output is correct |
11 | Correct | 11 ms | 8184 KB | Output is correct |
12 | Correct | 11 ms | 8184 KB | Output is correct |
13 | Correct | 27 ms | 8312 KB | Output is correct |
14 | Correct | 28 ms | 8140 KB | Output is correct |
15 | Correct | 26 ms | 8184 KB | Output is correct |
16 | Correct | 43 ms | 8184 KB | Output is correct |
17 | Correct | 42 ms | 8184 KB | Output is correct |
18 | Correct | 46 ms | 8184 KB | Output is correct |
19 | Correct | 45 ms | 8312 KB | Output is correct |
20 | Correct | 41 ms | 8184 KB | Output is correct |
21 | Correct | 44 ms | 8184 KB | Output is correct |
22 | Correct | 42 ms | 8184 KB | Output is correct |
23 | Execution timed out | 1076 ms | 8452 KB | Time limit exceeded |
24 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 10 ms | 8184 KB | Output is correct |
2 | Correct | 11 ms | 8184 KB | Output is correct |
3 | Correct | 11 ms | 8184 KB | Output is correct |
4 | Correct | 11 ms | 8184 KB | Output is correct |
5 | Correct | 11 ms | 8184 KB | Output is correct |
6 | Correct | 11 ms | 8184 KB | Output is correct |
7 | Correct | 11 ms | 8184 KB | Output is correct |
8 | Correct | 12 ms | 8184 KB | Output is correct |
9 | Correct | 12 ms | 8184 KB | Output is correct |
10 | Correct | 11 ms | 8156 KB | Output is correct |
11 | Correct | 11 ms | 8184 KB | Output is correct |
12 | Correct | 11 ms | 8184 KB | Output is correct |
13 | Correct | 27 ms | 8312 KB | Output is correct |
14 | Correct | 28 ms | 8140 KB | Output is correct |
15 | Correct | 26 ms | 8184 KB | Output is correct |
16 | Correct | 43 ms | 8184 KB | Output is correct |
17 | Correct | 42 ms | 8184 KB | Output is correct |
18 | Correct | 46 ms | 8184 KB | Output is correct |
19 | Correct | 45 ms | 8312 KB | Output is correct |
20 | Correct | 41 ms | 8184 KB | Output is correct |
21 | Correct | 44 ms | 8184 KB | Output is correct |
22 | Correct | 42 ms | 8184 KB | Output is correct |
23 | Execution timed out | 1076 ms | 8452 KB | Time limit exceeded |
24 | Halted | 0 ms | 0 KB | - |