| № | Пользователь | Рейтинг |
|---|---|---|
| 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 | 156 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 10 | nor | 152 |
If String Hashing = valid, are heuristic valid sometimes to solve problems?
For this problem https://codeforces.me/gym/103708/problem/G, the "proper" way to solve it is to use Multi Dimensional Ternary Search.
If I were to solve it with random search (it passes: https://codeforces.me/gym/103708/submission/274048924 — very much easily), would this be considered a valid solution? I feel like saying no would invalidate the use of string / polynomial hashing but saying yes feels very much wrong.
What is the CP community opinion on this?
| Rev. | Язык | Кто | Когда | Δ | Комментарий | |
|---|---|---|---|---|---|---|
| en5 |
|
JasonMendoza2008 | 2024-08-02 18:58:06 | 1 | Tiny change: 'is to use Multi Dime' -> 'is to use [Multi Dime' | |
| en4 |
|
JasonMendoza2008 | 2024-08-02 18:57:56 | 2 | Tiny change: 'ary Search (https://c' -> 'ary Search](https://c' | |
| en3 |
|
JasonMendoza2008 | 2024-08-02 18:57:29 | 30 | ||
| en2 |
|
JasonMendoza2008 | 2024-08-02 18:56:15 | 25 | Tiny change: '/274048924), would t' -> '/274048924 - very much easily), would t' | |
| en1 |
|
JasonMendoza2008 | 2024-08-02 18:55:43 | 547 | Initial revision (published) |
