Hello, Codeforces!
The 2020 ICPC Asia Macau Regional Contest has ended on May 29th.
The problems for this contest were prepared by Zhejiang University. We are glad to announce that we have published the contest, The 2020 ICPC Asia Macau Regional Contest in Codeforces::Gym for you to practice. Feel free to start virtual participation or to solve the problems individually. For virtual participation, the contest is 5 hours in length and follows usual ICPC rules. Team participation is recommended, but it is also possible to participate individually. The ghosts of the onsite participants are available, you may take advantage of it.
My thanks go to:
University of Macau
Problem authors: shb123, Sugar_fan, Claris, chenjb, Subconscious, lxlxl, quailty
Testers: jqdai0815, cxt, mengbierr, Rewritetxdy, chenyanbo, Orenji.Sora, Sdchr, pb0207, niike0goood
MikeMirzayanov for the Codeforces platform and the Polygon system where we prepared the problems.
The contest link is The 2020 ICPC Asia Macau Regional Contest
We have prepared an English editorial. Hope you enjoy the problems and feel free to discuss them in the comments.
Auto comment: topic has been updated by chenjb (previous revision, new revision, compare).
In problem K,before using bitset to solve the 2-SAT problem ,how to construct the graph fast enough?
The $$$i$$$-th row of the adjacent matrix can also be constructed using bitset — it is equal to (ads whose R >= const) AND (ads whose L <= const) AND (ads intersects with me in x) AND (ads intersects with me in y).