Gee_Zer的博客

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...

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...