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[65540];
int enemy[20],weapons[65540];

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

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

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

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