| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3803 |
| 2 | jiangly | 3707 |
| 3 | Benq | 3627 |
| 4 | ecnerwala | 3584 |
| 5 | orzdevinwang | 3573 |
| 6 | Geothermal | 3569 |
| 6 | cnnfls_csy | 3569 |
| 8 | Radewoosh | 3542 |
| 9 | jqdai0815 | 3532 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | awoo | 163 |
| 2 | maomao90 | 162 |
| 3 | adamant | 161 |
| 4 | maroonrk | 152 |
| 5 | -is-this-fft- | 151 |
| 6 | nor | 150 |
| 7 | atcoder_official | 147 |
| 7 | SecondThread | 147 |
| 9 | TheScrasse | 146 |
| 10 | Petr | 145 |
15453721 2016-01-20 16:18:12 Los_Angelos_Laycurse D — Dining Room MS C++ Accepted 2464 ms 24600 KB
http://codeforces.net/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)