并查集
Gee_Zer
这个作者很懒,什么都没留下…
展开
-
B - Edgy Trees CodeForces - 1139C(并查集)
C. Edgy Trees time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output You are given a tree (a connected undirected graph without cycles) of n vertices...原创 2019-04-09 09:25:43 · 200 阅读 · 0 评论 -
G - Cyclic Components CodeForces - 977E (dfs or 并查集)
E. Cyclic Components time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output You are given an undirected graph consisting of n vertices and m edges. Y...原创 2019-04-17 10:08:50 · 232 阅读 · 0 评论