I have made a submission to problem — 1398G - Соревнования по бегу My submission — 90009972
According to me, it's time complexity is O(n^2 / 32) and n is 2*10^5. Then why it's not TLE? or am I calculating the time complexity wrong?
# | User | Rating |
---|---|---|
1 | tourist | 3845 |
2 | jiangly | 3707 |
3 | Benq | 3630 |
4 | orzdevinwang | 3573 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3532 |
8 | ecnerwala | 3501 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 171 |
2 | adamant | 163 |
3 | awoo | 161 |
4 | nor | 152 |
4 | maroonrk | 152 |
6 | -is-this-fft- | 151 |
7 | TheScrasse | 149 |
8 | atcoder_official | 145 |
8 | Petr | 145 |
10 | pajenegod | 144 |
Query regarding time complexity of the solution
I have made a submission to problem — 1398G - Соревнования по бегу My submission — 90009972
According to me, it's time complexity is O(n^2 / 32) and n is 2*10^5. Then why it's not TLE? or am I calculating the time complexity wrong?
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en1 |
![]() |
Sad_reacts_only | 2020-08-15 18:10:17 | 295 | Initial revision (published) |
Name |
---|