A story about my Grakn Forces F solution

Правка en4, от gop2024, 2020-10-01 13:58:15

Actually, the solution to the Grakn Forces F problem seems pretty easy, but somehow I didn't come up with the intended one. I wrote some solution making $$$O(n \cdot log^2(n))$$$ queries in the worst case, which I actually didn't even seriously suppose to pass.

After the contest, I run the stress and it turned out that the solution fails in plenty of tests (around $$$1000$$$ numbers specifically).

It would definitely be caught if the number of tests was greater. It seems that there are not more than $$$10$$$ tests that pretend to be random (except very small numbers and very large numbers that I tested by myself). So my question is — what is the reason for this number to be so small?

I believe that tests must distinguish proper solutions and some shit like this that works very sometimes if it's possible. I understand the point that sometimes it's hard to generate tests, but here we just needed to have only a sufficient number of random tests to hack my solution, but definitely more than $$$10$$$. Here I have ~$$$50$$$ % chance to pass, what actually happened.

300iq, what is your opinion?

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en6 Английский gop2024 2020-10-01 17:59:19 10
en5 Английский gop2024 2020-10-01 15:08:14 17 Tiny change: 'ce to pass, what ac' -> 'ce to pass these $10$ tests, what ac'
en4 Английский gop2024 2020-10-01 13:58:15 1 Tiny change: 't log^2(n)$ queries' -> 't log^2(n))$ queries'
en3 Английский gop2024 2020-10-01 13:56:59 13 Tiny change: 'estion is $"---$ what is t' -> 'estion is - what is t'
en2 Английский gop2024 2020-10-01 13:56:44 2 Tiny change: 'estion is "--- what is t' -> 'estion is $"---$ what is t'
en1 Английский gop2024 2020-10-01 13:55:21 1174 Initial revision (published)