A10411 | Another Sith Tournament
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
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.
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.
输入格式
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 $p_{ij}$ ( $0<=p_{ij}<=1$ ). Each its element $p_{ij}$ is the probability that the $i$ -th participant defeats the $j$ -th in a duel.
The elements on the main diagonal $p_{ii}$ are equal to zero. For all different $i$ , $j$ the equality $p_{ij}+p_{ji}=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.
Each of the next $n$ lines contains $n$ real numbers, which form a matrix $p_{ij}$ ( $0<=p_{ij}<=1$ ). Each its element $p_{ij}$ is the probability that the $i$ -th participant defeats the $j$ -th in a duel.
The elements on the main diagonal $p_{ii}$ are equal to zero. For all different $i$ , $j$ the equality $p_{ij}+p_{ji}=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 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}$ .
输入输出样例
输入 #1
3 0.0 0.5 0.8 0.5 0.0 0.4 0.2 0.6 0.0
输出 #1
0.680000000000000
暂无题解
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted