Codeforces and Polygon may be unavailable from December 6, 19:00 (UTC) to December 6, 21:00 (UTC) due to technical maintenance. ×

2020's blog

Problem D from 609 div2
By 2020, history, 5 years ago, In English

https://mirror.codeforces.com/blog/entry/72358 not able to to understand explanation for 1269D specially this line "I claim that the Young diagram can be partitioned into domino if and only if the number of white cells inside it is equal to the number of black cells inside it."

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

Comments Comments (2)
| Write comment?
»
5 years ago, # |
  Vote: I like it 0 Vote: I do not like it

So one domino will involve 1 white cell and 1 black cell. So if a Young diagram can be partitioned into domino (every piece included in a domino) then the number of white cells are equal to the number of black cells (and equal to the number of dominos)

Sorry for my bad English! <3. P/s: Have a great Christmas!!

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

    and how do u prove that minimum of white and black cells is best solution i mean how do we know that this chess board analogy will work i am not able to get the intution

    → Reply