HDU5222 Exploration

最新推荐文章于 2019-10-16 18:15:26 发布

a-free-man

最新推荐文章于 2019-10-16 18:15:26 发布

阅读量799

点赞数

分类专栏： # 拓扑排序 # 并查集 # 缩点(不仅SCC)

本文链接：https://blog.csdn.net/Wen_Yongqi/article/details/86764433

版权

该问题涉及一个有向图的探索，其中包含单向和双向隧道。任务是帮助Miceren从一个起点开始，至少访问另一个洞穴，然后返回起点。必须确定这样的起点是否存在。使用并查集维护无向边的连通性，并将所有连通组件'缩点'以形成有向无环图(DAG)，通过拓扑排序检查是否存在环。

摘要由CSDN通过智能技术生成

http://acm.hdu.edu.cn/showproblem.php?pid=5222

Problem Description

Miceren likes exploration and he found a huge labyrinth underground!

This labyrinth has N caves and some tunnels connecting some pairs of caves.

There are two types of tunnel, one type of them can be passed in only one direction and the other can be passed in two directions. Tunnels will collapse immediately after Miceren passing them.

Now, Miceren wants to choose a cave as his start point and visit at least one other cave, finally get back to start point.

As his friend, you must help him to determine whether a start point satisfing his request exists.

Input

The first line contains a single integer T, indicating the number of test cases.

Each test case begins with three integers N, M1, M2, indicating the number of caves, the