POJ 2524 解题报告

这道题是union-find的应用。直接用的原来的代码。速度相对很慢，但是和discuss贴出来的代码大同小异，估计是cin, cout的问题。过了就不想纠结了。

2524

Accepted

1076K

1797MS

G++

1557B

/* 
ID: thestor1 
LANG: C++ 
TASK: poj2524 
*/
#include <iostream>
#include <fstream>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <limits>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <cassert>

using namespace std;

const int MAXN = 50000;

void makeset(const int N, std::vector<int> &parent, std::vector<int> &rank)
{
	for (int u = 0; u < N; ++u)
	{
		parent[u] = u;
		rank[u] = 0;
	}
}

int find(int u, std::vector<int> &parent)
{
	if (parent[u] != u)
	{
		parent[u] = find(parent[u], parent);
	}
	return parent[u];
}

void union_set(int u, int v, std::vector<int> &parent, std::vector<int> &rank)
{
	int ru = find(u, parent);
	int rv = find(v, parent);
	if (ru == rv)
	{
		return;
	}

	if (rank[ru] < rank[rv])
	{
		parent[ru] = rv;
	}
	else if (rank[rv] < rank[ru])
	{
		parent[rv] = ru;
	}
	else
	{
		parent[ru] = rv;
		rank[rv]++;
	}
}

int main()
{
	std::ios::sync_with_stdio(false);
	
	
	std::vector<int> parent(MAXN);
	std::vector<int> rank(MAXN);
	
	int N, M;
	int caseno = 1;
	while (cin >> N >> M && N)
	{
		makeset(N, parent, rank);

		int different = N;
		int u, v;
		for (int i = 0; i < M; ++i)
		{
			cin >> u >> v;
			u--, v--;
			if (find(u, parent) != find(v, parent))
			{
				union_set(u, v, parent, rank);
				different--;
			}
		}
		cout << "Case " << caseno << ": " << different << endl;
		caseno++;
	}
	return 0;
}