Codeforces 217A: Ice Skating

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/qq_34621169/article/details/51165308

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 xi and yi (1 ≤ xi, yi ≤ 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.

Examples

input

2
2 1
1 2

output

1

input

2
2 1
4 1

output

0

在坐标系上有n个点，给出n个点的坐标，然后只能竖直或者横向移动，问最少需要建立几个中间点才能够从一个点出发到达所有的点

建立连通块，答案就是连通块的个数-1，具体看代码吧，应该很容易就看懂的.

AC代码：

#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
int x[108],y[108],z[108];
int n,ans=0;
void dfs(int i){
    z[i]=1;
    for(int j=0;j<n;++j){
        if(z[j]!=1&&(x[i]==x[j]||y[i]==y[j]))
            dfs(j);
    }
}
int main(){
    cin>>n;
    for(int i=0;i<n;++i)
        cin>>x[i]>>y[i];
    for(int i=0;i<n;++i){
        if(z[i]!=1){
            dfs(i);
            ans++;
        }
    }
    cout<<ans-1;
    return 0;
}