This was my submission 256491105. Can somebody explain to me why this solution gives TLE?
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 146 |
| 3 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
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