maroonrk's blog

AtCoder Regular Contest 130 Announcement
By maroonrk, history, 2 years ago, In English

We will hold AtCoder Regular Contest 130.

The point values will be 300-400-500-600-800-1000.

We are looking forward to your participation!

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

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

Good luck on this round!

→ Reply
»
2 years ago, # |
  Vote: I like it +29 Vote: I do not like it

It will be very hard.(as usual)

→ Reply
»
2 years ago, # |
  Vote: I like it +11 Vote: I do not like it

It is really hard to solve the problems!

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

If it exists, print the lexicographically smallest among such sequences A, in one line, with spaces in between.

WHAAAYYY???

→ Reply
»
2 years ago, # |
  Vote: I like it +10 Vote: I do not like it

First blood on E!

I'm surprised it got so few solutions. I just noticed that if we pick the last point where minimum increased (possibly before the first or after the last operation), then there's an obvious minimum sequence given by the maximum number of occurrences of any number in the input sequence before that point, and simulating validity when moving that point is sort of bruteforce-y.

→ Reply
»
2 years ago, # |
  Vote: I like it +5 Vote: I do not like it

Can anyone explain D to me in simple? I don't get the editorial :(

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

Yesterday, I always thought that I was greedy when I wrote C. Then I finally found out that wa had a point. Later, I found that there might be a carry option at this point, but we became 9, which made it impossible to carry. Then, there was no carry in 9, and it was right to judge whether it was possible to carry directly.

→ Reply
»
2 years ago, # |
  Vote: I like it +3 Vote: I do not like it

It'll be another hard round.

→ Reply