| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3993 |
| 2 | jiangly | 3743 |
| 3 | orzdevinwang | 3707 |
| 4 | Radewoosh | 3627 |
| 5 | jqdai0815 | 3620 |
| 6 | Benq | 3564 |
| 7 | Kevin114514 | 3443 |
| 8 | ksun48 | 3434 |
| 9 | Rewinding | 3397 |
| 10 | Um_nik | 3396 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 156 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 10 | nor | 152 |
Here is my accepted code : https://codeforces.net/contest/1791/submission/192106557
But this code should give TLE if the input is like :
1
200000 200000
a1 , a2 , a3 …… a200000
1 2 200000 (Update index 2 to 200000 and all 200000 queries are like this)
Your submission will likely fail after retesting. Although the original test set was weak, a few good test cases which eliminate most of the $$$\mathcal{O}(nq)$$$ solutions have been added during the hacking phase.
My original solution was with segment tree + lazy and that got accepted. Later I tried this and was surprised when this brute force got passed. Yeah I will be happy if this fails in the system test, but this is a very common way to solve this problem and there should be a test case in the main test in which this code should fail.