The Nordic Collegiate Programming Contest (NCPC) 2022 will be held tomorrow. There will be a mirror (one hour delay from the actual contest). You are all welcome to take part.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
Название |
---|
Thanks for the contest! :D
I liked E and G a lot, though i couldnt solve E in contest due to me bricking the implementation of string polyhashing on F before that XD.
On another note, does anyone know how to do B? All I could think of was that for some pair of adjacent ants(have an edge between them), you should never visit a node in that pair, but idk if that's on the right track.
Here is a link to the solution presentation livestream https://www.youtube.com/watch?v=S25kO1kric8
thank u :3