2020-2021:teams:mian:hdu_training:2019_multi-university_training_contest_2
这是本文档旧的修订版！
目录
2019 Multi-University Training Contest 2
Virtual Participated on Aug 17, 2020.
Results
Summary
- Solved 8 out of 12 problems
- Solved 8 out of 12 afterwards
Virtual Participation
Submit Distribution in Members
| Solved | A | B | C | D | E | F | G | H | I | J | K | L |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Pantw | √ | √ | √ | |||||||||
| Withinlover | √ | √ | √ | |||||||||
| Gary | √ | √ |
(√ for solved during VP, ○ for after VP, - for tried but not solved)
Solutions
E
这个题看起来很诡异但其实所有东西都是随机且相互独立的，可以全部分开计算。
简单推推式子就完了。
F
FWT裸题
J
签到题
L
从前往后枚举区间左端点，对每个值在线段树上维护可行区间。
I
建立回文自动机 直接判断自动机上每个节点是不是满足条件的回文串，我写的manacher，哈希好像更方便点
Comments
ptw：
- 我决起而飞，
抢榆枋而止
Gary：
- 加油加油
2020-2021/teams/mian/hdu_training/2019_multi-university_training_contest_2.1597990760.txt.gz · 最后更改: 2020/08/21 14:19 由 gary
