zoukankan      html  css  js  c++  java
  • POJ 3071 Football

    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 ij, 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.

    概率dp:

    f[i][j]表示j通过第i轮的概率

    显然f[i][j]=∑f[i-1][j]*f[i-1][k]*p[j][k]   k为第i轮可遇见对手

    可遇见的对手的处理见代码,显然编号从0开始更方便

     1 #include<iostream>
     2 #include<cstdio>
     3 #include<cstring>
     4 #include<algorithm>
     5 #include<cmath>
     6 using namespace std;
     7 double f[10][201],p[201][201];
     8 int n;
     9 int main()
    10 {int i,j,k,ans;
    11   while (cin>>n&&n!=-1)
    12     {
    13       memset(f,0,sizeof(f));
    14       for (i=0;i<(1<<n);i++)
    15       for (j=0;j<(1<<n);j++)
    16           scanf("%lf",&p[i][j]);
    17       for (i=0;i<(1<<n);i++)
    18     f[0][i]=1;
    19       for (i=1;i<=n;i++)
    20     {
    21       for (j=0;j<(1<<n);j++)
    22         {
    23           int t=j/(1<<i-1);
    24           t^=1;
    25           for (k=t*(1<<i-1);k<(t+1)*(1<<i-1);k++)
    26         f[i][j]+=f[i-1][j]*f[i-1][k]*p[j][k];
    27         }
    28     }
    29       ans=0;
    30       for (i=0;i<(1<<n);i++)
    31     if (f[n][i]>f[n][ans]) ans=i;
    32       printf("%d
    ",ans+1);
    33     }
    34 }
  • 相关阅读:
    jq遍历表单元素
    js变量陷阱
    Ueditor 添加插件
    this 和 self
    链接按钮重复单击
    关系运算符 与 函数
    flask 第七章 简陋版智能玩具 +MongoDB初识和基本操作
    flask 第六章 人工智能 百度语音合成 识别 NLP自然语言处理+simnet短文本相似度 图灵机器人
    flask 第五章 WebSocket GeventWebsocket 单聊群聊 握手 解密 加密
    flask 第四章 偏函数 Local空间转时间 myLocalStack RunFlask+request 请求上下文
  • 原文地址:https://www.cnblogs.com/Y-E-T-I/p/8308374.html
Copyright © 2011-2022 走看看