摘要：
507. Treediff Time limit per test: 0.25 second(s) Memory limit: 262144 kilobytes input: standard output: standard Andrew has just made a breakthrough 阅读全文
posted @ 2021-11-10 17:34
脂环
阅读(126)
评论(0)
推荐(0)
摘要：
You are given a rooted tree with root in vertex 1. Each vertex is coloured in some colour. Let's call colour c dominating in the subtree of vertex v i 阅读全文
posted @ 2021-11-10 10:38
脂环
阅读(61)
评论(0)
推荐(0)
浙公网安备 33010602011771号