poj 3071 Football DP

最新推荐文章于 2019-10-04 21:38:25 发布

原创最新推荐文章于 2019-10-04 21:38:25 发布 · 782 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#poj #c++

DP 专栏收录该内容

28 篇文章

订阅专栏

本文介绍了一个单淘汰制足球锦标赛的胜者预测模型。通过输入各队间的胜负概率矩阵，利用递归算法计算每支队伍赢得整个锦标赛的概率，并找出最有可能获胜的队伍。

Football

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 3297		Accepted: 1687

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

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

#define M (1<<7)+20
double p[M][M];
double dp[8][M];

int main(){
    int n;
    while(~scanf("%d",&n)){
        if(n==-1)   break;
        int i,j,k,t;
        int m=1<<n;
        for(i=0;i<m;i++)
            for(j=0;j<m;j++)
                scanf("%lf",&p[i][j]);

        memset(dp,0,sizeof dp);
        for(i=0;i<=m;i++)  dp[0][i]=1;
        for(i=1;i<=n;i++)
            for(j=0;j<m;j++){
                t=j/(1<<(i-1));
                t^=1;
                dp[i][j]=0;
                for(k=t*(1<<(i-1));k<t*(1<<(i-1))+(1<<(i-1));k++)
                    dp[i][j]+=dp[i-1][j]*dp[i-1][k]*p[j][k];
            }

        int ans;
        double tmp=0;
        for(i=0;i<m;i++){
            if(tmp<dp[n][i]){
                tmp=dp[n][i];
                ans=i;
            }
        }

        printf("%d\n",ans+1);
    }
    return 0;
}