| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 150 |
Hi, in problem E. "Reachability from the Capital" ("https://mirror.codeforces.com/contest/999/problem/E") me and author are having the same solution but the autor solution got accepted and mine got time limit exceeded and i am not able to find the solution for it , can someone help me with this solution
authors solution -- "https://mirror.codeforces.com/contest/999/submission/48886017" mine solution -- "https://mirror.codeforces.com/contest/999/submission/48883663"
hi . i am not able to pass all the test cases of a question on hackerearth on fenwick trees .i have even checked my solution with the author's solution and not able to find what is the mistake . please need help . the question link https://www.hackerearth.com/practice/data-structures/advanced-data-structures/fenwick-binary-indexed-trees/practice-problems/algorithm/vanya-and-array-4/ my solution - http://ideone.com/vXHQV1
