This was my submission 256491105. Can somebody explain to me why this solution gives TLE?
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
8 | ecnerwala | 3494 |
9 | Um_nik | 3396 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | -is-this-fft- | 162 |
3 | maomao90 | 159 |
3 | atcoder_official | 159 |
5 | cry | 158 |
5 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | Dominater069 | 152 |
This was my submission 256491105. Can somebody explain to me why this solution gives TLE?
Name |
---|
You’re making an array of size $$$2e5+1$$$ for every test case and there are like $$$10^4$$$ tests. Instead you should’ve made the array of size $$$n+1$$$, and then proceeded with whatever you’re doing (this will get rid of the TLE)
Thank you!
But if i send it in C++20 it works 256544470
Do you know what could be the difference?
That is really strange. I don’t know why this happens; I’d expect it to TLE as well
the problem could be solved easily by counting number of cards having 2 ouccrences to get max score optimally . and your tle problem is solved by the guy before me
because u use (2e5+1) * (10^4) and this it too large, u can use map<int, int> instead