HDU 3720 Arranging Your Team(DFS)

题目链接

队内赛里，匆匆忙忙写的。

 #include <cstdio>
 #include <cstring>
 #include <iostream>
 #include <vector>
 #include <string>
 #include <map>
 #include <algorithm>
 using namespace std;
 int v[];
 int flag[];
 int o[][];
 int p[];
 char name[];
 char fa[];
 int que[][];
 int s[];
 int sf[];
 int key[];
 int maxz;
 int judge(char *str)
 {
     if(strcmp("goalkeeper",str) == )
         return ;
     else if(strcmp("defender",str) == )
         return ;
     else if(strcmp("midfielder",str) == )
         return ;
     else if(strcmp("striker",str) == )
         return ;
     return ;
 }
 void dfs(int y,int x,int step,int sd)
 {
     int i,j,k,st;
     if(step > )
     {
         st = ;
         for(j = ;j < ;j ++)
         st += v[p[j]];
         for(j = ; j < ; j ++)
         {
             for(k = j+; k < ; k ++)
                 st += o[p[j]][p[k]];
         }
         maxz = max(st,maxz);
         return ;
     }
     for(i = y;i < s[step];i ++)
     {
         if(!sf[que[step][i]])
         {
             sf[que[step][i]] = ;
             p[sd] = que[step][i];
             if(x+ > key[step])
             dfs(,,step+,sd+);
             else
             dfs(i+,x+,step,sd+);
             sf[que[step][i]] = ;
         }
     }
     return ;
 }
 int main()
 {
     int i,m,sc;
     key[] = ;
     key[] = ;
     key[] = ;
     key[] = ;
     while(scanf("%s%d%s",name,&v[],fa)!=EOF)
     {
         memset(o,,sizeof(o));
         memset(s,,sizeof(s));
         memset(sf,,sizeof(sf));
         memset(que,,sizeof(que));
         map<string,int> mp;
         mp[name] = ;
         flag[] = judge(fa);
         que[flag[]][s[flag[]]] = ;
         s[flag[]] ++;
         for(i = ; i < ; i ++)
         {
             scanf("%s%d%s",name,&v[i],fa);
             mp[name] = i;
             flag[i] = judge(fa);
             que[flag[i]][s[flag[i]]] = i;
             s[flag[i]] ++;
         }
         scanf("%d",&m);
         for(i = ; i < m; i ++)
         {
             scanf("%s%s%d",name,fa,&sc);
             int a,b;
             a = mp[name];
             b = mp[fa];
             o[a][b] += sc;
             o[b][a] += sc;
         }
         if(s[] < ||s[] < ||s[] < ||s[] < )
         {
             printf("impossible\n");
             continue;
         }
         maxz = -;
         dfs(,,,);
         printf("%d\n",maxz);
     }
     return ;
 }