vipulmadan31's blog

Edge Case in DP Problem Dima and a Bad XOR
By vipulmadan31, history, 5 months ago, In English

Hi, I am facing in the problem Dima and a bad XOR link to the problem. This is my submission link to submission.

I request you to help me identify what I am doing wrong. Thank you.

  • Vote: I like it
  • +3
  • Vote: I do not like it

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

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

→ Reply
»
5 months ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

It seems like your code doesn't work for the case, where all integers are equal, and n is odd.

My suggestion is first pick first element from every row, then if the XOR of those is 0, try to find any different number from the 1st in any of the rows. Let's look at an example:

2 3
1 1 1
1 1 2

You first choose 1 and 1, as they stand first in the rows. 1 XOR 1 = 0. Then, for each row you search for a different element, in this case you will end up choosing 2.

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

    Thank you. I have figured there is some fault in how the XOR value is calculated. I will try some other approach.

    → Reply