Good... yes, good afternoon, Codeforces!
We are glad to invite you to take part in Good Bye 2024: 2025 is NEAR, which will start on Dec/28/2024 17:35 (Moscow time). You will be given 9 problems and 3 hours to solve them. One of the problems will be divided into two subtasks.
All the problems are authored by wyrqwq and me.
In this round, we would like to say goodbye to the past bad memories. However, the point is we won't say goodbye to:
- TheScrasse for his cherrish coordination as always.
- Alexdat2000 for Russian Translation.
- dqstz for providing a problem proposal that was not used.
- LMydd0225, Error_Yuan, and N_z__ for helping with preparation on Polygon (including testing).
- Tony2_CF for improving a task, and KAN for improving the statement of many tasks.
- StarSilk, and jqdai0815 for LGM testing.
- nullptr_qwq, cat_of_Nesraychan, and Gabp for red testing.
- Caylex, tzl_Dedicatus545, juan_123, erray, jer033, Imdie, ABitVeryScaredOfWomen, MythicFish, anango, and min_inf for orange testing.
- IwannaEATaCUTEcaca-qwq, _TernaryTree_, doujinshi_master, PaciukZvichainyi, Dulustan, Eclipsar, and FFTotoro for purple testing.
- Chancylaser, jonatas57, SopaconK, jager59, and Fesdrer for blue testing.
- SkyWave2022, and mikcf for cyan testing.
- ishaandas1 for green testing.
- (_nikd_, Damdam307, OgradL), and (acoatoitgs, LaMatematica14, Alenygam) for team testing.
- sszcdjr for being invited to test but refuse to check a single problem at an excuse of Chemistry papers; and 251Sec for being invited to test but have no time to do virtual.
- MikeMirzayanov for the great Codeforces and Polygon platform.
UPD: The score distribution is $$$500 - 1000 - 1250 - 1750 - 2000 - 2500 - 4250 - 4500 - (3000 + 2000)$$$.
UPD: as pointed out here, the official solution of 2053I2 - Affectionate Arrays (Hard Version) is wrong. We are not sure that the problem is solvable with the current constraints. We will decide how to deal with this issue within tomorrow.
We are pleased to announce that NEAR has supported the round!
The featured prizes in NEAR are:
- Ⓝ 512 for the first place,
- Ⓝ 256 each for places 2 and 3,
- Ⓝ 128 each for places 4 to 7,
- ...
- Ⓝ 1 each for places 512-1023 places.