chrome's blog

Topcoder Open Algorithm Round 1C 2016
By chrome, 9 years ago, translation, In English

Hi!

Tomorrow at 14:00 MSK will be held TCO16 Round 1C.

You can read about TCO16 here.

Also this round has limited number of competitors only 2500. And max number of advancers to the next stage is 750.

Let's discuss problems after contest.

GL && HF!!!

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

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

Hints for solving 500 Pointer Problem please????

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

    You can use a dp or a greedy solution. Let me know if you need more hints?

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

      Describe please both of them

      → Reply
      • »
        »
        »
        »
        9 years ago, # ^ |
        ← Rev. 3   Vote: I like it +8 Vote: I do not like it

        In DP state, keep record for :
        1. current day
        2. the person who worked on the previous day
        3. the person worked the day before the previous day
        4. days for which Alice has already worked
        5. days for which Bob has already worked
        You do not need the days for which the third person has worked since that is fixed and dependent on point 1,4,5.
        Now for each day try assigning the work to all the three people, if possible, and pick the one which gives a possible solution.

        → Reply