# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
381149 | 2021-03-24T16:27:48 Z | rainboy | Duathlon (APIO18_duathlon) | C | 46 ms | 2788 KB |
#include <stdio.h> #include <string.h> #define N 100000 #define M 200000 int ds[N], mm[N], nn[N]; int find(int i) { return ds[i] < 0 ? i : (ds[i] = find(ds[i])); } void join(int i, int j) { i = find(i); j = find(j); if (i == j) { mm[i]++; return; } if (ds[i] > ds[j]) ds[i] = j, mm[j] += mm[i] + 1, nn[j] += nn[i]; else { if (ds[i] == ds[j]) ds[i]--; ds[j] = i, mm[i] += mm[j] + 1, nn[i] += nn[j]; } } int main() { int n, m, h, i, j; long long ans; scanf("%d%d", &n, &m); memset(ds, -1, n * sizeof *ds); for (i = 0; i < n; i++) nn[i] = 1; for (h = 0; h < m; h++) { scanf("%d%d", &i, &j), i--, j--; join(i, j); } ans = 0; for (i = 0; i < n; i++) if (ds[i] < 0) ans += nn[i] == mm[i] ? (long long) nn[i] * (nn[i] - 1) * (nn[i] - 2) : (long long) nn[i] * (nn[i] - 1) * (nn[i] - 2) / 3; printf("%lld\n", ans); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 364 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 364 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 29 ms | 2668 KB | Output is correct |
2 | Correct | 31 ms | 2668 KB | Output is correct |
3 | Correct | 28 ms | 2668 KB | Output is correct |
4 | Correct | 29 ms | 2668 KB | Output is correct |
5 | Correct | 29 ms | 2668 KB | Output is correct |
6 | Correct | 28 ms | 2668 KB | Output is correct |
7 | Correct | 34 ms | 2788 KB | Output is correct |
8 | Correct | 46 ms | 2668 KB | Output is correct |
9 | Correct | 30 ms | 2668 KB | Output is correct |
10 | Correct | 29 ms | 2668 KB | Output is correct |
11 | Correct | 25 ms | 2540 KB | Output is correct |
12 | Correct | 35 ms | 2540 KB | Output is correct |
13 | Correct | 24 ms | 2412 KB | Output is correct |
14 | Correct | 33 ms | 2412 KB | Output is correct |
15 | Correct | 17 ms | 2156 KB | Output is correct |
16 | Correct | 17 ms | 2156 KB | Output is correct |
17 | Correct | 2 ms | 1388 KB | Output is correct |
18 | Correct | 2 ms | 1516 KB | Output is correct |
19 | Correct | 2 ms | 1388 KB | Output is correct |
20 | Correct | 2 ms | 1388 KB | Output is correct |
21 | Correct | 2 ms | 1388 KB | Output is correct |
22 | Correct | 2 ms | 1388 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 364 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 29 ms | 2668 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 364 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 29 ms | 2668 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 364 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 364 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |