Peace_789's blog

By Peace_789, history, 8 months ago, In English

Hey guys...

Recently I was solving this problem from CSES.

Here is what I have tried...

My idea

By implementing this idea , I am getting WA in one TC ( Out of 11 ).

You can find my code here.

code

So , can someone point out what am I doing wrong or any cases that I am missing.

Thanks in advance :)


UPD

As pwild sir pointed out , I was missing that cases.

To overcome that , I just added small logic to my code and it got ACCEPTED.

If you want to see code...

accepted code
 
 
 
 
  • Vote: I like it
  • +6
  • Vote: I do not like it

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

Auto comment: topic has been updated by Peace_789 (previous revision, new revision, compare).

»
8 months ago, # |
  Vote: I like it +1 Vote: I do not like it

I did not check if this is what you actually do in your code, but erasing one edge in every cycle is not correct: a node that is not on the cycle can reach all nodes on the cycle, but for some of them this may require passing over the erased edge.

  • »
    »
    8 months ago, # ^ |
    Rev. 2   Vote: I like it 0 Vote: I do not like it

    Thank you for replying sir...

    As you pointed out , I was missing that case ):

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

Auto comment: topic has been updated by Peace_789 (previous revision, new revision, compare).

»
7 weeks ago, # |
Rev. 2   Vote: I like it 0 Vote: I do not like it

I recently stumbled upon this problem. Found this blog helpful. My code (Tried to code as simple as possible)

Here