# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
103541 | 2019-03-31T11:31:20 Z | Hideo | Duathlon (APIO18_duathlon) | C++14 | 138 ms | 8680 KB |
#include <bits/stdc++.h> using namespace std; #define ll long long #define mk make_pair #define pb push_back #define fr first #define sc second #define vi vector < int > #define pii pair < int, int > const int N = 2e5 + 7; const int INF = 1e9 + 7; int sz[N]; int n, m; ll ans; vi g[N]; void dfs (int v = 1, int p = 0){ sz[v] = 1; for (int to : g[v]){ if (to != p){ dfs(to, v); sz[v] += sz[to]; } } } main(){ cin >> n >> m; for (int i = 1; i <= m; i++){ int a, b; cin >> a >> b; g[a].pb(b); g[b].pb(a); } if (m == n - 1){ dfs(); for (int i = 2; i <= n; i++){ ans += sz[i] * (n - sz[i]); } cout << (ll) ans * 2 - n * (n - 1); } else { cout << 0; } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 7 ms | 4992 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 7 ms | 4992 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 126 ms | 8184 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 7 ms | 5120 KB | Output is correct |
2 | Correct | 9 ms | 5120 KB | Output is correct |
3 | Correct | 7 ms | 4992 KB | Output is correct |
4 | Correct | 8 ms | 5120 KB | Output is correct |
5 | Correct | 8 ms | 5120 KB | Output is correct |
6 | Correct | 7 ms | 5120 KB | Output is correct |
7 | Correct | 7 ms | 5120 KB | Output is correct |
8 | Correct | 7 ms | 5120 KB | Output is correct |
9 | Correct | 8 ms | 5120 KB | Output is correct |
10 | Incorrect | 7 ms | 5120 KB | Output isn't correct |
11 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 138 ms | 8680 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 8 ms | 5120 KB | Output is correct |
2 | Correct | 7 ms | 5112 KB | Output is correct |
3 | Incorrect | 8 ms | 5120 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 138 ms | 8680 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 7 ms | 4992 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 7 ms | 4992 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |