2014北京网络预选赛1005(强连通缩点+期望)HDU5036
来源:互联网 发布:传奇游戏网络传输异常 编辑:程序博客网 时间:2024/04/19 23:43
Explosion
Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 243 Accepted Submission(s): 63
Problem Description
Everyone knows Matt enjoys playing games very much. Now, he is playing such a game. There are N rooms, each with one door. There are some keys(could be none) in each room corresponding to some doors among these N doors. Every key can open only one door. Matt has some bombs, each of which can destroy a door. He will uniformly choose a door that can not be opened with the keys in his hand to destroy when there are no doors that can be opened with keys in his hand. Now, he wants to ask you, what is the expected number of bombs he will use to open or destroy all the doors. Rooms are numbered from 1 to N.
Input
The first line of the input contains an integer T, denoting the number of testcases. Then T test cases follow.
In the first line of each test case, there is an integer N (N<=1000) indicating the number of rooms.
The following N lines corresponde to the rooms from 1 to N. Each line begins with an integer k (0<=k<=N) indicating the number of keys behind the door. Then k integers follow corresponding to the rooms these keys can open.
In the first line of each test case, there is an integer N (N<=1000) indicating the number of rooms.
The following N lines corresponde to the rooms from 1 to N. Each line begins with an integer k (0<=k<=N) indicating the number of keys behind the door. Then k integers follow corresponding to the rooms these keys can open.
Output
For each test case, output one line "Case #x: y", where x is the case number (starting from 1), y is the answer which should be rounded to 5 decimal places.
Sample Input
231 21 31 13000
Sample Output
Case #1: 1.00000Case #2: 3.00000
题意:RT
思路:如果一个门被打开,那么它里面装的钥匙的门一定都打开了
不难想到,如果存在环,那么选择环里的任何门打开,整个环就都打开了
先强连通缩点,变成了一个DAG
只要一遍DFS处理出哪些点可以被哪些点到达,这个可以用bitset维护
然后要算打开所有门的期望,实际上就是要算出对于每个门来讲,它打开的期望,然后加起来即可
对于门i,如果有x个门可以到达它,那么打开它的概率为cnt[i]/x,期望也即cnt[i]/x,这里的门已经是强连通缩点后的,cnt[i]为i里面门的数量
0 0
- 2014北京网络预选赛1005(强连通缩点+期望)HDU5036
- NYOJ 120 校园网络(强连通缩点)
- NYOJ120 校园网络 强连通缩点
- 强连通缩点
- 强连通缩点
- poj 2762 (强连通缩点)
- hdu 5934(强连通缩点)
- HDU5934 Bomb(强连通缩点)
- HDU5934Bomb(强连通缩点)
- HDU2767 强连通缩点
- poj1236强连通缩点
- Semiconnected--强连通缩点
- 强连通缩点 hdu3072
- nyoj 120 校园网络(强连通缩点+判断入度出度大小)
- poj 3160(强连通缩点 + dp)
- codeforces #427C Checkposts(强连通缩点)
- poj 1236 Network of Schools(强连通缩点)
- poj 2186 (强连通缩点传递关系)
- Map集合的实例对象中创建对象。然后通过Set集合获取
- linux并发控制之信号量
- \[\huge{Hello~World}\]
- UIWebView的缓存:LocalSubstitutionCache
- linux下nginx+php+mysql环境搭建
- 2014北京网络预选赛1005(强连通缩点+期望)HDU5036
- CEF设置cookie
- 咖啡很苦却很甜
- Control.DataBinding数据绑定细解
- 20140923 N2
- Thrift源码分析(一)-- 基本概念
- 健身减肥的时间
- jquery formValidate demo 采用struts 异步方式检验用户名是否存在
- hdu5000 Clone