Submission #33997477

---

Source Code Expand

#include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<algorithm>
#include<cstring>
using namespace std;

int n, m, e;
int arr[500010][2];
int par[200010];
int sz[200010];
int rnk[200010];
int query[500010];
int ans[500010];
bool broken[500010];

int find(int x)
{
	if (par[x] == x) return x;
	else return par[x] = find(par[x]);
}

void union_(int a, int b)
{
	a = find(a);
	b = find(b);

	if (a == b) return;

	if (rnk[a] > rnk[b]) swap(a, b);

	par[a] = b;
	rnk[b] += rnk[a] == rnk[b];
	sz[b] += sz[a];
}

int main()
{
	int q;
	int i;

	cin.tie(NULL);
	ios::sync_with_stdio(false);

	cin >> n >> m >> e;
	for (i = 1; i <= e; i++)
	{
		cin >> arr[i][0] >> arr[i][1];
	}
	cin >> q;
	for (i = 0; i < q; i++)
	{
		cin >> query[i];

		broken[query[i]] = true;
	}
	
	for (i = 1; i <= n; i++) sz[i] = 1;
	for (i = 1; i <= n + m; i++) par[i] = i;

	for (i = n + 2; i <= n + m; i++) union_(i - 1, i);

	for (i = 1; i <= e; i++)
	{
		if (broken[i]) continue;

		union_(arr[i][0], arr[i][1]);
	}

	for (i = q - 1; i >= 0; i--)
	{
		ans[i] = sz[find(n + 1)];

		union_(arr[query[i]][0], arr[query[i]][1]);
	}

	for (i = 0; i < q; i++)
	{
		cout << ans[i] << '\n';
	}
}

Submission Info

Judge Result