Pku oj 3071 Football（概率dp）

Football

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 4829		Accepted: 2451

Description

Consider a single-elimination football tournament involving 2ⁿ teams, denoted 1, 2, …, 2ⁿ. 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 n rounds, only one team remains undefeated; this team is declared the winner.

Given a matrix P = [p_ij] such that p_ij 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 2ⁿ lines each contain 2ⁿ values; here, the jth value on the ith line represents p_ij. The matrix P will satisfy the constraints that p_ij = 1.0 − p_ji for all i≠ j, and p_ii = 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.

状态转移方程是  dp[i][j] += dp[i-1][j] * dp[i-1][k] * p[j][k]; dp[i][j]表示第i场第j支队伍获胜的概率，它等于i-1场第j支队伍胜的概率*i-1场第k支队伍胜的概率*j打赢k的概率，然后遍历，其实就是全概率公式，位运算用的很巧妙，，，当时看题解看了好久

#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;

const int maxn = 260;
double dp[8][maxn];
double p[maxn][maxn];
int n;

int main()
{
    while(~scanf("%d",&n) && n != -1)
    {
        for(int i=0;i<(1<<n);i++)
        {
            for(int j=0;j<(1<<n);j++)
            {
                scanf("%lf",&p[i][j]);
            }
        }
        memset(dp,0,sizeof(dp));
        for(int i=0;i<(1<<n);i++)
        {
             dp[0][i] = 1;
        }

        for(int i=1;i<=n;i++)
        {
            for(int j=0;j<(1<<n);j++)
            {
                for(int k=0;k<(1<<n);k++)

                {
                    if((j>>(i-1)^1) == (k>>(i-1)))
                    {
                        dp[i][j] += dp[i-1][j] * dp[i-1][k] * p[j][k];
                    }
                }
            }
        }
        int ans;
        double Max = -1;
        for(int i=0;i<(1<<n);i++)
        {
            if(dp[n][i] > Max)
            {
                ans = i + 1;
                Max = dp[n][i];
            }
        }
        printf("%d\n",ans);
    }
}