Difference between revisions of "2019 CCPC Final"
Jump to navigation
Jump to search
Xiejiadong (talk | contribs) (→Replay) |
(→Replay) |
||
Line 9: | Line 9: | ||
Kilo_5723: | Kilo_5723: | ||
+ | |||
+ | * 没得彻底。 | ||
Weaver_zhu: | Weaver_zhu: |
Revision as of 08:57, 21 November 2019
Replay
Xiejiadong:
- 周五太浪,周六讲座,赛前无练习,然后就丢脸了
- 周六热身赛就丢了个大脸
- 正赛一个半小时就没题做了,菜的真实
- 是不是周五中了个旷世的鼠标垫,用光了比赛需要的 RP 。
Kilo_5723:
- 没得彻底。
Weaver_zhu:
Problem A
Solved by Xiejiadong. 00:20:45 (+1)
自定义排序签到。
Problem B
Unsolved.
Problem C
Unsolved.
Problem D
Unsolved.
Problem E
Unsolved. (-13)
Problem F
Unsolved.
Problem G
Unsolved.
Problem H
Unsolved.
Problem I
Solved by Kilo_5723. 01:37:08 (+)
Problem J
Unsolved. (-2)
Problem K
Solved by Xiejiadong. 00:55:06 (+)
题意:求每一个子树里面所有的节点编号构成了多少个联通块。
题解:每一个子树用 set 维护节点编号。
暴力插入编号以后判断左右联通性,求出联通块数量。
直接启发式合并,就过去了。
Problem L
Solved by Kilo_5723. 00:36:34 (+1)