Find them, Catch them POJ - 1703

最新推荐文章于 2021-01-12 23:31:47 发布

小宋想站起来

最新推荐文章于 2021-01-12 23:31:47 发布

阅读量547

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/songziyuan_/article/details/99102398

本文介绍了如何使用并查集解决Tadu城中的帮派识别问题。警察试图确定两个罪犯是否属于同一帮派，但信息不完整。题目提供M条消息，包括不同帮派成员的消息和询问消息。对于每个询问，需要根据已知信息判断罪犯是否同属一帮。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

The police office in Tadu City decides to say ends to the chaos, as launch actions to root up the TWO gangs in the city, Gang Dragon and Gang Snake. However, the police first needs to identify which gang a criminal belongs to. The present question is, given two criminals; do they belong to a same clan? You must give your judgment based on incomplete information. (Since the gangsters are always acting secretly.)

Assume N (N <= 10^5) criminals are currently in Tadu City, numbered from 1 to N. And of course, at least one of them belongs to Gang Dragon, and the same for Gang Snake. You will be given M (M <= 10^5) messages in sequence, which are in the following two kinds:

1. D [a] [b]
where [a] and [b] are the numbers of two criminals, and they belong to different gangs.

2. A [a] [b]
where [a] and [b] are the numbers of two criminals. This requires you to decide whether a and b belong to a same gang.

Input