Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 4963 | Accepted: 2522 |
Description
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 n rounds, 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.
给出2^n个球队,以及他们之间比赛(淘汰赛)的胜率, 求哪一个球队的胜率最大
概率DP, 求概率很简单, A球队战胜B球队的概率P = P(ab)*P(a在之前比赛中全胜)*P(b在之前比赛中全胜)
关键在于A与B球队什么时候回相遇
例如: 如果A是1号队, 那么在第一场比赛中只会碰到2, 第二场中会碰到3-4, 第三场中会碰到5-8
队名 1 2 3 4 5 6 7 8
预处理 0 1 2 3 4 5 6 7
第一场/1 0 1 2 3 4 5 6 7
第二场/2 0 0 1 1 2 2 3 3
第三场/4 0 0 0 0 1 1 1 1
。
。
。
。
第n场/pow(2, n-1)
我们可以得到
if( (((j-1)>>(i-1))^1) == ((k-1)>>(i-1)) )
<span> </span>dp[i][j] += dp[i-1][j]*dp[i-1][k]*p[j][k];
剩下的就是很简单的工作了
</pre><p></p><p></p><pre code_snippet_id="1901631" snippet_file_name="blog_20160926_3_3994647" name="code" class="cpp">#include<stdio.h>
#include<algorithm>
#include<iostream>
#include<string.h>
#include<stdlib.h>
#include<queue>
#include<vector>
#include<math.h>
using namespace std;
const int MAX = 150;
double p[MAX][MAX], dp[MAX][MAX];
int main()
{
int n, m;
while(~scanf("%d", &n)&&n!=-1)
{
m = 1<<n;
for(int i = 1; i<=m; ++i)
for(int j = 1; j<=m; ++j)
scanf("%lf", &p[i][j]);
memset(dp, 0, sizeof(dp));
for(int i = 1; i<=m; ++i)
dp[0][i] = 1;
for(int i = 1; i<=n; ++i)
{
for(int j = 1; j<=m; ++j)
{
for(int k = 1; k<=m; ++k)
{
if( (((j-1)>>(i-1))^1) == ((k-1)>>(i-1)) )
dp[i][j] += dp[i-1][j]*dp[i-1][k]*p[j][k];
}
}
}
int ans = -1;
double pp = 0.0;
for(int i = 1; i<=m; ++i)
{
if(dp[n][i]>pp)
{
pp = dp[n][i];
ans = i;
}
}
printf("%d\n", ans);
}
return 0;
}