 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
比较慢的算法：任意生成树，遍历剩余的边，每个边会跟树的节点构成环，环的奇偶性由边的节点在树中的深度和决定，共边的环联通，奇数环上的点lucky，跟奇数环直接或间接联通的环上的点lucky bfs/并集查 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
