Plss tell me how to determine the time complexity of a solution which can get accepted by looking at the constraints of the problem. Plss help!!!
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3947 |
2 | jiangly | 3734 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | ecnerwala | 3581 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | ksun48 | 3479 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | awoo | 162 |
2 | maomao90 | 160 |
3 | nor | 156 |
4 | cry | 155 |
4 | adamant | 155 |
4 | atcoder_official | 155 |
4 | -is-this-fft- | 155 |
8 | maroonrk | 153 |
9 | Petr | 146 |
10 | SecondThread | 144 |
Plss tell me how to determine the time complexity of a solution which can get accepted by looking at the constraints of the problem. Plss help!!!
Название |
---|
here:
laughs in Ashishgup
Lol. I've gotten quite a few comments/messages regarding the low constraints — and this is the exact reason I choose to keep them that way.
Constraints shouldn't be a hint towards the solution, and unless there is some obvious brute solution that passes with lower constraints — I choose to keep them that way.
Also allows different (non-brute) approaches.