| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 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 |
In my icpc regionals they put this problem (link below), but no one came up with a correct solution that runs in time. Does anyone know a solution? The time limit is 60 seconds.
Do you think it can be solved in time? The official solution is a silly heuristic and it is easy to find test cases to make it give wrong answer.
http://localdoc.scusa.lsu.edu/problems-regional/prb.php?prob=10
Auto comment: topic has been updated by PeterNaut (previous revision, new revision, compare).
What is the time limit(as you mentioned, run in time)?
You have 60 seconds per input (but each input can contain up to 100 cases)
Auto comment: topic has been updated by PeterNaut (previous revision, new revision, compare).
Auto comment: topic has been updated by PeterNaut (previous revision, new revision, compare).