POJ 3071 Football(概率DP)
来源:互联网 发布:淘宝商家入口 编辑:程序博客网 时间:2024/06/01 09:23
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
20.0 0.1 0.2 0.30.9 0.0 0.4 0.50.8 0.6 0.0 0.60.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:
= 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.
大牛题解:http://blog.csdn.net/acm_cxlove/article/details/7921608
题目大意:
有2^n个队,相邻的两两打淘汰赛,,求最后哪个队夺冠的概率最大
dp[i][j]表示第i轮的时候,第j去支队伍赢的概率。
那么dp[i][j]的前提就是i-1轮的时候,j是赢的,而且第i轮赢了对方
接下来就是找到第i轮的时候,他的可能队手
通过二进制可以发现规律,所有高位是一样的,第i位刚好相反,所以用位运算可以巧妙解决,见代码
dp[i][j]=sigma(dp[i-1][j]*dp[i-1][k]*p[j][k])
注意用二进制规律时,j代表的队伍标号是从0开始的。这个规律可以通过画一颗比赛安排的树形图发现。
#include<cstdio>#include<cstring>#include<algorithm>#include<iostream>using namespace std;#define N (1<<7)+5double p[N][N];double dp[10][N];int main(){ int n; 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][k]*dp[i-1][j]*p[j][k]; } double ans = 0; int index = -1; for(int i = 0; i < (1<<n); i++) { if(dp[n][i] > ans) { ans = dp[n][i]; index = i + 1; } } printf("%d\n", index); } return 0;}
- POJ 3071 Football (概率DP)
- poj 3071 Football(概率dp)
- poj 3071 Football(概率dp)
- [ACM] POJ 3071 Football (概率DP)
- POJ 3071 Football(简单 概率DP)
- POJ 3071-Football(概率dp)
- poj 3071 Football (概率DP)
- POJ 3071 Football (概率dp)
- poj 3071 Football(概率dp)
- poj 3071 Football (概率 dp)
- poj 3071Football(概率dp)
- POJ 3071 Football(概率dp)
- POJ 3071 Football (概率DP)
- POJ 3071 Football(概率DP)
- POJ 3071 Football (概率DP)
- POJ-3071 Football (概率DP)
- POJ 3071 Football(概率dp)
- POJ 3071 Football (概率dp)
- Python & JSON
- 什么是图像分类的Top-5错误率?
- 为什么c++中重载流操作符要用友元函数
- 2728:摘花生
- Python 列表性能测试
- POJ 3071 Football(概率DP)
- 【适配整理】Android 7.0 调取系统相机崩溃解决android.os.FileUriExposedException
- 第24节:关于继承和trait进阶
- 【死磕Java并发】-----J.U.C之并发工具类:CountDownLatch
- 《C语言程序设计》读书笔记(四)——函数与程序结构
- 在SQL Server中 新建登录用户 并指定该用户登录的数据库及权限
- Hash综述
- 455. Assign Cookies
- 【转】使用缓存的9大误区