Tomorrow is GP of Dolgoprudny which is prepared by my colleagues and me.
Hope, you'll like the problems which we can discuss here after the contest.
Also, we've prepared mini-tutorial which I'll post here after the contest too.
Good luck!
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
Tomorrow is GP of Dolgoprudny which is prepared by my colleagues and me.
Hope, you'll like the problems which we can discuss here after the contest.
Also, we've prepared mini-tutorial which I'll post here after the contest too.
Good luck!
Name |
---|
Mini editorial
My solutions for problems I had solutions.
Nice problem set. May I ask why do you make B with n = 104? I think it's more fair to have n = 5, 000 for O(n2) solution.
With n = 104, we should be extremely careful with the constant involved in the computation.
It was made to prevent solutions with complexity. Sorry if you had to spend much time optimizing your solution.
Can you provide the contest link please?