习题6-14 检查员的难题（Inspector's Dilemma, ACM/ICPC Dhaka 2007, UVa12118）

题意：在完全图上，通过若干条指定的边的最短的欧拉道路。
1. 很容易想到，要把每个连通分支链接起来，构成一个欧拉道路。
2. 把每个连通分支看成是链状，对某个没有奇度定点的分支，把某个偶度定点看成链的头尾组成。
3. 所要添加的边数即为(奇度顶点数-2)/2。

#include <iostream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>
#include <sstream>
#include <utility>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <cctype>
#define CLEAR(a, b) memset(a, b, sizeof(a))
#define IN() freopen("in.txt", "r", stdin)
#define OUT() freopen("out.txt", "w", stdout)
#define LL long long
#define maxn 1005
#define maxm 15
#define mod 1000000007
#define INF 1000000007
#define eps 1e-5
#define PI 3.1415926535898
using namespace std;
//-------------------------CHC------------------------------//
int n, m, t;
vector<int> to[maxn];
bool vis[maxn];
int cnt;

void dfs(int u) {
	vis[u] = 1;
	int degree = to[u].size();
	if (degree & 1) cnt++;
	for (int v = 0; v < to[u].size(); ++v)
		if (!vis[to[u][v]]) dfs(to[u][v]);
}

int count() {
	CLEAR(vis, 0);
	int ret = 0;
	for (int i = 1; i <= n; ++i)
		if (!vis[i] && !to[i].empty()) {
			cnt = 0;
			dfs(i);
			ret += max(cnt, 2);
		}
	return ret;
}

int main() {
	int kase = 1;
	while (scanf("%d%d%d", &n, &m, &t) == 3) {
		if (n == 0 && m == 0 && t == 0) break;
		for (int i = 1; i <= n; ++i) to[i].clear();
		for(int i = 0; i < m; ++i) {
			int u, v;
			scanf("%d%d", &u, &v);
			to[u].push_back(v);
			to[v].push_back(u);
		}
		int ans = max((count() - 2) >> 1, 0) + m;
		printf("Case %d: %d\n", kase++, ans*t);
	}
	return 0;
}