| # | 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 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 170 |
| 2 | Um_nik | 162 |
| 3 | maomao90 | 161 |
| 4 | atcoder_official | 160 |
| 5 | djm03178 | 158 |
| 5 | -is-this-fft- | 158 |
| 7 | adamant | 154 |
| 7 | Dominater069 | 154 |
| 9 | awoo | 152 |
| 9 | luogu_official | 152 |
Hey guys,
The following submission keeps getting TLE even though it has the same time complexity as the official solution ($$$\mathcal{O}(n)$$$)
Submission: https://mirror.codeforces.com/contest/1430/submission/104613827
Problem: https://mirror.codeforces.com/problemset/problem/1430/C
Any ideas about what's going on?
Java's Scanner is extremely slow; use BufferedReader instead.
I tried using BufferedReader but I still get TLE.
Submission: https://mirror.codeforces.com/problemset/submission/1430/104614811
Due to the large number of output lines, it turns out you also need to use PrintWriter for more efficient output. See here for an AC version.
Thank you so much, I've been banging my head on this for a while.