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 | tourist | 3843 |
2 | jiangly | 3705 |
3 | Benq | 3628 |
4 | orzdevinwang | 3571 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3530 |
8 | ecnerwala | 3499 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 171 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 159 |
5 | nor | 153 |
5 | maroonrk | 153 |
7 | -is-this-fft- | 152 |
8 | Petr | 146 |
9 | orz | 145 |
10 | pajenegod | 144 |
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