Hi. Here's my solution for the latest div3 problem D : https://codeforces.me/contest/1385/submission/87172064
can somebody please help why it gets TLE? I checked my solutions with some accepted ones and the idea was the same.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 156 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
10 | nor | 152 |
Hi. Here's my solution for the latest div3 problem D : https://codeforces.me/contest/1385/submission/87172064
can somebody please help why it gets TLE? I checked my solutions with some accepted ones and the idea was the same.
Название |
---|
Most likely trying to
memset
f
every test case is causing the TLE. If there are 20,000 test cases and you set 200,000 * 26 ints each test you'll run out of time.but it's said that some of n does not exceed 2 * 10 ^ 5. did you notice?
Sorry. I got what you said. Thanks in advance!