CF思维联系--CodeForces - 218C E - Ice Skating (并查集)
题目地址:24道CF的DIv2 CD题有兴趣可以做一下。
ACM思维题训练集合
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
这道题做过但是不记得当时怎么做的了,每次做都有新的感受。
并查集,一般的并查集不太行,如图
代码
#include <bits/stdc++.h>
using namespace std;
int fa[105];
int find(int n)
{
if(fa[n]==n) return n;
else return fa[n]=find(fa[n]);
}
struct Node{
int x,y;
}node[105];
bool check(Node a,Node b)
{
if(a.x==b.x) return 1;
else if(a.y==b.y)return 1;
else return 0;
}
set<int> cnt;
int main()
{
int n;
cin>>n;
for(int i=0;i<n;i++)
{
fa[i]=i;
cin>>node[i].x>>node[i].y;
for(int j=0;j<i;j++)
{
if(check(node[i],node[j])){
fa[find(j)]=find(i);
// cout<<fa[j]<<endl;
}
}
}
for(int i=0;i<n;i++)
{
//cout<<find(fa[i])<<endl;
cnt.insert(find(i));
}
cout<<cnt.size()-1<<endl;
}
最新文章
- find out the neighbouring max D_value by counting sort in stack
- hibernate(1)
- swift学习笔记之-可选链式调用
- codevs3145 汉诺塔问题
- Docker探索系列1之docker入门安装与操作
- AFN 2.6 code报错总结
- php 随机显示图片的函数(实例)
- 在C#中使用WIA获取扫描仪数据
- UIScrollView 代理方法
- Top 100 Best Blogs for iOS Developers
- 项目ITP(五) spring4.0 整合 Quartz 实现任务调度
- 一入python深似海--class
- mysql生成数据字典
- sublime----------快捷键的记录
- 配置dataimport时候 如果css样式有问题 要修改index和admin的版本号
- 如何搭建WebRTC信令服务器
- go语言path包和filepath包的学习与使用
- (二)用控制器controller给模型数据赋初始值
- BZOJ1398: Vijos1382寻找主人 Necklace 字符串最小表示法
- 2 小时学会 Spring Boot