hdu 5036 Explosion （bitset优化的传递闭包求解概率）

Explosion

Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)

Total Submission(s): 142    Accepted Submission(s): 25

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.

 

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

  
  

   
   2
3
1 2
1 3
1 1
3
0
0
0
  
  

 

Sample Output

  
  

   
   Case #1: 1.00000
Case #2: 3.00000
  
  

 

Source

2014 ACM/ICPC Asia Regional Beijing Online

题意：

一个人要打开或者用炸弹砸开所有的门，每个门里面有一些钥匙，一个钥匙对应一个门，有了一个门的钥匙就能打开相应的门，告诉每个门里面有哪些门的钥匙，问需要用的炸弹为多少。

思路：

考虑每个点需要用炸弹打开的概率，那么所有点的概率之和就是解。 每个点 v 需要用炸弹打开的概率是 1/S, S是u(u->v联通)的数量， 然后就变成求这个图的传递闭包了,用bitset优化。为什么是1/S呢，因为这S个门里面必定要用一个炸弹砸开，而砸v的概率为1/S。

bieset用法：点击打开链接

代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <string>
#include <map>
#include <stack>
#include <vector>
#include <set>
#include <queue>
#include <bitset>
#define maxn 1005
#define MAXN 200005
#define INF 0x3f3f3f3f
#define mod 1000000007
#define eps 1e-6
const double pi=acos(-1.0);
typedef long long ll;
using namespace std;

int n,m;
double ans;
bitset<1005>edge[maxn];

void floyd()
{
    int i,j,k;
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=n;j++)
        {
            if(edge[j][i]) edge[j]|=edge[i];
        }
    }
    int num;
    ans=0;
    for(i=1;i<=n;i++)
    {
        num=0;
        for(j=1;j<=n;j++)
        {
            if(edge[j][i]) num++;
        }
        ans+=1.0/num;
    }
}
int main()
{
    int i,j,t,ca=0;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        for(i=1;i<=n;i++)
        {
            edge[i].reset();
            edge[i][i]=1;
        }
        int num,x;
        for(i=1;i<=n;i++)
        {
            scanf("%d",&num);
            for(j=1;j<=num;j++)
            {
                scanf("%d",&x);
                edge[i][x]=1;
            }
        }
        floyd();
        printf("Case #%d: %.5f\n",++ca,ans);
    }
    return 0;
}