POJ3071Football——概率动态规划+异或^的妙用

最新推荐文章于 2022-09-03 14:22:29 发布

tcherry

最新推荐文章于 2022-09-03 14:22:29 发布

阅读量674

点赞数

分类专栏：暑假1000道DP

本文链接：https://blog.csdn.net/tcherry/article/details/38236697

版权

该博客讨论了一种使用概率动态规划方法来预测单淘汰足球锦标赛胜者的问题。给定每支球队击败另一支球队的概率矩阵，博客解释了如何通过动态规划计算最有可能赢得比赛的队伍，并保证在顶级球队之间的获胜概率差异至少为0.01。

摘要由CSDN通过智能技术生成

Football

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 2884		Accepted: 1467

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 tha