lucifer1004's blog

By lucifer1004, history, 4 years ago, In English

中文题解

1437A - Marketing Scheme

Hint
Solution
Code (Python 3)

1437B - Reverse Binary Strings

Hint
Solution
Code (Python 3)

1437C - Chef Monocarp

Hint
Solution
Code (Python 3)

1437D - Minimal Height Tree

Hint
Solution
Code (C++)

1437E - Make It Increasing

Hint
Solution
Code (C++)

1437F - Emotional Fishermen

Hint
Solution
Code (C++)

1437G - Death DBMS

Hint
Solution
Code (C++)
  • Vote: I like it
  • +147
  • Vote: I do not like it

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

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

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

Nice job but can you tell me why time max = 2*n for question c ?

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

    Because $$$a[i]\leq n$$$, suppose that we put out the first oven at $$$t=n$$$, then the last oven can be put out at $$$t=2n-1$$$. We will never use $$$t>2n$$$ because we can always reduce the total unpleasant values by replacing it with a smaller time.

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

can you explain solution for C in more detail please.

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

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

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

thx a lot!

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

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

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

G is just a template problem if you use SAM.