【ZSTU4213 2015年12月浙理工校赛 D】【双连通分量tarjan算法】One-Way Roads 无向连通图确定边的方向使得全图任意两点间可达
4213:One-WayRoadsTimeLimit: 1Sec MemoryLimit: 128MB SpecialJudgeSubmit: 133 Solved: 45DescriptionIntheACMkingdom,thereare N citiesconnectedby M two-wayroads.Thesecitiesareconnected,i.e.,onecanreach