I tried to implement recent div2B with as optimised constant as i could. Can someone tell why my solutions TLE. It Tled 7 times in contest. I tried many approaches
eg submissions
https://codeforces.me/contest/1287/submission/68278756
https://codeforces.me/contest/1287/submission/68277154
Can someone tell why the first submission TLE on TC 10
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | jiangly | 3670 |
| 3 | Kevin114514 | 3657 |
| 4 | maroonrk | 3355 |
| 5 | Um_nik | 3353 |
| 6 | squareOf105 | 3346 |
| 7 | tourist | 3343 |
| 8 | strapple | 3324 |
| 9 | heuristica | 3322 |
| 10 | jiangbowen | 3291 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | AmShZ | 144 |
| 5 | Um_nik | 141 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 134 |
| 9 | maroonrk | 133 |
| 10 | qwexd | 130 |
don't use set "gone"
Yes it worked and thanks https://codeforces.me/contest/1287/submission/68282646
Yes, I had the same issue, I would say that having a set there is quite expensive. Remember than the complexity is logn => ~2, now multiply 30*2
getting same, but then made some changes
string str = str + "abs" is slower than str+="abs"
endl is slower than "\n"
used u-map instead of map
but i don't like the it, it should not be tle. author must check.