If String Hashing = valid, are heuristic valid sometimes to solve problems?

Правка en5, от JasonMendoza2008, 2024-08-02 18:58:06

For this problem https://mirror.codeforces.com/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://mirror.codeforces.com/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?

Теги heuristics

История

 
 
 
 
Правки
 
 
  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)