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.
# | User | Rating |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Name |
---|
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