CodeForces - 505B 图的连同性,多维并查集或用搜索写
Mr. Kitayuta has just bought an undirected graph consisting of n vertices and medges. The vertices of the graph are numbered from 1 to n.
Each edge, namely edge i, has a color ci, connecting vertex
原创
2017-08-14 09:02:49 ·
194 阅读 ·
0 评论