| № | Пользователь | Рейтинг |
|---|---|---|
| 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 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 155 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 10 | djm03178 | 152 |
15453721 2016-01-20 16:18:12 Los_Angelos_Laycurse D — Dining Room MS C++ Accepted 2464 ms 24600 KB
http://codeforces.me/gym/100863
spend three days on this egg hurt(chinglish) problem.
complexity : (N*Q^2*log(N)) notice :this is log(N) not log(N)^2
with very very very very very very very very heavily optimizition..
author's solution for this task got accepted in 300-400 ms and 4kb memory, maybe you solve this with another complexity
I know I have used brute force,but I have no idea with other ideas,I hope mike update this problem TL 1s, I continue to optimize brute force..
no, i think, mike and me will not change time limits in tasks of this gym or another gyms. (sorry for bad english)