N . Inspector’s Dilemma

Description

In a country, there are a number of cities. Each pair of city is connected by a highway, bi-directional of course. A road-inspector’s task is to travel through the highways (in either direction) and to check if everything is in order. Now, a road-inspector has a list of highways he must inspect. However, it might not be possible for him to travel through all the highways on his list without using other highways. He needs a constant amount of time to traverse any single highway. As you can understand, the inspector is a busy fellow does not want to waste his precious time. He needs to know the minimum possible time to complete his task. He has the liberty to start from and end with any city he likes. Please help him out.

Input
The input file has several test cases. First line of each case has three integers: V (1≤V≤1000), the number of cities, E (0≤E≤V∗(V−1)/2), the number of highways the inspector needs to check and T (1≤T≤10), time needed to pass a single highway. Each of the next E lines contains two integers a and b (1≤a,b≤V , a=b) meaning the inspector has to check the highway between cities a and b. The input is terminated by a case with V=E=T=0. This case should not be processed.

Output
For each test case, print the serial of output followed by the minimum possible time the inspector needs to inspect all the highways on his list. Look at the output for sample input for details.

Samples

Input
5 3 1
1 2
1 3
4 5
4 4 1
1 2
1 4
2 3
3 4
0 0 0
Output
Case 1: 4
Case 2: 4

题目大意：

给定n个城市，每两个个城市间有一条双向的长度为t的路，在给出m条路，要求用最短的路程走完给出的路。

思路：

给出的路是必须走的，再找出给出的路和城市组成了多少连通块（只有单个城市不算），在两个连通块间在走一条路就能使两个连通块连通（ans+=连通块的数量-1）.对于每一个连通块来讲，考虑一笔画问题，必须构成欧拉通路。如果有大于2个奇数度点，没增加一条边可以减少两个奇数度点（ans+=（奇数度点数量-2）/2）。

代码：

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,m,l,x,y,a[1001][1001],d[1001],f[1001],t,tt=1;
void dfs(ll i)
{
	f[i]=0;
	if(d[i]%2)	t++;
	for(ll j=1;j<=n;j++)
		if(f[j]&&a[i][j])
			dfs(j);
}
int main()
{
	while(cin>>n>>m>>l,n+m+l)
	{
		ll ans=m;
		memset(d,0,sizeof(d));
		memset(a,0,sizeof(a));
		memset(f,0,sizeof(f));
		for(ll i=0;i<m;i++)
		{
			cin>>x>>y;
			a[x][y]=a[y][x]=1;
			d[x]++;
			d[y]++;
			f[x]=1;
			f[y]=1;
		}
		for(ll i=1;i<=n;i++)
		{
			if(!f[i])	continue;
			t=0;
			dfs(i);
			ans++;
			if(t>2)	ans+=(t-2)/2;
		}
		if(ans)	ans--;
		cout<<"Case "<<tt++<<": "<<ans*l<<endl;
	} 
}