What the hell is the Div2 last night? It had A $$$\to$$$ E having much less difficult of thinking than before with a quite hard but typical(I heard from those who got accepted) F(actually ex $$$\to$$$ G)) math problem. I just thought I was do a ABC.
# | 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 |
What the hell is the Div2 last night? It had A $$$\to$$$ E having much less difficult of thinking than before with a quite hard but typical(I heard from those who got accepted) F(actually ex $$$\to$$$ G)) math problem. I just thought I was do a ABC.
Help! The time complexity of my code is $$$O(n\log^2V+q\log V),V=10^9$$$.
I found that there are too many "1" in the data, and I made a piece of data like that, but my code just run for 0.3s.
Name |
---|