I've been solving 1311C - Perform the Combo and when i used memset I received TLE 73574138 but when I changed to iterative method I received AC 73575826. This is not the first time happening. What the reason behind this?
# | User | Rating |
---|---|---|
1 | jiangly | 3976 |
2 | tourist | 3815 |
3 | jqdai0815 | 3682 |
4 | ksun48 | 3614 |
5 | orzdevinwang | 3526 |
6 | ecnerwala | 3514 |
7 | Benq | 3482 |
8 | hos.lyric | 3382 |
9 | gamegame | 3374 |
10 | heuristica | 3357 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | -is-this-fft- | 165 |
3 | Um_nik | 161 |
3 | atcoder_official | 161 |
5 | djm03178 | 157 |
6 | Dominater069 | 156 |
7 | adamant | 154 |
8 | luogu_official | 152 |
9 | awoo | 151 |
10 | TheScrasse | 147 |
I've been solving 1311C - Perform the Combo and when i used memset I received TLE 73574138 but when I changed to iterative method I received AC 73575826. This is not the first time happening. What the reason behind this?
Name |
---|
Every time you use memset with the third parameter $$$sizeof(a)$$$, it fills the whole array (or matrix) with corresponding values. But because the number of test cases in this problem can be up to $$$10^4$$$, you can fill up $$$10^4 \cdot 2 \cdot 10^5 \cdot 26 = 52 \cdot 10^9$$$ elements in the worst case. Despite the fact that memset is a very fast function, $$$52$$$ billion is a huge number of operations. But when you fill up all values iteratively, you can be sure that you will do this at most $$$\sum n \cdot 26$$$ times (i.e. $$$2 \cdot 10^5 \cdot 26 = 5.2 \cdot 10^6$$$ times.
Thank you, didn't think of that