A. Ice Skating
来源:互联网 发布:如何做淘宝内部优惠群 编辑:程序博客网 时间:2024/05/16 03:36
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.
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 xiand 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 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.
22 11 2
1
22 14 1
0
解题说明:Bajtek只有撞到雪堆才会停下来,若两个雪堆之间横坐标或纵坐标相同则建立一条边连接两个雪堆。最后dfs寻找独立的图的数量。
#include<iostream>#include<cstdio>#include<cmath>#include<algorithm>#include<cstdlib>#include<cstring>using namespace std;int n,ans;int x[102],y[102];bool v[102];void dfs(int i){v[i]=true;for(int j=0;j<n;j++){if(!v[j] && (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(!v[i]){dfs(i);ans++;}}cout<<ans-1<<endl;return 0;}
- A. Ice Skating
- codeforces 217A Ice Skating
- Codeforces 217A: Ice Skating
- [DFS] cf 134A Ice Skating
- Codeforces 217A. Ice Skating 搜索
- Codeforces 217A Ice Skating 题解
- CF 217A A. Ice Skating(贪心)
- CodeForces 217A Ice Skating(并查集思路)
- Codeforces 217A. Ice Skating 【并查集】
- CodeForces 217 A.Ice Skating(并查集)
- Codeforces---Ice Skating
- 并查集Codeforces Round #134 (Div. 1), problem: (A) Ice Skating
- CF218C:Ice Skating(并查集)
- Codeforces Round #134 (Div. 2)C. Ice Skating
- CF 并查集(或者图) Ice Skating
- Codeforces Round #134 (Div. 2) C. Ice Skating
- A. Free Ice Cream
- ice
- 从一图像中截取部分图像
- 编程学习中要注意效率和感受
- poj3252 组合数学
- jquery中的.delegate()
- 块级元素和内联元素汇总
- A. Ice Skating
- Android Camera简述-转载
- 深度了解mapreduce---MapReduce源码分析总结
- 选择排序、插入排序、冒泡排序python实现
- 为各位如果
- C 删除字符串1中的字符串2
- 【足迹C++primer】42、13_1_拷贝、赋值与销毁(2)
- 回收站图标不见了
- 人体就会让天津体育