Stay Hungry,Stay Foolish!

摘要: C - Path Graph https://atcoder.jp/contests/abc287/tasks/abc287_c 思路 判断所有点组成一个链的路径 根据每个节点的度来判断: 链路的度: 两边为节点度为1, 中间所有节点度为2. 1 -- 2 -- 2 -- ... -- 2 -- 1 阅读全文
posted @ 2023-01-29 23:28 lightsong 阅读(34) 评论(0) 推荐(0) 编辑
摘要: E - Bishop 2 https://atcoder.jp/contests/abc246/tasks/abc246_e 思想 BFS遍历。 Code https://atcoder.jp/contests/abc246/submissions/38443616 bool pts[1505][1 阅读全文
posted @ 2023-01-29 23:20 lightsong 阅读(20) 评论(0) 推荐(0) 编辑
Life Is Short, We Need Ship To Travel