| # | 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 |
Help needed to solve JOI 2013/2014 Problem — Historical
Hi. I am having problem trying to solve the last subtask for JNOI 2013/2914 — Historical Research. The english problem statement can be found here.
For those who can read Japanese, the editorial can be found here
The input and output data can be found here
My approach is as follows:
Perform square root decomposition on the queries by reordering them by their
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en3 |
|
Lance_HAOH | 2017-07-15 17:21:30 | 946 | Tiny change: ' \right) $\n' -> ' \right) $. However, $ 1 \le Q,N \le 100000 $\n' (published) | |
| en2 |
|
Lance_HAOH | 2017-07-15 16:50:43 | 1331 | Tiny change: 'ht bound. Complexity ' -> 'ht bound. Time-complexity ' | |
| en1 |
|
Lance_HAOH | 2017-07-15 15:13:52 | 633 | Initial revision (saved to drafts) |
