CF 217A A. Ice Skating(贪心)
来源:互联网 发布:linux如何删除目录 编辑:程序博客网 时间:2024/05/17 23:05
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 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 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
在一个整数坐标系中,一直有很多整数点集。就像冰上滑雪一样只能够东南西北移动,在坐标系中即横竖移动。为了保证任意一点到任意一点都能到达,需要建立一些点能够做到,问题就是求出最少点的数量。
#include<iostream>#include<algorithm>#include<string> using namespace std;int x[101],y[101],z[101];int n,s=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); s++;}} cout<<s-1; return 0;}
- CF 217A A. Ice Skating(贪心)
- [DFS] cf 134A Ice Skating
- codeforces 217A Ice Skating
- Codeforces 217A: Ice Skating
- A. Ice Skating
- CodeForces 217A Ice Skating(并查集思路)
- CodeForces 217 A.Ice Skating(并查集)
- Codeforces 217A. Ice Skating 搜索
- Codeforces 217A Ice Skating 题解
- Codeforces 217A. Ice Skating 【并查集】
- CF 并查集(或者图) Ice Skating
- cf#106 a(贪心算法)
- CF - 359 - A. Table(贪心)
- CF#804 A. Find Amir(贪心)
- 并查集Codeforces Round #134 (Div. 1), problem: (A) Ice Skating
- CF 830A 贪心+二分
- CF218C:Ice Skating(并查集)
- CF Round #616 (A,B,C 字符串,贪心,DFS)
- MVC架构 用户访问流程图
- 蓝牙代码基本结构分析
- javascript中a=a || {};
- 的发生过的哈萨克挂机多少货到付款就货到付款就的合肥市开京东方是空间
- 如何度过每天的最初十分钟
- CF 217A A. Ice Skating(贪心)
- Android开发中的Activity和ActionBarActivity有什么区别
- 面试题12:打印1到最大的n位数
- POJ 题目分类
- 《程序员的自我修养》读书笔记1
- 爱折腾的女程序员
- 面试题13:在O(1)的时间删除链表结点
- 深圳市帮宝网络笔试题(回忆)
- Hive-0.5中SerDe概述