CSDN-Ada助手: 恭喜你这篇博客进入【CSDN月度精选】榜单，全部的排名请看 https://bbs.csdn.net/topics/618801716。

starry_fyy: 超时啦，dfs也超时

Kearney form An idea: 根据你的代码进行修改后提交，超时了： [code=python] n, m, q = map(int, input().split()) initial_relationship = [] for i in range(m): u, v = map(int, input().split()) initial_relationship.append([u, v]) unionFind = UnionFind(n + 1) relationship = set() for relation in initial_relationship: relationship.add(tuple(sorted(relation))) events = [] for i in range(q): events.append(list(map(int, input().split()))) for event in events[::-1]: if event[0] == 1: relationship.discard(tuple(sorted(event[1:]))) for relation in relationship: unionFind.merge(*relation) ans = [] for event in events[::-1]: if event[0] == 1: unionFind.merge(event[1], event[2]) else: ans.append("Yes" if unionFind.query(event[1], event[2]) else "No") for a in ans[::-1]: print(a) [/code]

Kearney form An idea: 拟提交后没遇到超时吗？

普通网友: 博主的文章让我对这个主题有了全新的认识，细节描写非常到位，让我感受到了博主的深厚功底。【我也写了一些相关领域的文章，希望能够得到博主的指导，共同进步！】