There this task 1670B - Dorms War, which has an O(n) solution. Isn't my 238883260 optimal as well? It keeps getting TLE's on 35th test :/ No idea how to optimize it really
# | User | Rating |
---|---|---|
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 |
# | User | Contrib. |
---|---|---|
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 |
There this task 1670B - Dorms War, which has an O(n) solution. Isn't my 238883260 optimal as well? It keeps getting TLE's on 35th test :/ No idea how to optimize it really
Name |
---|
Use fast input Paste this into your code ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); this is a quick input to c++
Here is the package with quick input code
thanks, worked! Are there any downsides of these lines though?
I think there are no disadvantages,you can read what these lines do:blog
If you remove endl from the code, your program will speed up.