Hello, Codeforces!
We are going to host a new contest at csacademy.com. Round #50 will take place on Wednesday, September/26/2017 15:00 (UTC). This round will be a Div. 2, affecting users with a rating below 1675.
Contest format:
- You will have to solve 5 tasks in 2 hours.
- There will be full feedback throughout the entire contest.
- Tasks will not have partial scoring, so you need to pass all test cases for a solution to count (ACM-ICPC-style).
- Tasks will have dynamic scores. According to the number of users that solve a problem the score will vary between 100 and 1000.
- Besides the score, each user will also get a penalty that is going to be used as a tie breaker.
About the penalty system:
- Computed using the following formula: the minute of the last accepted solution + the penalty for each solved task. The penalty for a solved task is equal to log2 (no_of_submissions) * 5.
- Solutions that don't compile or don't pass the example test cases are ignored.
- Once you solve a task you can still resubmit. All the following solutions will be ignored for both the score and the penalty.
Don't forget to like us on Facebook, VK and follow us on Twitter.
Just a reminder, the round starts in 6 hours.
D question is exact same as this question: (Just the inputs are changed)
Problem
We didn't know about that task, or else we would have changed it. Both problems are a version of the longest increasing subsequence, which is a relatively classic problem.