I applied mo's algorithm the recent cut and stick problem
My code takes 2823 ms While, to my surprise this takes 1326(its codeNcode's submission).
Both do almost the same thing, I don't see any difference other than using structs over tuples.
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | awoo | 158 |
4 | cry | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 152 |
10 | maroonrk | 151 |
does using tuples makes code slow(while structs are faster ?)
I applied mo's algorithm the recent cut and stick problem
My code takes 2823 ms While, to my surprise this takes 1326(its codeNcode's submission).
Both do almost the same thing, I don't see any difference other than using structs over tuples.
Name |
---|