aman_naughty's blog

By aman_naughty, history, 7 months ago, In English,

Why does this solution fail at test 21 ?? code : 51444038. and this solution gives AC though code : 51444907 . Aren't the two doing the same thing??

 
 
 
 
  • Vote: I like it
  • 0
  • Vote: I do not like it

»
7 months ago, # |
  Vote: I like it +3 Vote: I do not like it

If they would have been the same, then it wouldn't have failed on 21.

  • »
    »
    7 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Can you help me matcoder without an 'h'??

    • »
      »
      »
      7 months ago, # ^ |
        Vote: I like it +3 Vote: I do not like it

      I am sorry, but I tried to look at the codes. The only thing I found that would result in Wrong Answer is that no function in the second code has been called recursively (which may cause local flags to be set only once) and there are two conditions while checking (only 1 in the first code).
      Not sure though. But I'll have a closer look at it again if the query persists after a day too.

      • »
        »
        »
        »
        7 months ago, # ^ |
          Vote: I like it +3 Vote: I do not like it

        The two conditions in 2nd code are analogous to one condition in 1st code as s and p are connected and c==p case is handled as there is no self edge.

»
7 months ago, # |
  Vote: I like it 0 Vote: I do not like it

That is why I need help

»
7 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Anyone out there??

»
7 months ago, # |
  Vote: I like it 0 Vote: I do not like it

help please???

»
7 months ago, # |
  Vote: I like it 0 Vote: I do not like it

If you want help, write nice code with comments and meaningful variable names. And explain your solution.

Your two solutions differ a lot. In your WA solution, you only consider edges $$$(p, s)$$$ that belong to some spanning tree. In other words, you don't go through all edges $$$(p, s)$$$. Note that there are $$$M$$$ edges while DFS function will run only $$$N$$$ times in a connected graph.