In submission 329853944 I got TLE for an answer that has O(2*1e5) can someone help??
| № | Пользователь | Рейтинг |
|---|---|---|
| 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 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 4 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
In submission 329853944 I got TLE for an answer that has O(2*1e5) can someone help??
| Название |
|---|



ios_base::sync_with_stdio(0); cin.tie(0);for not adding this I thinkThanks for the help! After adding that I got it AC
Even though the algorithm runs in O(n) time, it may still exceed the time limit if there's a large volume of input or output. In such cases, the program's runtime isn't due to computation but rather the slowness of standard input/output operations (cin/cout). To avoid this, we use fast I/O techniques to reduce the overhead of reading and writing data, ensuring that time is spent on actual computation rather than I/O.
Just add this in your solve function : cin.tie(nullptr)->sync_with_stdio(false);
Thanks for the help! And the explanation
same thing happened to me
Oof even an expert