随笔分类 -  2019南京网络赛ICPC

摘要:RobotsGiven a directed graph with no loops which starts at node 11 and ends at node nn.There is a robot who starts at 11, and will go to one of adjace 阅读全文
posted @ 2019-09-09 12:42 sqsq 阅读(195) 评论(0) 推荐(0)