This submission gives MLE for using vectors of size 5e6. Why is that?
I am using binary search with lazy propagation so my algorithm runs in O(q * log(n) * log(n)).
Why should this be a problem?
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 150 |
→ Find user
→ Recent actions
Why does lazy propogation give TLE/MLE for Problem D
Revision en3, by Mikemirzyanov1, 2020-05-17 14:19:58
History
Revisions
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en3 |
|
Mikemirzyanov1 | 2020-05-17 14:19:58 | 0 | (published) | |
| en2 |
|
Mikemirzyanov1 | 2020-05-17 14:15:41 | 10 | ||
| en1 |
|
Mikemirzyanov1 | 2020-05-17 14:15:05 | 272 | Initial revision (saved to drafts) |
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Dec/23/2024 04:12:54 (k1).
Desktop version, switch to mobile version.
Supported by
