# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
797295 | radaiosm7 | Duathlon (APIO18_duathlon) | C++98 | 41 ms | 11792 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 <bits/stdc++.h>
using namespace std;
#define X first
#define Y second
int n, m, i, a, b;
long long ans, cc, j;
vector<int> adj[100005];
bool visited[100005];
bool isCycle;
void dfs(int x, int p) {
visited[x] = true;
++cc;
for (auto y : adj[x]) {
if (y == p) continue;
if (visited[y]) isCycle = true;
else dfs(y, x);
}
}
int main() {
scanf("%d%d", &n, &m);
for (i=0; i < m; ++i) {
scanf("%d%d", &a, &b);
adj[a].push_back(b);
adj[b].push_back(a);
}
ans = 0LL;
fill(visited+1, visited+n+1, false);
for (i=1; i <= n; ++i) {
if (!visited[i]) {
isCycle = false;
cc = 0LL;
dfs(i, -1);
if (cc <= 2LL) continue;
if (isCycle) ans += cc*(cc-1LL)*(cc-2LL);
else for (j=2LL; j < cc; ++j) ans += 2LL*(j-1LL)*(cc-j);
}
}
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... |