bblss123的博客

Description　一个有向图G=(V,E)称为半连通的(Semi-Connected)，如果满足：∀u,v∈V\forall u,v∈V，存在满足u→v或v→u的路径，即对于图中任意两点u，v,存在一条u到v的有向路径或者从v到u的有向路径。若G′=(V′,E′)G'=(V',E') 满足V′∈VV'∈V，E′E'是EE中所有跟V′V'有关的边，则称G′G'是GG的一个导出子图。若G′G'是G

Description Mr. Chopsticks keeps N monsters, numbered from 1 to N. In order to train them, he holds N * (N - 1) / 2 competitions and asks the monsters to fight with each other. Any two monsters fight