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://mirror.codeforces.com/contest/1287/submission/68278756
https://mirror.codeforces.com/contest/1287/submission/68277154
Can someone tell why the first submission TLE on TC 10
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 146 |
| 3 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
don't use set "gone"
Yes it worked and thanks https://mirror.codeforces.com/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.