# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
152952 | 2019-09-10T16:40:02 Z | arnold518 | Duathlon (APIO18_duathlon) | C++14 | 1000 ms | 1048580 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 = 1e5; int N, M; vector<int> adj[MAXN+10]; ll ans=0; int sz[MAXN+10]; bool vis[MAXN+10]; void dfs1(int now, int bef) { sz[now]=1; vis[now]=1; for(int nxt : adj[now]) { if(nxt==bef) continue; dfs1(nxt, now); sz[now]+=sz[nxt]; } } void dfs2(int now, int bef) { int sum=0; for(int nxt : adj[now]) { if(nxt==bef) continue; sz[now]-=sz[nxt]; sz[nxt]+=sz[now]; dfs2(nxt, now); sz[nxt]-=sz[now]; sz[now]+=sz[nxt]; } for(int nxt : adj[now]) { ans-=(ll)sz[nxt]*sz[nxt]; sum+=sz[nxt]; } ans+=(ll)sum*sum; } int main() { int i, j; scanf("%d%d", &N, &M); for(i=1; i<=M; i++) { int u, v; scanf("%d%d", &u, &v); adj[u].push_back(v); adj[v].push_back(u); } for(i=1; i<=N; i++) if(!vis[i]) { dfs1(i, i); dfs2(i, i); } printf("%lld", ans); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 949 ms | 1048580 KB | Execution killed with signal 9 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 949 ms | 1048580 KB | Execution killed with signal 9 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1069 ms | 293376 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 2680 KB | Output is correct |
2 | Correct | 5 ms | 2680 KB | Output is correct |
3 | Correct | 5 ms | 2808 KB | Output is correct |
4 | Correct | 5 ms | 2808 KB | Output is correct |
5 | Correct | 5 ms | 2808 KB | Output is correct |
6 | Correct | 5 ms | 2808 KB | Output is correct |
7 | Correct | 5 ms | 2808 KB | Output is correct |
8 | Correct | 6 ms | 2808 KB | Output is correct |
9 | Correct | 5 ms | 2680 KB | Output is correct |
10 | Correct | 5 ms | 2808 KB | Output is correct |
11 | Correct | 5 ms | 2684 KB | Output is correct |
12 | Correct | 5 ms | 2808 KB | Output is correct |
13 | Correct | 5 ms | 2724 KB | Output is correct |
14 | Correct | 6 ms | 2680 KB | Output is correct |
15 | Correct | 5 ms | 2680 KB | Output is correct |
16 | Correct | 5 ms | 2680 KB | Output is correct |
17 | Correct | 5 ms | 2808 KB | Output is correct |
18 | Correct | 5 ms | 2808 KB | Output is correct |
19 | Correct | 5 ms | 2680 KB | Output is correct |
20 | Correct | 5 ms | 2808 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 83 ms | 6776 KB | Output is correct |
2 | Correct | 94 ms | 7800 KB | Output is correct |
3 | Correct | 85 ms | 7672 KB | Output is correct |
4 | Correct | 77 ms | 7800 KB | Output is correct |
5 | Correct | 72 ms | 7692 KB | Output is correct |
6 | Correct | 79 ms | 11768 KB | Output is correct |
7 | Correct | 84 ms | 10364 KB | Output is correct |
8 | Correct | 81 ms | 9724 KB | Output is correct |
9 | Correct | 80 ms | 8924 KB | Output is correct |
10 | Correct | 80 ms | 7672 KB | Output is correct |
11 | Correct | 73 ms | 7688 KB | Output is correct |
12 | Correct | 78 ms | 7816 KB | Output is correct |
13 | Correct | 66 ms | 7672 KB | Output is correct |
14 | Correct | 69 ms | 7544 KB | Output is correct |
15 | Correct | 58 ms | 7160 KB | Output is correct |
16 | Correct | 42 ms | 6136 KB | Output is correct |
17 | Correct | 51 ms | 7920 KB | Output is correct |
18 | Correct | 53 ms | 7920 KB | Output is correct |
19 | Correct | 53 ms | 7912 KB | Output is correct |
20 | Correct | 53 ms | 7928 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 2680 KB | Output is correct |
2 | Correct | 5 ms | 2936 KB | Output is correct |
3 | Execution timed out | 1040 ms | 1048580 KB | Time limit exceeded |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 72 ms | 6648 KB | Output is correct |
2 | Correct | 83 ms | 7672 KB | Output is correct |
3 | Execution timed out | 1112 ms | 920728 KB | Time limit exceeded |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 949 ms | 1048580 KB | Execution killed with signal 9 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 949 ms | 1048580 KB | Execution killed with signal 9 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |