uva12118

一开始以为直接算联通块个数就行了

后来发现还得分联通块里的奇点。。。

还要注意m = 0的情况...

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>

using namespace std;

void setIO(const string& a) {
    freopen((a+".in").c_str(), "r", stdin);
    freopen((a+".out").c_str(), "w", stdout);
}

const int N = 1000 + 10;

#include<vector>
vector<int> G[N];
bool vis[N];
int du[N];

int dfs(int u) {
    vis[u] = 1;
    int res = G[u].size() & 1;
    for(unsigned i = 0; i < G[u].size(); i++) {
        int v = G[u][i];
        if(!vis[v]) res += dfs(v);
    }
    return res;
}
    

int main() {
#ifdef DEBUG
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
#endif
    
    int n, m, T, cas = 0;
    while(scanf("%d%d%d", &n, &m, &T) && n) {
        for(int i = 1; i <= n; i++) {
            G[i].clear();
            du[i] = 0;
            vis[i] = 0;
        }
        for(int i = 1; i <= m; i++) {
            int u, v;
            scanf("%d%d", &u, &v);
            G[u].push_back(v);
            G[v].push_back(u);
            du[u]++, du[v]++;
        }
        int c1 = 0, c2 = 0;
        for(int i = 1; i <= n; i++) if(!vis[i] && du[i]) {
            c1++; c2 += max((dfs(i) - 2) / 2, 0);
        }
        
        printf("Case %d: %d
", ++cas, T * (max(c1 - 1, 0) + c2 + m));
    }
    
    return 0;
}