__Apocalypse__'s blog

Help needed in DCPC 2015 problem

By __Apocalypse__, history, 4 years ago, In English

Hi, I implemented the problem 100883E - xortion using tries and am not able to figure out my mistake. Would appreciate if someone could help me out. Thanks in advance. Here is my submission 63671101

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

»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

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

→ Reply
»
4 years ago, # |
  Vote: I like it +1 Vote: I do not like it

The submission isn't visible, put your code on ideone.

→ Reply
»
4 years ago, # |
  Vote: I like it +1 Vote: I do not like it

I didn't look at your code, I just stresstested it. And it fails here:

1
2 1
38 38
3

It prints $$$2$$$ instead of $$$1$$$.

Did you read In case of many possible values of P , take the minimum. in the problem statement?

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

    Yeah I had missed out on that, but even after making that correct I'm not getting AC. Here is the modified submission. https://www.ideone.com/VqZDgb

    → Reply
    • »
      »
      »
      4 years ago, # ^ |
        Vote: I like it +1 Vote: I do not like it

      Separate testcases by a blank line. in the problem statement.

      You're not doing that correctly. Check with a test having $$$T = 2$$$

      → Reply