Submission #1970894


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

int par[100001], d[100001], f[100001];
void init(int n){
	for(int i = 1;i <= n;i++){
		par[i] = i;
		d[i] = 0;
	}
}

int find(int x){
	if(x == par[x])return x;
	return par[x] = find(par[x]);
}

void unite(int x, int y){
	x = find(x);
	y = find(y);
	if(x == y)return ;
	if(d[x] < d[y]){
		par[x] = y;
	}else{
		par[y] = x;
		if(d[x] == d[y])d[x]++;
	}
}

bool same(int x, int y){
	return find(x) == find(y);
}

int main(){
	int n, m, x, y;
	scanf("%d%d", &n, &m);
	init(n);
	
	for(int i = 0;i < m;i++){
		scanf("%d%d", &x, &y);
		unite(x, y);
	}
	
	int ans = 0;
	for(int i = 1;i <= n;i++)find(i);
	for(int i = 1;i <= n;i++){
		if(f[find(i)] == 1)continue;
		f[find(i)] = 1;
		unite(i, 1);
		ans++;
	}
	printf("%d\n", ans-1);
	return 0;
}

Submission Info

Submission Time
Task B - 道路工事
User Ryoga_0212
Language C++14 (GCC 5.4.1)
Score 100
Code Size 835 Byte
Status AC
Exec Time 22 ms
Memory 1408 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:35:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &n, &m);
                       ^
./Main.cpp:39:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &x, &y);
                        ^

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 15 ms 256 KB
16.txt AC 3 ms 1408 KB
17.txt AC 2 ms 1408 KB
18.txt AC 2 ms 1408 KB
19.txt AC 22 ms 1408 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