UVA 11795 七 Mega Man's Mission

七 Mega Man's Mission

Time Limit:1000MS     Memory Limit:0KB     64bit IO Format:%lld & %llu

Submit Status Practice UVA 11795

 #include <stdio.h>
 #include <string.h>
 #include <algorithm>
 using namespace std;

 long long dp[];
 int enemy[],weapons[];

 int main()
 {
     int T,ca=;
     int n,mega;
     char s[];
     int i,j,k;
     scanf("%d",&T);
     while(T--)
     {
         mega=;
         memset(dp,,sizeof(dp));
         memset(enemy,,sizeof(enemy));
         memset(weapons,,sizeof(weapons));

         scanf("%d",&n);
         scanf("%s",s);
         for(i=;i<n;i++)
         {
             if(s[i]=='')
             {
                 mega=mega | ( << i);
             }
         }
         for(i=;i<n;i++)
         {
             scanf("%s",s);
             for(j=;j<n;j++)
             {
                 if(s[j]=='')
                 {
                     enemy[i]=enemy[i] | ( << j);
                 }
             }
         }
         for(i=;i<( << n);i++)
         {
             weapons[i]=mega;
             for(j=;j<n;j++)
             {
                 if(i & <<j)
                 {
                     weapons[i]=weapons[i] | enemy[j];
                 }
             }
         }

         dp[]=;
         for(i=;i<(<<n);i++)
         {
             if(dp[i] == ) continue;
             for(j=;j<n;j++)
             {
                 if((weapons[i] & (<<j))!= && (i & (<<j))==)
                     dp[i | (<<j)]=dp[i | (<<j)]+dp[i];
             }
         }

         printf("Case %d: %lld\n",++ca,dp[(<<n)-]);
     }
     return ;
 }