| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | orzdevinwang | 3844 |
| 3 | jqdai0815 | 3682 |
| 4 | jiangly | 3618 |
| 5 | Benq | 3529 |
| 6 | ksun48 | 3489 |
| 7 | Radewoosh | 3483 |
| 8 | Kevin114514 | 3443 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | atcoder_official | 162 |
| 3 | maomao90 | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 155 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 10 | djm03178 | 152 |
Hi! I was reading the problems of WF 2015 and I noticed that the time limit is HUUUGE, for example this https://icpc.kattis.com/problems/tiles
Why is it so much big? I know that there are many test cases in just one input, but I have seen the same in other problems from WF 2015 that have only one test per input.
I just want an answer, please don't downvote without explaining why.
The bigger time limits are, the bigger can limitations be. Then we can distinguish solutions better.
needed.
You have probably heard that polynomial solutions are better than exponential. Oh really? n should be up to 60 to prove that O(n10) soltuion is better than O(2n). But both solutions will work almost infinitely on such an input. If we could set TLs like 1 year, it will be almost impossible to sqeeze O(n2) solutions when
Thanks for explanation!