# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
92502 | antimirage | Duathlon (APIO18_duathlon) | C++14 | 98 ms | 9764 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>
#define fr first
#define sc second
#define mk make_pair
#define pb emplace_back
#define all(s) s.begin(), s.end()
using namespace std;
const int N = 1e5 + 5;
int n, m, deg[N], x, y, u[N];
long long cn;
vector < vector <int> > g;
long long ans;
bool fl;
void dfs (int v, int p = 0)
{
cn++;
u[v] = 1;
for (auto to : g[v])
{
if (u[to] && to != p) fl = 1;
if (u[to]) continue;
dfs(to);
}
}
main()
{
cin >> n >> m;
g.resize(n + 1);
for (int i = 1; i <= m; i++)
{
scanf("%d%d", &x, &y), deg[x]++, deg[y]++;
g[x].pb(y);
g[y].pb(x);
}
for (int i = 1; i <= n; i++)
{
if (u[i]) continue;
cn = 0;
fl = false;
dfs(i);
if (fl)
ans += cn * 1ll * (cn - 1) * (cn - 2);
else
ans += cn * 1ll * (cn - 1) * (cn - 2) / 3;
}
cout << ans << endl;
}
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... |