2022 ICPC Seoul Regional Mirror Contest Discussion
source link: https://codeforces.com/blog/entry/109199?f0a28=1
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.
2022 ICPC Seoul Regional Mirror Contest Discussion
By nor, 5 hours ago,
The 2022 ICPC Seoul Regional Mirror Contest has ended (link), and since no one made a post for discussion, let's discuss below. How to solve A, B, G and H?
5 hours ago, # |
A: Rotate the coordinate by pi/4, split into even and odd, then do N^3 * M^3 dp do compute grundy value for each subrectangles.
H: dfs over the tree formed by suffix links of suffix automaton. Maintain the set of ending positions in a set. Naively compute the answer for each node (i.e. binary search + repeatly doing lower_bound on endpos). No idea why the last step is fast. Possibly weak test.
Recommend
About Joyk
Aggregate valuable and interesting links.
Joyk means Joy of geeK