UVA 11600 Masud Rana 并查集+状压概率dp

题目链接：点击打开链接

题意:给定一个无向图，给定的边是已经存在的边，每天会任选两个点新建一条边（建过的边还会重建）

问：使得图连通的天数的期望。

思路：状压喽，看别人都是这么写的，n=30，m=0 我也不知道怎么办了。。

当前连通块点数为X 加入一个Y个点的连通块需要的天数为 Y/(n-X);

Masud Rana, A Daring Spy Of Bangladesh Counter Intelligence. He is in a new mission. There is a
total n cities in Bangladesh. Each city is connected to all other by bidirectional roads. So there are
total n ∗ (n − 1)/2 bidirectional roads. Many of the roads are under control of evil powers. City a is
safely reachable from city b, if there is a path from a to b containing only roads which are not under
control of evil powers. There are m roads which are safe from evil powers. The mission of Ma