#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int n, m;
long long ans;
int p[N];
vector<int> cl[N];
set<int> f[N], g[N];
long long tot(int x) {
return 1ll * x * (x - 1);
}
int get(int v) {
return (v == p[v] ? v : p[v] = get(p[v]));
}
void unite(int u, int v) {
u = get(u), v = get(v);
if (u == v) {
return;
}
if (cl[u].size() + f[u].size() < cl[v].size() + f[v].size()) {
swap(u, v);
}
ans -= tot(cl[u].size());
ans -= tot(cl[v].size());
ans -= 1ll * cl[u].size() * f[u].size();
ans -= 1ll * cl[v].size() * f[v].size();
for (int x : cl[v]) {
cl[u].push_back(x);
if (f[u].count(x)) {
f[u].erase(x);
}
}
for (int x : f[v]) {
if (get(x) != u) {
f[u].insert(x);
}
}
for (int x : g[v]) {
if (x != u) {
g[u].insert(x);
}
}
if (g[u].count(v)) {
g[u].erase(v);
}
ans += 1ll * cl[u].size() * f[u].size();
ans += tot(cl[u].size());
p[v] = u;
}
void connect(int u, int v) {
int uu = get(u), vv = get(v);
if (uu == vv) {
return;
}
if (f[vv].count(u)) {
return;
}
if (g[uu].count(vv)) {
unite(u, v);
} else {
ans += cl[vv].size();
f[vv].insert(u);
g[vv].insert(uu);
}
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
cin >> n >> m;
iota(p, p + n, 0);
for (int i = 0; i < n; ++i) {
cl[i].push_back(i);
}
while (m--) {
int u, v;
cin >> u >> v;
--u, --v;
connect(u, v);
cout << ans << '\n';
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
11 ms |
12032 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
11 ms |
12032 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
11 ms |
12032 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
