# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
103230 | E869120 | Duathlon (APIO18_duathlon) | C++14 | 213 ms | 11768 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <vector>
using namespace std;
#pragma warning (disable: 4996)
long long N, M, A[200009], B[200009], col[100009], cnt1, cnt2; vector<int>X[100009];
void dfs(int pos) {
if (col[pos] >= 1) return;
col[pos] = 1; cnt1 += 1; cnt2 += X[pos].size();
for (int i = 0; i < X[pos].size(); i++) {
dfs(X[pos][i]);
}
}
int main() {
scanf("%lld%lld", &N, &M);
for (int i = 1; i <= M; i++) {
scanf("%lld%lld", &A[i], &B[i]);
X[A[i]].push_back(B[i]);
X[B[i]].push_back(A[i]);
}
long long ans = 0;
for (int i = 1; i <= N; i++) {
if (col[i] >= 1) continue;
cnt1 = 0; cnt2 = 0;
dfs(i); cnt2 /= 2;
if (cnt1 == cnt2) ans += 1LL * cnt1 * (cnt1 - 1) * (cnt1 - 2);
else ans += 1LL * cnt1 * (cnt1 - 1) * (cnt1 - 2) / 3LL;
}
printf("%lld\n", ans);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |