# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
797328 | radaiosm7 | Duathlon (APIO18_duathlon) | C++98 | 1073 ms | 1048576 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;
vector<int> adj[100005];
bool visited[100005];
long long sub[100005];
void dfs1(int x, int p=-1) {
visited[x] = true;
sub[x] = 1LL;
++cc;
for (auto y : adj[x]) {
if (y == p) continue;
dfs1(y, x);
sub[x] += sub[y];
}
}
void dfs2(int x, int p=-1) {
ans += 2LL*(sub[x]-1LL)*(cc-sub[x]);
for (auto y : adj[x]) {
if (y == p) continue;
ans += sub[y]*(sub[x]-1LL-sub[y]);
dfs2(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]) {
cc = 0LL;
dfs1(i);
dfs2(i);
}
}
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... |