题目链接:点击打开链接
题意:
给出n个点m条无向边的图
开始图里没有边,每次加一条边,然后输出图里欧拉回路的条数。
思路:
We will count the number of ski bases including the base consisted of empty subset of edges (before printing just subtract one). In the beginning the number of bases is equal to 1. If we connect vertexes in the same connected components then the result should be multiplied by 2 else do nothing. You should use DJS data structure to