【概率dp+位运算判相邻小技巧】POJ - 3071 D - Football

D - Football  POJ - 3071 

Consider a single-elimination football tournament involving 2n teams, denoted 1, 2, …, 2n. In each round of the tournament, all teams still in the tournament are placed in a list in order of increasing index. Then, the first team in the list plays the second team, the third team plays the fourth team, etc. The winners of these matches advance to the next round, and the losers are eliminated. After nrounds, only one team remains undefeated; this team is declared the winner.

Given a matrix P = [pij] such that pij is the probability that team i will beat team j in a match determine which team is most likely to win the tournament.

Input

The input test file will contain multiple test cases. Each test case will begin with a single line containing n (1 ≤ n ≤ 7). The next 2n lines each contain 2n values; here, the jth value on the ith line represents pij. The matrix P will satisfy the constraints that pij = 1.0 − pji for all i ≠ j, and pii = 0.0 for all i. The end-of-file is denoted by a single line containing the number −1. Note that each of the matrix entries in this problem is given as a floating-point value. To avoid precision problems, make sure that you use either the double data type instead of float.

Output

The output file should contain a single line for each test case indicating the number of the team most likely to win. To prevent floating-point precision issues, it is guaranteed that the difference in win probability for the top two teams will be at least 0.01.

Sample Input

2
0.0 0.1 0.2 0.3
0.9 0.0 0.4 0.5
0.8 0.6 0.0 0.6
0.7 0.5 0.4 0.0
-1

Sample Output

2

Hint

In the test case above, teams 1 and 2 and teams 3 and 4 play against each other in the first round; the winners of each match then play to determine the winner of the tournament. The probability that team 2 wins the tournament in this case is:

P(2 wins)

= P(2 beats 1)P(3 beats 4)P(2 beats 3) + P(2 beats 1)P(4 beats 3)P(2 beats 4) = p21p34p23 + p21p43p24 = 0.9 · 0.6 · 0.4 + 0.9 · 0.4 · 0.5 = 0.396.

The next most likely team to win is team 3, with a 0.372 probability of winning the tournament.

题目首先给出一个n，表示比赛一共进行n轮，那么队伍就有2^n只队伍
输入一个2^n*2^n的矩阵，p[i][j]代表队伍i打败队伍j的概率
dp[i][j]代表第i轮比赛的时候，队伍j赢的概率
首先初始化时，dp[0][i]=1，在没有比赛时每个队伍都是赢的
dp[i][j]+=dp[i-1]j[*dp[i-1][k]*p[j][k]:要求j和k的上一轮都是赢家的概率再乘以本轮j打败k的概率
特别注意，队伍只能相邻的打，相邻的队伍转换成二进制时，高位相同，到第i位正好相反
可以用 if(((j>>(i-1))^1)==(k>>(i-1)))来判断，是否相邻，或者是下面代码中我所用的方法
因为最开始一轮两两相邻的打，只有二进制中的最后一位不一样，第二轮时，上一轮的赢家相邻的打，是第二位不一样
很巧妙


#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int maxn=(1<<7)+5;
double p[maxn][maxn],dp[maxn][maxn];
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        if(n==-1) break;
        memset(dp,0,sizeof(dp));
        for(int i=0;i<=(1<<n);i++) dp[0][i]=1;
        for(int i=0;i<(1<<n);i++)
        {
            for(int j=0;j<(1<<n);j++)
            {
                scanf("%lf",&p[i][j]);
            }
        }
        for(int i=1;i<=n;i++)
        {
            for(int j=0;j<(1<<n);j++)
            {
                for(int k=0;k<(1<<n);k++)
                {
                    int a=j>>(i-1),b=k>>(i-1);
                    if(a%2)
                    {
                        a--;
                        if(a==b) dp[i][j]+=dp[i-1][j]*dp[i-1][k]*p[j][k];
                    }
                    else
                    {
                        a++;
                        if(a==b) dp[i][j]+=dp[i-1][j]*dp[i-1][k]*p[j][k];
                    }
                }
            }
        }
        double maxx=-1;
        int ans=-1;
        for(int i=0;i<(1<<n);i++)
        {
            if(dp[n][i]>maxx)
            {
                maxx=dp[n][i];
                ans=i;
            }
        }
        printf("%d\n",ans+1);
    }
    return 0;
}