poj 2288 Islands and Bridges 状压dp

//poj 2288
//sep9
#include <iostream>
using namespace std;
typedef __int64 INT;
INT v[16];
INT dp[(1<<13)+10][13][13],path[(1<<13)+10][13][13];
bool map[16][16];
int n,m;

INT rec(int s,int now,int pre)
{
if(dp[s][now][pre]!=-1)
return dp[s][now][pre];
if(!map[now][pre]) return -1;
int ss=s&(~(1<<now));
if(((ss>>pre)&1)==0) return -1;
for(int i=0;i<n;++i)
if(i!=pre&&map[i][pre]&&((ss>>i)&1)){
INT t=rec(ss,pre,i);
if(t==-1) continue;
t+=v[now]+v[now]*v[pre];
if(map[i][now]) t+=v[i]*v[pre]*v[now];
if(t>dp[s][now][pre]){
dp[s][now][pre]=t;
path[s][now][pre]=path[ss][pre][i];
}else if(t==dp[s][now][pre])
path[s][now][pre]+=path[ss][pre][i];
}
return dp[s][now][pre];
}

int main()
{
int cases;
scanf("%d",&cases);
while(cases--){
memset(map,false,sizeof(map));
memset(dp,-1,sizeof(dp));
memset(path,0,sizeof(path));
scanf("%d%d",&n,&m);
for(int i=0;i<n;++i)
scanf("%I64d",&v[i]);
if(n==1){
printf("%I64d 1\n",v[0]);
continue;
}
while(m--){
int x,y;
scanf("%d%d",&x,&y);
map[x-1][y-1]=map[y-1][x-1]=true;
}
for(int i=0;i<n;++i)
for(int j=0;j<n;++j)
if(i!=j&&map[i][j]){
dp[(1<<i)|(1<<j)][i][j]=v[i]+v[j]+v[i]*v[j];
path[(1<<i)|(1<<j)][i][j]=1;
}
INT maxx=-1,num;
for(int i=0;i<n;++i)
for(int j=0;j<n;++j){
if(i==j) continue;
if(!map[i][j]) continue;
if(rec((1<<n)-1,i,j)>maxx){
maxx=rec((1<<n)-1,i,j);
num=path[(1<<n)-1][i][j];
}else if(rec((1<<n)-1,i,j)==maxx){
num+=path[(1<<n)-1][i][j];
}
}
if(maxx==-1)
printf("0 0\n");
else
printf("%I64d %I64d\n",maxx,num/2);
}
return 0;
}