CodeForces - 218C Ice Skating

最新推荐文章于 2020-07-10 19:22:50 发布

Huffman_Tree_

最新推荐文章于 2020-07-10 19:22:50 发布

阅读量205

点赞数

分类专栏： CodeForces

转载请注明出处//https://blog.csdn.net/qq_43658924

本文链接：https://blog.csdn.net/qq_43658924/article/details/96966041

版权

本文介绍了Bajtek在学习冰上滑行时遇到的问题，他发现通过推雪堆的方式无法从一些雪堆到达其他雪堆。为了解决这个问题，他想要增加雪堆的数量，使得可以从任何一个雪堆滑行到其他任何一个。任务是找出最少需要增加多少个雪堆。输入包含雪堆的初始位置，输出是最小的雪堆增量。题目提供两个示例，并提到了可以使用深度搜索作为解决方案。

摘要由CSDN通过智能技术生成

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
可以考虑用深搜的方法解决：