Codeforces Round #346 (Div. 2) E. New Reform-白红宇

Codeforces Round #346 (Div. 2) E. New Reform

阅读量：5340 次

发布时间：2019-06-15

本文共 3210 字，大约阅读时间需要 10 分钟。

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

4 3 2 1 1 3 4 3

output

input

5 5 2 1 1 3 2 3 2 5 4 3

output

input

6 5 1 2 2 3 4 5 4 6 5 6

output

Note

In the first sample the following road orientation is allowed: $\text{[math]}$ , $\text{[math]}$ , $\text{[math]}$ .

The second sample: $\text{[math]}$ , $\text{[math]}$ , $\text{[math]}$ , $\text{[math]}$ , $\text{[math]}$ .

The third sample: $\text{[math]}$ , $\text{[math]}$ , $\text{[math]}$ , $\text{[math]}$ , $\text{[math]}$ .

一开始觉得是联通分量的个数-1 后来画图发现，每个联通分量如果存在环，那么他就没有 separate点。

一开始用并查集做，没调出来.....好弱..

/* ***********************************************Author        :Created Time  :2016/4/2 16:53:35File Name     :346e.cpp************************************************ */#include 
          
           #include 
           
            #include 
            
             #include 
             
              #include 
              
               #include 
               
                #include 
                
                 #include 
                 
                  #include 
                  #include 
                   
                    #include 
                    
                     #include 
                     
                      #include 
                      
                       #include 
                       
                        #include 
                        
                         #include 
                         
                          #define ull unsigned long long#define ll long long#define mod 90001#define INF 0x3f3f3f3f#define maxn 100010#define cle(a) memset(a,0,sizeof(a))const ull inf = 1LL << 61;const double eps=1e-5;using namespace std;priority_queue
                          
                           
                            ,greater
                            
                              >pq;struct Node{ int x,y;};struct cmp{ bool operator()(Node a,Node b){ if(a.x==b.x) return a.y> b.y; return a.x>b.x; }};bool cmp(int a,int b){ return a>b;}int vis[maxn];int n,m;vector
                             
                              v[maxn];int mark=0;void dfs(int u,int fa){ if(vis[u]){ mark=1;return; } vis[u]=1; for(int i=0;i
                              
                               >n>>m){ cle(vis);mark=0; for(int i=1;i<=m;i++){ scanf("%d %d",&x,&y); v[x].push_back(y); v[y].push_back(x); } int ans=0; for(int i=1;i<=n;i++){ mark=0; if(!vis[i]){ dfs(i,-1); if(mark==0)ans++; } } cout<
                               
                                <

转载于:https://www.cnblogs.com/pk28/p/5348031.html

你可能感兴趣的文章