摘要： 1021. Deepest Root (25)时间限制1500 ms内存限制32000 kB代码长度限制16000 B判题程序Standard作者CHEN, YueA graph which is connected and acyclic can be considered a tree. The height of the tree depends on the selected root. Now you are supposed to find the root that results in a highest tree. Such a root is calledthe deepe 阅读全文

摘要： 1013. Battle Over Cities (25)时间限制400 ms内存限制32000 kB代码长度限制16000 B判题程序Standard作者CHEN, YueIt is vitally important to have all the cities connected by highways in a war. If a city is occupied by the enemy, all the highways from/toward that city are closed. We must know immediately if we need to repair a 阅读全文

摘要： Phone ListTime Limit:1000MSMemory Limit:65536KTotal Submissions:14044Accepted:4529DescriptionGiven a list of phone numbers, determine if it is consistent in the sense that no number is the prefix of another. Let's say the phone catalogue listed these numbers:Emergency 911Alice 97 625 999Bob 91 1 阅读全文