Submission #1293280


Source Code Expand

#include<iostream>
#include<string>
#include<cmath>
#include<queue>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<functional>
#include<algorithm>
#include<cstdio>
#include<unordered_map>
typedef long long ll;
typedef long double ld;
#define int long long
using namespace std;
int pa[100001];
int root(int x) {
	if (pa[x] == x)  return x;
	return pa[x] = root(pa[x]);
}
void unite(int x, int y) {
	x = root(x);
	y = root(y);
	pa[x] = y;
}
bool same(int x, int y) {
	return pa[x] == pa[y];
}
signed main() {
	int n, m;
	cin >> n >> m;
	for (int i = 1; i <= n; i++)
		pa[i] = i;
	for (int i = 0; i < m; i++) {
		int a, b;
		cin >> a >> b;
		unite(a, b);
	}
	int sum = 0;
	for (int i = 1; i <= n; i++) {
		if (i == pa[i])
			sum++;
	}
	cout << sum - 1 << endl;
	getchar();
	getchar();
}

Submission Info

Submission Time
Task B - 道路工事
User Thistle
Language C++14 (GCC 5.4.1)
Score 100
Code Size 871 Byte
Status AC
Exec Time 59 ms
Memory 1024 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 2
AC × 22
Set Name Test Cases
Sample sample1.txt, sample2.txt
All 0.txt, 1.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 2.txt, 3.txt, 4.txt, 5.txt, 6.txt, 7.txt, 8.txt, 9.txt, sample1.txt, sample2.txt
Case Name Status Exec Time Memory
0.txt AC 1 ms 256 KB
1.txt AC 1 ms 256 KB
10.txt AC 1 ms 256 KB
11.txt AC 1 ms 256 KB
12.txt AC 1 ms 256 KB
13.txt AC 1 ms 256 KB
14.txt AC 1 ms 256 KB
15.txt AC 42 ms 256 KB
16.txt AC 2 ms 1024 KB
17.txt AC 2 ms 1024 KB
18.txt AC 2 ms 1024 KB
19.txt AC 59 ms 1024 KB
2.txt AC 1 ms 256 KB
3.txt AC 1 ms 256 KB
4.txt AC 1 ms 256 KB
5.txt AC 1 ms 256 KB
6.txt AC 1 ms 256 KB
7.txt AC 1 ms 256 KB
8.txt AC 1 ms 256 KB
9.txt AC 1 ms 256 KB
sample1.txt AC 1 ms 256 KB
sample2.txt AC 1 ms 256 KB