CodeForces Ice Skatin

先贴题目：

A. Ice Skating

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Bajtek is learning to skate on ice. He's a beginner, so his only mode of transportation is pushing off from a snow drift to the north, east, south or west and sliding until he lands in another snow drift. He has noticed that in this way it's impossible to get from some snow drifts to some other by any sequence of moves. He now wants to heap up some additional snow drifts, so that he can get from any snow drift to any other one. He asked you to find the minimal number of snow drifts that need to be created.

We assume that Bajtek can only heap up snow drifts at integer coordinates.

Input

The first line of input contains a single integer n (1 ≤ n ≤ 100) — the number of snow drifts. Each of the following n lines contains two integers x_i and y_i (1 ≤ x_i, y_i ≤ 1000) — the coordinates of the i-th snow drift.

Note that the north direction coinсides with the direction of Oy axis, so the east direction coinсides with the direction of the Ox axis. All snow drift's locations are distinct.

Output

Output the minimal number of snow drifts that need to be created in order for Bajtek to be able to reach any snow drift from any other one.

Sample test(s)

input

2
2 1
1 2

output

1

input

2
2 1
4 1

output

0

题意就是给你n个点，找个最少的m个点使得n个点都能相互到达。

比赛的时候竟然没有想到正确的思路……

完了之后别人提醒说和白书上一道题目类似，于是翻到那页，瞄了一眼……恍然大悟。

几分钟之后纯并查集迅速过了……

可是……可是为什么比赛的时候没有想出来呢！？

相关算法的应用有待加强！

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int maxx = 1010;
int father[maxx];
bool vis[maxx];
struct po
{
    int x,y;
}point[maxx*maxx];
int Find(int x)
{
    while(x!=father[x])
        x = father[x];
    return x;
}
void Union(int r1, int r2)
{
    int a = Find(r1);
    int b = Find(r2);
    if(a!=b)
        father[a] = b;
}
int main()
{
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        memset(point,0,sizeof(point));
        for(int i=1;i<=n;i++){
            scanf("%d%d",&point[i].x,&point[i].y);
            father[i] = i;
        }
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=n;j++)
            {
                if(point[i].x == point[j].x || point[i].y==point[j].y)
                {
                    Union(i,j);
                }
            }
        }
        memset(vis,0,sizeof(vis));
        int counter = 0;
        for(int i=1;i<=n;i++)
        {
            int a = Find(i);
            if(!vis[a])
            {
                counter++;
                vis[a] = 1;
            }
        }
        printf("%d\n",counter-1);
    }
}