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 =  + ;

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

 int dfs(int u) {
     vis[u] = ;
     int res = G[u].size() & ;
     for(unsigned i = ; 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 = ;
     while(scanf("%d%d%d", &n, &m, &T) && n) {
         for(int i = ; i <= n; i++) {
             G[i].clear();
             du[i] = ;
             vis[i] = ;
         }
         for(int i = ; 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 = , c2 = ;
         for(int i = ; i <= n; i++) if(!vis[i] && du[i]) {
             c1++; c2 += max((dfs(i) - ) / , );
         }

         printf("Case %d: %d\n", ++cas, T * (max(c1 - , ) + c2 + m));
     }

     return ;
 }