| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3690 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 163 |
| 4 | TheScrasse | 159 |
| 5 | nor | 157 |
| 6 | maroonrk | 155 |
| 7 | -is-this-fft- | 152 |
| 8 | Petr | 146 |
| 8 | orz | 146 |
| 10 | BledDest | 145 |
Hi everyone!
I would like to invite you to the Weekly Training Farm 19. The problem setter is tmt514 and the tester and quality controllers are dreamoon_love_AA and drazil.
It will be a contest in ACM-ICPC style and have difficulty similar to a Div.2 contest.
The contest begins at 20:00 UTC+8 and lasts two hours.
how many problems are there ??
5 probelms
Out of curiosity, when will the editorial come out? And is it that test data will be kept behind the scene? (really can't figure out why my super-clumsy segment tree solution for C gets TLE... XD)
Thanks in advance.
If you want the data, you can send private message to ask tmt514 to give you. By the way, out expected time complexity of problem C is O(n log n).
About editorial.... It's just like Codeforces rounds. We always can predict what time it will be present.
Thanks a lot. Hopefully I'd manage to resolve it myself before doing that :)