#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define endl '\n'
using namespace std;
const int maxn = 1e5 + 3;
int n, m;
void read()
{
cin >> n >> m;
}
int par[maxn], sz[maxn];
int find_root(int ver)
{
if (ver == par[ver])
return ver;
return find_root(par[ver]);
}
void merge(int a, int b)
{
/*
a = find_root(a), b = find_root(b);
if (a == b)
return;
if (sz[a] < sz[b])
swap(a, b);
par[b] = a;
sz[a] += sz[b];
*/
par[b] = a;
sz[a] += sz[b];
sz[b] = 0;
}
pair <int, int> e[maxn * 3];
long long find_ans(int idx)
{
long long ans = 0;
for (int i = 1; i <= n; i++)
if (i == find_root(i))
ans += 1ll * sz[i] * (sz[i] - 1);
set <pair <int, int> > s;
for (int i = 1; i <= idx; i++)
if (find_root(e[i].first) != find_root(e[i].second))
{
if (s.find({e[i].first, find_root(e[i].second)}) != s.end())
continue;
s.insert({e[i].first, find_root(e[i].second)});
ans += sz[find_root(e[i].second)];
}
return ans;
}
void solve()
{
for (int i = 1; i <= n; i++)
par[i] = i, sz[i] = 1;
for (int i = 1; i <= m; i++)
{
cin >> e[i].first >> e[i].second;
if (find_root(e[i].first) != find_root(e[i].second))
{
for (int j = 1; j <= i-1; j++)
if (find_root(e[j].second) == find_root(e[i].first) && find_root(e[j].first) == find_root(e[i].second))
{
merge(e[i].first, e[i].second);
break;
}
}
cout << find_ans(i) << endl;
}
}
int main()
{
ios_base_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
read();
solve();
}
Compilation message
joitter2.cpp: In function 'int main()':
joitter2.cpp:91:2: error: 'ios_base_stdio' was not declared in this scope
91 | ios_base_stdio(false);
| ^~~~~~~~~~~~~~
