Algorithm

C. Ice Skating
time limit per test
2 seconds
memory limit per test
256 megabytes
Problem link- https://codeforces.com/contest/218/problem/C
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
Copy
2
2 1
1 2
output
Copy
1
input
Copy
2
2 1
4 1
output
Copy
0



 

Code Examples

#1 Code Example with C++ Programming

Code - C++ Programming

#include <bits/stdc++.h>

using namespace std;

int n, a[101], b[101];
bool vis[101];
vector<vector<int> > g;

void dfs(int v) {
	vis[v] = true;

	for(int i = 0, u; i < g[v].size(); ++i) {
		u = g[v][i];
		if(!vis[u])
			dfs(u);
	}
}

int main() {
	scanf("%d", &n);
	for(int i = 0; i < n; ++i)
		scanf("%d %d", a + i, b + i);

	g.resize(n);
	for(int i = 0; i < n; ++i)
		for(int j = 0; j < n; ++j)
			if(a[i] == a[j] || b[i] == b[j]) {
				g[i].push_back(j);
				g[j].push_back(i);
			}

	int res = 0;
	for(int i = 0; i < n; ++i)
		if(!vis[i]) {
			++res;
			dfs(i);
		}

	printf("%d\n", res - 1);

  return 0;
}
Copy The Code & Try With Live Editor

Input

x
–
+
cmd
2
2 1
1 2

Output

x
–
+
cmd
1
Advertisements

Demonstration

Codeforcess Solution Ice Skating, C. Ice Skating ,C,C++, Java, Js and Python ,Ice Skating,Codeforcess Solution

Previous
Codeforces solution 1080-B-B. Margarite and the best present codeforces solution
Next
CodeChef solution DETSCORE - Determine the Score CodeChef solution C,C+