# | User | Rating |
---|---|---|
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 |
# | User | Contrib. |
---|---|---|
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 |
Name |
---|
I think that it is quite hard to solve 321E with D&C Optimization because the runtime is multiplied by 2. I tried several times and barely passed the time limit. I think there are very fast solutions to this problem but I am not sure if they used D&C optimization.
Author solve uses D&C optmization, so you can read this here
Well, the runtime is now multiplied by 2 due to change in servers. So I am not sure if the author's solution can pass so easily this time.
How do you solve it without this optimization? I had to do some dumb input reading tricks to get AC.
Did you solve these tasks? These will be useful after you solve tasks and can tell about idea of these tasks
https://codeforces.net/contest/1175/problem/G this task can't be solved using D&C optimization (Um_nik wrote it during the contest and get WA). Yes, here can be used D&C but it is another approach.
Thank you VEGAnn.It will be fixed.
Auto comment: topic has been updated by topovik (previous revision, new revision, compare).