 |
| ||||
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 | |||||||||
枚举所有点两步dfs，将该点关联的边都去掉，subtaska需要dfs看st是否能到ed，不能的话就是unavoid。subtaskb中就是对前面dfs未访问的点透过“原始邻接矩阵”看dfs能不能可达第一步dfs访问过的点，都不可达则是split的点Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
