关闭

Codeforces 217A. Ice Skating 【并查集】

标签: codeforces数据结构
170人阅读 评论(0) 收藏 举报
分类:

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个点的坐标,如果两个点x相同或者y相同,则两点可以联通,
          问你最少加几条线,能使全部点联通
    类型:并查集
    分析:属于裸并查集了吧..
*/

#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
int n;
int fa[1005];
struct Node{
    int x,y;
};
Node a[1005];
int Find(int x){
    if(fa[x]==x)return x;
    return fa[x]=Find(fa[x]);
}
void unite(int x,int y){
    x=Find(x);
    y=Find(y);
    if(x!=y)fa[x]=y;
}
int main()
{
    while(~scanf("%d",&n)){
        for(int i=0;i<=n;i++)fa[i]=i;
        for(int i=0;i<n;i++)
            scanf("%d%d",&a[i].x,&a[i].y);
        for(int i=0;i<n;i++)
           for(int j=0;j<n;j++){
              if(a[j].x==a[i].x||a[j].y==a[i].y){
                  unite(i,j);
              }
           }
        int res=0;
        for(int i=0;i<n;i++){
            if(fa[i]==i)res++;
        }
        printf("%d\n",res-1);
    }
    return 0;
}





0
0

猜你在找
【直播】机器学习&数据挖掘7周实训--韦玮
【套餐】系统集成项目管理工程师顺利通关--徐朋
【直播】3小时掌握Docker最佳实战-徐西宁
【套餐】机器学习系列套餐(算法+实战)--唐宇迪
【直播】计算机视觉原理及实战--屈教授
【套餐】微信订阅号+服务号Java版 v2.0--翟东平
【直播】机器学习之矩阵--黄博士
【套餐】微信订阅号+服务号Java版 v2.0--翟东平
【直播】机器学习之凸优化--马博士
【套餐】Javascript 设计模式实战--曾亮
查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:27698次
    • 积分:1545
    • 等级:
    • 排名:千里之外
    • 原创:130篇
    • 转载:3篇
    • 译文:0篇
    • 评论:4条
    最新评论