| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3803 |
| 2 | jiangly | 3707 |
| 3 | Benq | 3627 |
| 4 | ecnerwala | 3584 |
| 5 | orzdevinwang | 3573 |
| 6 | Geothermal | 3569 |
| 6 | cnnfls_csy | 3569 |
| 8 | Radewoosh | 3542 |
| 9 | jqdai0815 | 3532 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | awoo | 163 |
| 1 | maomao90 | 163 |
| 3 | adamant | 161 |
| 4 | maroonrk | 152 |
| 5 | -is-this-fft- | 151 |
| 6 | nor | 150 |
| 7 | atcoder_official | 147 |
| 7 | SecondThread | 147 |
| 9 | TheScrasse | 146 |
| 10 | Petr | 145 |
problem link:https://codeforces.net/contest/1352/problem/E
sol link with vctor :https://codeforces.net/contest/1352/submission/214450956
sol link with map :https://codeforces.net/contest/1352/submission/214450292
your valuable opinion will surely help others who's are like me. and if does not make any sense than please comment section is available, i will delete it.
While using vector your time complexity is approximately : O((n^2).1) = O(n^2) , and in case of map it is: O((n^2).log(n)) (since accessing time in map is O(log(n))) . N is given max 8000, so for vector TC: 6.4 X 1e7 and in case of map its 8.3 X 1e8, so solution using the map is bound to give TLE here.
exactly, being a newbie i didnt think for a sec, then i realize how it leads me to tle, for further solving any problem i will keep it in my mind, thanks for the calculated explanation.