cf246 ENew Reform (并查集找环)
2016-04-02 12:26
423 查看
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.
Input
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.
Output
Print a single integer — the minimum number of separated cities after the reform.
Examples
input
output
input
output
input
output
Note
In the first sample the following road orientation is allowed:
,
,
.
The second sample:
,
,
,
,
.
The third sample:
,
,
,
,
.
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.
Input
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.
Output
Print a single integer — the minimum number of separated cities after the reform.
Examples
input
4 3 2 1 1 3 4 3
output
1
input
5 5
2 11 3
2 3
2 5
4 3
output
0
input
6 5 1 2 2 3 4 5 4 6 5 6
output
1
Note
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 ; bool flag ; 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; }
相关文章推荐
- 10分钟-jQuery操作DOM元素
- 深度学习---DBN overview
- 四则运算4(完结)
- 安卓虚拟定位使用教程
- 安装xampp时提示找不到文件“-n”,提示没有安装Microsoft Visual C++ 2008 Redistributable Package (x86)
- 楼梯有n阶台阶,上楼可以一步上1阶,2阶,3阶,编程序计算共有多少种不同的走法?
- PHP开发APP接口(一)
- Windows Dev Intro - VS2013 Compile X64 Project Upgraded from Win32 Project
- 大端(Big Endian)与小端(Little Endian)详解
- js中 中括号和.的区别
- arch firefox
- Cotex-M3权威指南学习笔记--NVIC与中断控制一
- IPv6套接字地址结构
- 学习进度条——第五周
- 动态内存管理
- 记一些想法
- js获取浏览器body或窗宽度高度
- 12.遍历二叉树与二叉树的建立
- lightoj 1011 - Marriage Ceremonies(状态压缩dp)
- 软件应该使用中文版还是外文版