This was my submission 256491105. Can somebody explain to me why this solution gives TLE?
# | User | Rating |
---|---|---|
1 | tourist | 3757 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 171 |
2 | awoo | 165 |
3 | adamant | 164 |
4 | TheScrasse | 159 |
5 | nor | 155 |
5 | maroonrk | 155 |
7 | -is-this-fft- | 152 |
8 | Petr | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
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