dimriXD's blog

By dimriXD, history, 3 years ago, In English

Hello guys!

I am new to codeforces, I stumbled upon 230A problem and my code is here. My basic idea was to create a list of list containing three things first->strength of dragon, second->bonus points, third->flag if this dragon is killed or not. Then I sorted according to bonus points and started incrementing kills if a dragon could be killed based on condition.

Please help if there is a flaw in my logic or I missed something in the code. I shall be really thankful to you. Please help.

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

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

Sort according to dragon's strength. Check each time whether the player's new strength is greater than that of next dragon. If yes, update player's strength and repeat. Else, output no.

  • »
    »
    3 years ago, # ^ |
    Rev. 5   Vote: I like it 0 Vote: I do not like it

    thanks for replying, I hope I am doing the same in the code except for one thing(sort according to dragon's strength), if you got time would you please check out the code link? If I sort according to dragon's strength then won't it create a problem like:

    - 3 4
    - 1 0
    - 1 0
    - 1 0
    - 2 3
    

    this is sorted according to dragon's strength then the answer would be 'no'? In other case we can kill dragon with strength 2 and get bonus of 3 and then kill all dragons? Answer would be 'yes' isn't it? Am I missing something?

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

      The player's strength is already greater than 1 and 2. So all the dragons will be defeated straight away.

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

        Thanks, initially I thought if bonus is 0 then we need to subtract strength of the hero, my bad, thanks for helping!

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

Why we need sorting here please ?

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

    Because Kirito first needs to fight the dragon that has the least strength to gain his strength, and then fight other dragons.

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

We need to make a pair of vectors and then sort one of them. The other vector would be sorted accordingly. You can see my submission to the problem, it may help. Submission

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

I am failing test case #6:

2 2
3 5
1 2

"wrong answer 1st words differ — expected: 'YES', found: 'NO'"

Why the expected answer is YES when Kirito's initial strength is smaller that every dragon?

Thanks in advance!

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

    Kirito's initial strength is 2. This is larger that the second dragon's strength, which is 1. You might want to reread the input format.

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

      Thank you! My bad. I was parsing incorrectly the input :)

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

      This is my solution for this problem: https://ideone.com/4QwCwt I used map to solve it. I really don't see anything wrong in it and it should work but I constantly keep getting wrong answer on test case 10. Can someone help please?

      • »
        »
        »
        »
        9 days ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        The thing about hashmap is that it needs unique key. So if test case has two dragons with same strength,hashmap will fail

        • »
          »
          »
          »
          »
          9 days ago, # ^ |
            Vote: I like it 0 Vote: I do not like it

          Yep, got it a long time ago, but thanks anyways.

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

My 104218672 is falling in test case 9.

I think it should be YES, but the judge says that it is NO, can someone explain to me why is this NO?