# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
603020 | benjaminkleyn | 철인 이종 경기 (APIO18_duathlon) | C++17 | 0 ms | 0 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;
typedef long long ll;
int n, m;
vector<int> g[100000];
int par[100000];
int sz[100000];
int find(int u)
{
if (par[u] == u)
return u;
return par[u] = find(par[u]);
}
void unite(int u, int v)
{
u = find(u), v = find(v);
if (u != v)
par[v] = u, sz[u] = sz[v] = sz[u] + sz[v];
}
bool vis[100000] = {false};
int sub[100000] = {0};
int t_par[100000];
void dfs(int u)
{
vis[u] = true;
sub[u] = 1;
for (int v : g[u])
if (!vis[v])
{
t_par[v] = u;
dfs(v);
sub[u] += sub[v];
}
}
int main()
{
cin >> n >> m;
for (int i = 0; i < n; i++)
par[i] = i, sz[i] = 1;
for (int i = 0, u, v; i < m; i++)
{
cin >> u >> v;
unite(u-1, v-1);
g[u-1].push_back(v-1);
g[v-1].push_back(u-1);
}
for (int i = 0; i < n; i++)
if (par[i] == i)
{
t_par[i] = i;
dfs(i);
}
for (int u = 0; u < n; u++)
{
int sumz = sz[u] - sub[u];
res -= (sz[u] - sub[u]) * (sz[u] - sub[u]);
for (int v : g[u])
if (v != t_par[u])
sumz += sub[v], res -= sub[v] * sub[v];
res += sumz * sumz;
}
cout << res << '\n';
return 0;
}