Educational Codeforces Round 13 E. Another Sith Tournament

E. Another Sith Tournament

time limit per test
2.5 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

The rules of Sith Tournament are well known to everyone. n Sith take part in the Tournament. The Tournament starts with the random choice of two Sith who will fight in the first battle. As one of them loses, his place is taken by the next randomly chosen Sith who didn’t fight before. Does it need to be said that each battle in the Sith Tournament ends with a death of one of opponents? The Tournament ends when the only Sith remains alive.

Jedi Ivan accidentally appeared in the list of the participants in the Sith Tournament. However, his skills in the Light Side of the Force are so strong so he can influence the choice of participants either who start the Tournament or who take the loser’s place after each battle. Of course, he won’t miss his chance to take advantage of it. Help him to calculate the probability of his victory.
Input

The first line contains a single integer n (1 ≤ n ≤ 18) — the number of participants of the Sith Tournament.

Each of the next n lines contains n real numbers, which form a matrix pij (0 ≤ pij ≤ 1). Each its element pij is the probability that the i-th participant defeats the j-th in a duel.

The elements on the main diagonal pii are equal to zero. For all different i, j the equality pij + pji = 1 holds. All probabilities are given with no more than six decimal places.

Jedi Ivan is the number 1 in the list of the participants.
Output

Output a real number — the probability that Jedi Ivan will stay alive after the Tournament. Absolute or relative error of the answer must not exceed 10 - 6.
Examples
Input

3
0.0 0.5 0.8
0.5 0.0 0.4
0.2 0.6 0.0

Output

0.680000000000000

题意

有n个人对战，知道两两胜率，你可以安排对战顺序，问你最大的胜率是多少

思路

首先由一个结论是n个人对战，自己最后一个上是使自己胜率最大的排序方法。
自己设为0号，之后状态压缩dp，设dp[i][j]代表i状态下的人对战，其中j号是第一个上的时自己最大的胜率。m[i][j]代表i对j胜利的概率。
状态转移方程为

dp[i][j]=max(dp[i][j],m[j][k]*dp[i^(1 << k)][j]+m[k][j]*dp[i^(1 << j)][k])

k是j第一轮对战的人

代码

#include <cstdio>
#include <map>
#include <algorithm>
using namespace std;
double dp[1<<18][18];
double m[20][20];

int main()
{
    int n;
    double ans=0;
    scanf("%d",&n);


    for (int i=0;i<n;i++)
    {
        for (int j=0;j<n;j++)
        {
            scanf("%lf",&m[i][j]);
        }
    }
    dp[1][0]=1.0;
    for (int i=3;i<(1<<n);i+=2)
    {
        for (int j=0;j<n;j++)
        {
            if ( i&(1<<j) )
            {
                for (int k=0;k<n;k++)
                {
                    if ( i&(1<<k) && j!=k )
                    {
                        dp[i][j]=max(dp[i][j],m[j][k]*dp[i^(1<<k)][j]+m[k][j]*dp[i^(1<<j)][k]);
                    }
                }
            }
        }
    }
    for (int i=0;i<n;i++) ans=max(ans,dp[(1<<n)-1][i]);

    printf("%lf",ans);
}

PS

现场想到了应最后一个上的结论，也想到了状压DP，但是没做出来，问题出在只想着如何正向算出出上场的顺序，但是这题需要逆向DP，不断的在初始位置增加人，该解题方式值得仔细思考