poj 2288 Islands and Bridges

 1 #include <cstdio>
 2 #include <algorithm>
 3 #include <cmath>
 4 #include <cstdlib>
 5 #include <cstring>
 6 #include <iostream>
 7 using namespace std;
 8 long long  dp[1<<13][13][13];
 9 long long  num[1<<13][13][13];
10 int n;
11 int val[13];
12 bool Map[13][13];
13 void solve()
14 {
15     for(int i=0;i<(1<<n);i++)for(int a=0;a<n;a++)for(int b=0;b<n;b++)
16     {
17         if(!Map[a][b])continue;
18         if(a==b)continue;
19         if((i&(1<<a))==0||(i&(1<<b))==0)continue;
20         if(i==((1<<a)+(1<<b)))
21         {
22             dp[i][a][b]=val[a]+val[b]+val[a]*val[b];
23             num[i][a][b]=1;
24             continue;
25         }
26         else
27         {
28             for(int c=0;c<n;c++)
29             {
30                 if(c==a||c==b||(!Map[b][c])) continue;
31                 if((i&(1<<c))==0) continue;
32                 long long  tmp;
33                 if(dp[i^(1<<a)][b][c]==-1)continue;
34                 if(Map[a][c]) tmp=val[a]+val[a]*val[b]+val[a]*val[b]*val[c];
35                 else tmp=val[a]+val[a]*val[b];
36                 if(dp[i][a][b]<dp[i^(1<<a)][b][c]+tmp)
37                 {
38                     num[i][a][b]=num[i^(1<<a)][b][c];
39                     dp[i][a][b]=dp[i^(1<<a)][b][c]+tmp;
40                 }
41                 else if(dp[i][a][b]==dp[i^(1<<a)][b][c]+tmp)
42                     num[i][a][b]+=num[i^(1<<a)][b][c];
43             }
44         }
45     }
46     long long  ans=-1;
47     long long  ans_num=0;
48     for(int b=0;b<n;b++) for(int c=0;c<n;c++)
49     {
50         if(ans<dp[(1<<n)-1][b][c])
51         {
52             ans=dp[(1<<n)-1][b][c];
53             ans_num=num[(1<<n)-1][b][c];
54         }
55         else if(ans==dp[(1<<n)-1][b][c])
56             ans_num+=num[(1<<n)-1][b][c];
57 
58     }
59     if(ans==-1) printf("0 0\n");
60     else printf("%lld %lld\n",ans,ans_num/2);
61 }
62 int main()
63 {
64     int q;
65     scanf("%d",&q);
66     while(q--)
67     {
68         memset(Map,false,sizeof(Map));
69         memset(dp,-1,sizeof(dp));
70         memset(num,0,sizeof(num));
71         int m;
72         scanf("%d%d",&n,&m);
73         for(int i=0;i<n;i++)scanf("%d",&val[i]);
74         for(int i=1;i<=m;i++)
75         {
76             int a,b;
77             scanf("%d%d",&a,&b);
78             a--,b--;
79             Map[a][b]=Map[b][a]=true;
80         }
81         if(n==1) printf("%d 1\n",val[0]);
82         else
83         solve();
84     }
85     return 0;
86 }