Getting TLE on test case 8 for [this problem](https://codeforces.net/problemset/problem/1295/C). I read the editorial which had O(n) complexity. [My soln](http://https://codeforces.net/problemset/status?friends=oncontest/1295/submission/85271178) has a complexity of O(n *log n) but as n has an upper bound of 2e5 it should pass right (if it is correct)?↵
→ 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
time limit exceeded
Difference between en1 and en2,
changed 45 character(s)
History
Revisions
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
AbhishekAg | 2020-06-28 12:35:51 | 45 | ||
| en1 |
|
AbhishekAg | 2020-06-28 11:48:03 | 343 | Initial revision (published) |
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Dec/23/2024 03:02:51 (i1).
Desktop version, switch to mobile version.
Supported by
