Hi. Here's my solution for the latest div3 problem D : https://codeforces.net/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.
# | User | Rating |
---|---|---|
1 | tourist | 3857 |
2 | jiangly | 3747 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3591 |
6 | gamegame | 3477 |
7 | Benq | 3468 |
8 | Radewoosh | 3463 |
9 | ecnerwala | 3451 |
10 | heuristica | 3431 |
# | User | Contrib. |
---|---|---|
1 | cry | 165 |
2 | -is-this-fft- | 161 |
3 | Qingyu | 160 |
4 | Dominater069 | 158 |
5 | atcoder_official | 157 |
6 | adamant | 155 |
7 | Um_nik | 151 |
8 | djm03178 | 150 |
8 | luogu_official | 150 |
10 | awoo | 148 |
Hi. Here's my solution for the latest div3 problem D : https://codeforces.net/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.
Name |
---|
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!