Hello everyone. If it took you a short time to implement C2 last contest, can you please share your solution? I'd really appreciate it.
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
8 | ecnerwala | 3494 |
9 | Um_nik | 3396 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 163 |
1 | maomao90 | 163 |
3 | -is-this-fft- | 162 |
4 | atcoder_official | 158 |
4 | cry | 158 |
6 | awoo | 157 |
7 | nor | 155 |
7 | adamant | 155 |
9 | TheScrasse | 153 |
10 | maroonrk | 152 |
Hello everyone. If it took you a short time to implement C2 last contest, can you please share your solution? I'd really appreciate it.
Name |
---|
Here's mine, took a while to think of it but implementation was pretty smooth: 284569514
The strategy I used was:
I believe a recent problem can be solved similarly
2002D1 - DFS Checker (Easy Version)
Another small trick I used was: if an edge case is hard to handle, consider mutating the input so it can't happen. To avoid dealing with the case where a person doesn't appear in b at all, I append a to the end of b, which doesn't affect the answer (edit: now that I think about it, it isn't that hard to handle, but committing to this while thinking of the algorithm made it easier to not have to keep track of it)