hdu 3018

以前没去管过欧拉通路和欧拉回路。。现在来搞一下。。。

其实知识点很少，就是几个结论，无向图看度为奇数的点，有向图看出入度是否相等。。。还有欧拉通路和欧拉回路都是建立在图连通就基础之上，处理此类问题必然少不了并查集。。

当然图论的证明一般都很玄学，所以不去深究了。。。

这题思路就是对非欧拉回路，组数为奇数点个数/2，然后欧拉回路显然是1。。然后要注意一下存在孤立点的情况。。

/*
ID:qkoqhh1
LANG:C++
TASK:combo
*/
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<queue>
#define inc(i,l,r) for(int i=l;i<=r;i++)
#define dec(i,l,r) for(int i=l;i>=r;i--)
#define link(x) for(edge *j=h[x];j;j=j->next)
#define inf 1e9
#define mem(a) memset(a,0,sizeof(a))
#define ll long long
#define succ(x) (1<<x)
#define lowbit(x) (x&&(-x))
#define NM 100005
using namespace std;

int read(){
	int x=0,f=1;char ch=getchar();
	while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
	while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
	return f*x;
}



int n,m,a[NM],b[NM],f[NM],ans,c[NM];
int find(int x){
	return f[x]==x?x:f[x]=find(f[x]);
}
int main(){
//	freopen("data.in","r",stdin);
	while(~scanf("%d%d",&n,&m)){
		inc(i,1,n)f[i]=i;
		mem(a);mem(b);ans=0;mem(c);
		while(m--){
			int _x=read(),_y=read();
			a[_x]++;a[_y]++;
			_x=find(_x);_y=find(_y);
			if(_x==_y)continue;
			f[_x]=_y;
		}
		inc(i,1,n)b[find(i)]+=a[i]%2,c[find(i)]++;
		inc(i,1,n)if(c[i]>1)
			if(b[i])ans+=b[i]/2;else ans++;
		printf("%d\n",ans);
	}
	return 0;
}

Ant Trip

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3504    Accepted Submission(s): 1383

Problem Description

Ant Country consist of N towns.There are M roads connecting the towns.

Ant Tony,together with his friends,wants to go through every part of the country.

They intend to visit every road , and every road must be visited for exact one time.However,it may be a mission impossible for only one group of people.So they are trying to divide all the people into several groups,and each may start at different town.Now tony wants to know what is the least groups of ants that needs to form to achieve their goal.

 

Input

Input contains multiple cases.Test cases are separated by several blank lines. Each test case starts with two integer N(1<=N<=100000),M(0<=M<=200000),indicating that there are N towns and M roads in Ant Country.Followed by M lines,each line contains two integers a,b,(1<=a,b<=N) indicating that there is a road connecting town a and town b.No two roads will be the same,and there is no road connecting the same town.

 

Output

For each test case ,output the least groups that needs to form to achieve their goal.

 

Sample Input

  
  

   
   3 3
1 2
2 3
1 3

4 2
1 2
3 4
  
  

 

Sample Output

  
  

   
   1
2


   
   

    
    

     
     Hint
    
    

New ~~~ Notice: if there are no road connecting one town ,tony may forget about the town.
In sample 1,tony and his friends just form one group,they can start at either town 1,2,or 3.
In sample 2,tony and his friends must form two group.


   
   
   
    
  
  

 

Source

2009 Multi-University Training Contest 12 - Host by FZU

 

Recommend

gaojie   |   We have carefully selected several similar problems for you:   3013  3015  3016  3011  3010