AriaB's blog

Problem in 478C — table decoration
By AriaB, history, 6 years ago, In English

Hi, I Don't know why my code doesn't work on this problem.

The problem:

478C - Table Decorations

This is my code: 54271051

  • Vote: I like it
  • -11
  • Vote: I do not like it

»
6 years ago, # |
  Vote: I like it +1 Vote: I do not like it

there will be many more case according to your solution

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

    https://mirror.codeforces.com/contest/478/submission/54276055 the logic is this plain and any other logic will have multiple sub-cases

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

      Can you explain about your solution.

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

        Observe that balloon of smallest and 2nd smallest type can always be used so either the 3 would be in comparable amounts such that they can be grouped in 3 in triples of (1,1,1) or (1,2,0) and similar. the extra ballon which cannot be mixed is left out. the only case where its not possible is when the balloon of largest type is extra. the worst case is when you take one ballon of smallest and mix it with two of largest. similarly you take 1 of middle size and 2 of largest. this will lead to ans as (smaller + 2nd smaller balloons). now the answer would be the minimum of two according to the above conditions

        → Reply