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!!!
# | User | Rating |
---|---|---|
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 |
# | User | Contrib. |
---|---|---|
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 | Dominater069 | 154 |
8 | awoo | 154 |
10 | luogu_official | 150 |
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!!!
Name |
---|
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.