Difference between revisions of "Andrew Stankevich Contest 45 (ASC 45)"
Jump to navigation
Jump to search
Line 53: | Line 53: | ||
Solved by kblack. 02:16 (+) | Solved by kblack. 02:16 (+) | ||
− | 稳健的 kblack 一通暴力,一发过了。。。。(膜 | + | <del>ultmaster: 稳健的 kblack 一通暴力,一发过了。。。。(膜</del> |
+ | |||
+ | 放入圆形的套路,二分半径 R,所有边往内部缩 R,然后看最远距离有没有 2R 即可。 |
Revision as of 00:51, 12 March 2018
Problem A
Solved by ultmaster. 01:59 (+3)
罚时不是我贡献的。
Problem B
Solved by ultmaster & zerol. 04:05 (+14)
ultmaster 写错了若干个地方。疯狂 GG。
Problem C
Upsolved by kblack. (-2)
正确的 DP 状态是 (长度, 最后一个元素, 下界, A, 出现的数字的bits)之后枚举下一个数即可。使用BFS,状态不会遇到太多,代码写得略辣鸡,本地跑了60s。。。看来不够RUSH!
Problem D
Solved by ultmaster. 00:47 (+)
做过经典题 Random Walk 的人都知道,套路一下就好了。(当然做过忘了的人又找了好久的规律)
Problem E
Upsolved by ultmaster.
没时间了。
Problem F
Solved by zerol. 01:18 (+2)
Problem G
Unsolved.
Problem H
Unsolved.
Problem I
Unsolved.
Problem J
Unsolved.
Problem K
Solved by kblack. 02:16 (+)
ultmaster: 稳健的 kblack 一通暴力,一发过了。。。。(膜
放入圆形的套路,二分半径 R,所有边往内部缩 R,然后看最远距离有没有 2R 即可。