Kefa and Park problem: stuck in a test case that I can't trace

Правка en2, от Shadi_Bahaa, 2021-08-05 22:43:45

Hi!

I tried to solve this problem using BFS technique, and it seems that my code has passed test cases of huge number of inputs. However, it didn't pass the test case number 12. I don't know what is the fault I fell in it, because I can't trace this test case as it contains huge number of inputs and at the same time not completely shown. If someone can find the logical problem in my code, I hope to tell me what it is.

Problem: https://mirror.codeforces.com/problemset/problem/580/C

My solution: https://mirror.codeforces.com/contest/580/submission/124986838

Edit (the correct code):

The problem was in pushing the nodes that passed the number of consecutives positions of cats m. The correct submission is here after one of the users found the problem, thanks to him!

corrected submission: https://mirror.codeforces.com/contest/580/submission/124994493

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский Shadi_Bahaa 2021-08-05 22:43:45 298
en1 Английский Shadi_Bahaa 2021-08-05 21:11:20 618 Initial revision (published)