cf246 ENew Reform (并查集找环)
Berland has n cities connected by m bidirectional
roads. No road connects a city to itself, and each pair of cities is connected by no more than one road. It is not guaranteed that you can get from any city to any other one, using only the existing
roads.
The President of Berland decided to make changes to the road system and instructed the Ministry of Transport to make this reform. Now, each road should be unidirectional (only lead from one city to another).
In order not to cause great resentment among residents, the reform needs to be conducted so that there can be as few separate cities as possible. A city is considered separate, if no road leads
into it, while it is allowed to have roads leading from this city.
Help the Ministry of Transport to find the minimum possible number of separate cities after the reform.
The first line of the input contains two positive integers, n and m —
the number of the cities and the number of roads in Berland (2 ≤ n ≤ 100 000, 1 ≤ m ≤ 100 000).
Next m lines contain the descriptions of the roads: the i-th
road is determined by two distinct integers xi, yi(1 ≤ xi, yi ≤ n, xi ≠ yi),
where xi and yi are
the numbers of the cities connected by the i-th road.
It is guaranteed that there is no more than one road between each pair of cities, but it is not guaranteed that from any city you can get to any other one, using only roads.
Print a single integer — the minimum number of separated cities after the reform.
4 3
2 1
1 3
4 3
1
5 5
2 1
1 3
2 3
2 5
4 3
0
6 5
1 2
2 3
4 5
4 6
5 6
1
In the first sample the following road orientation is allowed: , , .
The second sample: , , , , .
The third sample: , , , , .
#include<bits/stdc++.h>
using namespace std;
const int N = 1e5+10;
int fa[N];
bool flag[N];
int find(int x)
{
int r=x;
while(fa[r]!=r) r=fa[r];
int i=x,j;
while(i!=r) {
j=fa[i];
fa[i]=r;
i=j;
}
return r;
}
int main()
{
int n,m,i,j;
int x,y,fx,fy;
int ans;
ans=0;
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++) fa[i]=i;
while(m--) {
scanf("%d%d",&x,&y);
fx=find(x);
fy=find(y);
if(fx!=fy) {
fa[fx]=fy;
if(flag[x]||flag[y]||flag[fx]||flag[fy])
flag[fy]=flag[fx]=flag[x]=flag[y]=true;
}
else flag[fy]=flag[fx]=flag[x]=flag[y]=true;
}
for(i=1;i<=n;i++) {
if(find(i)==i&&!flag[find(i)]) ans++;
}
printf("%d\n",ans);
return 0;
}
最新文章
- Visual Studio Code 配置指南
- PHP 图片上传工具类(支持多文件上传)
- 2013长沙赛区现场赛 J - Josephina and RPG
- Java多线程干货系列(1):Java多线程基础
- std::shared_ptr
- 限制Input输入类型的常见代码集合
- Java编程思想学习笔记_5(IO流)
- jQuery----blur()方法
- 第一个python爬虫程序
- MySQL 高效查询
- Ubuntu搭建Hadoop的踩坑之旅(一)
- 如何更改Ubuntu的root密码
- SSM-SpringMVC-19:SpringMVC中请求和响应的乱码解决
- Oracle、DB2、SQLSERVER、Mysql、Access分页SQL语句
- 十、JAVA面试简答
- Python之路系列笔记
- 生成短链接的URL
- php解决前后端验证字符串长度不一致
- C# Excel使用NPOI
- How to Export to Excel