Hello, Codeforces community!↵
↵
I'm glad to invite you to [contest:1280] and [contest:1281], which will be held on [contest_time:1280]. The round will be rated for both divisions.↵
↵
The problems were taken (mostly) from the 2019 ICPC Asia-Manila Regional Contest that's happening at the same time. Thus, they have been prepared by various setters and testers from the Philippines: myself ([user:kevinsogo,2019-12-14]), Kyle See ([user:kylesky,2019-12-14]), Payton Yao ([user:noobcake,2019-12-14]), Tim Dumol ([user:timd,2019-12-14]), Guissmo Asuncion (guissmo in HackerRank) and Marte Soliza (myrtactle in TopCoder).↵
↵
Since the problems are based on the ICPC Manila regionals, we request all the coaches onsite to refrain from making the problem set public. We also request the coaches and everyone else who has seen the problems (or part of it) to refrain from joining this round.↵
↵
A huge thanks to [user:isaf27,2019-12-14] for coordinating and helping me set up this round. Thanks to [user:300iq,2019-12-14] for some testing. Of course, thanks as well to [user:MikeMirzayanov,2019-12-14] for providing us Codeforces and Polygon. These are great gifts to the competitive programming community! Also, thanks for the opportunity to use our problem set for a CF round. ↵
↵
You will be given 6 problems in both divisions and 2 hours to solve them. I recommend reading all the problems; they were written by talented writers from the judging team.↵
↵
Good luck, have fun, and I wish everyone high ratings!↵
↵
The scoring distribution will be announced closer to the beginning of the round.↵
↵
**Update:** The scoring will be as follows:↵
↵
Div.2: 500 — 1250 — 1500 — 2000 — 2500 — 3000 ↵
Div.1: 500 — 1000 — 1500 — 1750 — 2250 — 3000 ↵
↵
Good luck and have fun!↵
↵
**Update:** The editorial is up: [Click here.](https://codeforces.net/blog/entry/72212)↵
↵
Congratulations to the winners! Congratulations to [user:ksun48,2019-12-16] for winning the Div. 1 round, and [user:ilovebinhh,2019-12-16] for winning the Div. 2 round!↵
↵
Div. 1 Winners:↵
↵
1. [user:ksun48,2019-12-15]↵
2. [user:Um_nik,2019-12-15]↵
3. [user:ecnerwala,2019-12-15]↵
4. [user:peehs_moorhsum,2019-12-15]↵
5. [user:Radewoosh,2019-12-15]↵
↵
↵
Div. 2 Winners:↵
↵
1. [user:ilovebinhh,2019-12-15]↵
2. [user:Rikuki,2019-12-15]↵
3. [user:Owen_codeisking,2019-12-15]↵
4. [user:ly_61,2019-12-15]↵
5. [user:p6pou,2019-12-15]↵
↵
I hope you enjoyed the problems! Thanks to the onsite teams and coaches who gave feedback; I'm glad the reception was positive.↵
↵
I am planning on releasing the full, untouched ICPC Manila 2019 problem set in the gym sometime in the future, so you can see which problems you missed. The Intergalactic Sliding Puzzle is _not_ the hardest problem in the round!↵
↵
I'm glad to invite you to [contest:1280] and [contest:1281], which will be held on [contest_time:1280]. The round will be rated for both divisions.↵
↵
The problems were taken (mostly) from the 2019 ICPC Asia-Manila Regional Contest that's happening at the same time. Thus, they have been prepared by various setters and testers from the Philippines: myself ([user:kevinsogo,2019-12-14]), Kyle See ([user:kylesky,2019-12-14]), Payton Yao ([user:noobcake,2019-12-14]), Tim Dumol ([user:timd,2019-12-14]), Guissmo Asuncion (guissmo in HackerRank) and Marte Soliza (myrtactle in TopCoder).↵
↵
Since the problems are based on the ICPC Manila regionals, we request all the coaches onsite to refrain from making the problem set public. We also request the coaches and everyone else who has seen the problems (or part of it) to refrain from joining this round.↵
↵
A huge thanks to [user:isaf27,2019-12-14] for coordinating and helping me set up this round. Thanks to [user:300iq,2019-12-14] for some testing. Of course, thanks as well to [user:MikeMirzayanov,2019-12-14] for providing us Codeforces and Polygon. These are great gifts to the competitive programming community! Also, thanks for the opportunity to use our problem set for a CF round. ↵
↵
You will be given 6 problems in both divisions and 2 hours to solve them. I recommend reading all the problems; they were written by talented writers from the judging team.↵
↵
Good luck, have fun, and I wish everyone high ratings!↵
↵
The scoring distribution will be announced closer to the beginning of the round.↵
↵
**Update:** The scoring will be as follows:↵
↵
Div.2: 500 — 1250 — 1500 — 2000 — 2500 — 3000 ↵
Div.1: 500 — 1000 — 1500 — 1750 — 2250 — 3000 ↵
↵
Good luck and have fun!↵
↵
**Update:** The editorial is up: [Click here.](https://codeforces.net/blog/entry/72212)↵
↵
Congratulations to the winners! Congratulations to [user:ksun48,2019-12-16] for winning the Div. 1 round, and [user:ilovebinhh,2019-12-16] for winning the Div. 2 round!↵
↵
Div. 1 Winners:↵
↵
1. [user:ksun48,2019-12-15]↵
2. [user:Um_nik,2019-12-15]↵
3. [user:ecnerwala,2019-12-15]↵
4. [user:peehs_moorhsum,2019-12-15]↵
5. [user:Radewoosh,2019-12-15]↵
↵
↵
Div. 2 Winners:↵
↵
1. [user:ilovebinhh,2019-12-15]↵
2. [user:Rikuki,2019-12-15]↵
3. [user:Owen_codeisking,2019-12-15]↵
4. [user:ly_61,2019-12-15]↵
5. [user:p6pou,2019-12-15]↵
↵
I hope you enjoyed the problems! Thanks to the onsite teams and coaches who gave feedback; I'm glad the reception was positive.↵
↵
I am planning on releasing the full, untouched ICPC Manila 2019 problem set in the gym sometime in the future, so you can see which problems you missed. The Intergalactic Sliding Puzzle is _not_ the hardest problem in the round!↵
