DoNtTellMeWhatToDo's blog

By DoNtTellMeWhatToDo, 5 months ago, In English,

Can someone share the results, please?

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

»
5 months ago, # |
  Vote: I like it 0 Vote: I do not like it
»
5 months ago, # |
  Vote: I like it 0 Vote: I do not like it

can anyone open the link given in the pic?!

»
5 months ago, # |
  Vote: I like it +1 Vote: I do not like it
»
5 months ago, # |
  Vote: I like it 0 Vote: I do not like it

There are more participants in the CMS ranking but less in the official site. Which of them will be considered while dividing medals?

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

    In CMS rating is all participant (official and non-official), while official site count only official participants. Medal will be given to official ones

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

      Do they follow the general rule? I mean dividing like 1/12 gold, 1/6 silver, and 1/4 bronze medals.

»
5 months ago, # |
  Vote: I like it +11 Vote: I do not like it

What is the official solution for E? I solved it onsite with dp and lazy segtree, but the number of solves confused me (in our team's opinion there were easier problems that were solved less), so I wonder if there is an easier solution.

  • »
    »
    5 months ago, # ^ |
      Vote: I like it +5 Vote: I do not like it

    Convert the problem to the following dp:

    DP[position][answer] — maximum position j, such that the last jump was the interval [j; position] and the number of jumps was answer.

    To get we will have the obvious transition from DP[pos] to DP[pos+1] (the values can stay the same) and we also will have additional transitions. We will just binary search on partial sums to find the closest position to the right, such that we can jump to it and increase the answer in the state. This way we have O(N) transitions for each position.

    We can easily make the state have O(N) by not keeping the position. Now the only last observation is that we only need to consider the largest/last 2 values in the dp and do binary search for them only. This way we get solution.

  • »
    »
    5 months ago, # ^ |
      Vote: I like it +6 Vote: I do not like it
    hint1

    P.S sorry for my poor English