UVa247 Calling Circles

Time Limit: 3000MS

64bit IO Format: %lld & %llu

map存人名，floyd传递闭包，DFS查询。

输出答案的逗号后面还有个空格，被坑到了233

 /*by SilverN*/
 #include<algorithm>
 #include<iostream>
 #include<cstring>
 #include<cstdio>
 #include<cmath>
 #include<map>
 using namespace std;
 const int mxn=;
 map<string,int>mp;
 int id;
 char s[mxn][mxn];
 int e[mxn][mxn];
 bool vis[mxn];
 int n,m;
 void DFS(int u){
     for(int i=;i<=n;i++){
         if(!vis[i] && e[u][i] && e[i][u]){
             vis[i]=;
             printf(", %s",s[i]);
             DFS(i);
         }
     }
     return;
 }
 int main(){
     int i,j;
     int cas=;
     while(scanf("%d%d",&n,&m)){
         if(!n && !m)break;
         mp.clear();id=;
         memset(e,,sizeof e);
         char u[mxn],v[mxn];
         for(i=;i<=m;i++){
             scanf("%s%s",u,v);
             if(!mp[u]){mp[u]=++id;memcpy(s[mp[u]],u,sizeof u);}
             if(!mp[v]){mp[v]=++id;memcpy(s[mp[v]],v,sizeof v);}
             e[mp[u]][mp[v]]=;
         }
         for(int k=;k<=n;k++)
          for(i=;i<=n;i++)
           for(j=;j<=n;j++){
               e[i][j]|=e[i][k]&e[k][j];
           }
         memset(vis,,sizeof vis);
         if(cas)printf("\n");
         printf("Calling circles for data set %d:\n",++cas);
         for(i=;i<=n;i++){
             if(!vis[i]){
                 vis[i]=;
                 printf("%s",s[i]);
                 DFS(i);
                 printf("\n");
             }
         }
     }
     return ;
 }