poj3071 Football
来源:互联网 发布:淘宝推广多少钱 编辑:程序博客网 时间:2024/04/29 06:48
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.
Source
大概属于二叉树的记忆化搜索吧……额,不过我更喜欢归结它为水题。。
#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;struct Tree{ double win[1<<9];};Tree tree[1<<12];double fight[1<<9][1<<9];int n,cnt;void DFS(int t,int deep){ memset(tree[t].win,0,sizeof(tree[t].win)); if (deep==n) { tree[t].win[cnt++]=1; return; } DFS(2*t+1,deep+1); DFS(2*t+2,deep+1); for (int i=0;i<(1<<n);i++) { for (int j=0;j<(1<<n);j++) { tree[t].win[i]+=tree[2*t+1].win[i]*tree[2*t+2].win[j]*fight[i][j]; tree[t].win[i]+=tree[2*t+2].win[i]*tree[2*t+1].win[j]*fight[i][j]; } }}int main(){ int i,j; while(1) { scanf("%d",&n); if (n==-1) break; for (i=0;i<(1<<n);i++) { for (j=0;j<(1<<n);j++) { scanf("%lf",&fight[i][j]); } } cnt=0; DFS(0,0); double p=0; int idx=-1; for (i=0;i<(1<<n);i++) { if (tree[0].win[i]>p) { idx=i; p=tree[0].win[i]; } } printf("%d\n",idx+1); } return 0;}
- POJ3071 Football
- POJ3071--Football
- poj3071 Football
- poj3071 Football
- POJ3071---Football
- 【POJ3071】【Football】
- poj3071 Football
- 【POJ3071】Football
- poj3071——Football
- POJ3071:Football(概率DP)
- Football(poj3071,概率DP)
- 树型dp poj3071 Football
- POJ3071 Football 【概率dp】
- poj3071--Football(概率计算)
- [POJ3071]Football(概率dp)
- 【POJ3071】Football(概率dp)
- POJ3071-Football(概率DP+滚动数组)
- poj3071
- SRM 561
- 精简双向链表的插入代码
- QTCreator + MSVC10编译器 使用boost::filesystem 时 error LNK2019: codecvt ... 问题的解决
- c语言gmail基于openssl的简易程序
- windows8 文件属性没有“安全”选项卡
- poj3071 Football
- SignalR中获取cookie的解决方法
- [UVA 11234] Expressions (二叉树的建立与层次遍历)
- 题目1096:日期差值
- CocoaPods安装和使用教程
- js入门例子小结2
- 练习2.21-练习2.35
- 并发和并行的区别
- C++引言