hdu3270Arranging Your Team(dfs)

http://acm.hdu.edu.cn/showproblem.php?pid=3720

 #include <iostream>
 #include<cstdio>
 #include<cstring>
 #include<algorithm>
 #include<stdlib.h>
 #include<vector>
 #include<map>
 #include<string>
 using namespace std;
 #define INF 0x3f3f3f
 map<string,int>f;
 struct node
 {
     char s[],po[];
     int v,k;
 }p[];
 int pa[],flag,w[][],maxz;
 void dfs(int x,int a,int b,int c,int d,int sum)
 {
     int i,j;
     if(x==&&a==&&b==&&c==&&d==)
     {
         for(i =; i <=  ; i++)
             for(j = i+ ; j <=  ; j++)
             sum+=w[pa[i]][pa[j]];
         maxz = max(maxz,sum);
         flag = ;
         return ;
     }
     if(x>) return ;
     pa[a+b+c+d+] = x;
     if(p[x].k == )
     {
         if(d<)
         dfs(x+,a,b,c,d+,sum+p[x].v);
     }
     else if(p[x].k==)
     {
         if(b<)
         dfs(x+,a,b+,c,d,sum+p[x].v);
     }
     else if(p[x].k==)
     {
         if(c<)
         dfs(x+,a,b,c+,d,sum+p[x].v);
     }
     else if(a<)
     {
         dfs(x+,a+,b,c,d,sum+p[x].v);
     }
     dfs(x+,a,b,c,d,sum);
 }
 int main()
 {
     int i,n,v;
     char s1[],s2[];
     while(cin>>p[].s>>p[].v>>p[].po)
     {
         f.clear();
         f[p[].s] = ;
         maxz=-INF;flag=;
         memset(w,,sizeof(w));
         for(i = ; i <= ;i++)
         {
             cin>>p[i].s>>p[i].v>>p[i].po;
         }
         for(i = ; i <=  ; i++)
         {
             if(strcmp(p[i].po,"defender")==)
             p[i].k = ;
             else if(strcmp(p[i].po,"midfielder")==)
             p[i].k = ;
             else if(strcmp(p[i].po,"striker")==)
             p[i].k = ;
             else p[i].k = ;
             f[p[i].s] = i;
         }
         cin>>n;
         for(i = ; i <= n ; i++)
         {
             getchar();
             cin>>s1>>s2>>v;
             w[f[s1]][f[s2]] = v;
             w[f[s2]][f[s1]] = v;
         }
         dfs(,,,,,);
         if(!flag) puts("impossible");
         else printf("%d\n",maxz);
     }
     return ;
 }