图
GreyBtfly王宝彤
业精于勤,荒于嬉;行成于思,毁于随
展开
-
The 2018 ACM-ICPC Asia Qingdao Regional Contest, Online 青岛 B Red Black Tree (数据出水了)
博客目录 原题 传送门 B Red Black Tree BaoBao has just found a rooted tree with n vertices and (n−1) weighted edges in his backyard. Among the vertices, m of them are red, while the others are black. The ro...原创 2018-09-16 17:18:08 · 432 阅读 · 0 评论 -
(银牌题)ACM-ICPC 2018 沈阳赛区网络预赛 J - Ka Chang dfs时间戳+树状数组+二分+分块
博客目录 原题 题目传送门 18.55% 1000ms 131072K Given a rooted tree ( the root is node 11 ) of NN nodes. Initially, each node has zero point. Then, you need to handle QQ operations. There're two types...原创 2018-09-29 12:54:44 · 884 阅读 · 0 评论