| № | Пользователь | Рейтинг |
|---|---|---|
| 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 | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
Hack limit
Hi!
In Codeforces Round #407 (Div. 2) problem A,the worst case input was bigger than 256kb.
But there were some deque sources,and one particular source(http://mirror.codeforces.com/contest/789/submission/25911140) which instead of subtracting k,it subtracted 2k,and this was no longer TLE for the worst case that this limit allowed.
I think that for some problems the limit should be increased.What do you think about this situation?
| Rev. | Язык | Кто | Когда | Δ | Комментарий | |
|---|---|---|---|---|---|---|
| en2 |
|
georgerapeanu | 2017-03-30 06:33:46 | 83 | ||
| en1 |
|
georgerapeanu | 2017-03-29 21:15:52 | 445 | Initial revision (published) |
