Hello, Codeforces!
We're going to host a new contest at csacademy.com. Round #41 will take place on Wednesday, 09/August/2017 15:00 (UTC). This contest will be a Div1 + Div2, with 7 tasks of varying difficulty that need to be solved in 2 hours.
We are glad to have legar as a problem author.
Prizes
We're going to award the same prizes as the previous Div. 1 + Div. 2 rounds:
- First place: 100$
- Second place: 50$
- One random prize, either 50$ or a custom CS Academy T-shirt, whichever the winner wants. :)
Contest format:
- You will have to solve 7 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.
If you find any bugs please email us at [email protected]
Don't forget to like us on Facebook, VK and follow us on Twitter.
Later Edit:
Congratulations to the winners:
And to the random prize winner, Vvalter!
Also, the editorial has been published. Hope you enjoyed the contest!
Finally, csacademy became the 2nd contributor! Congratulations!
The contest doesn't show up on clist. :/
We filed a bug on clist, thanks for reporting.
Just a reminder, the round starts in 4 hours.
How to solve "Add and Subtract"?
https://csacademy.com/contest/round-41/task/add-and-subtract/solution/
I asked the question in the comments but no reply. legar, please, can you explain how this can be done "a segment tree that allows to perform the operations of extraction of the minimum interval according to the formula shown above, and elimination of the extremes of this interval", or provide some useful links ?
I haven't read the solution for the last problem yet. Still, I already want to congratulate the author! The problem seemed really natural and the fact that solution exists is enough to make me love it. Congratulations, legar! The overall contest was great, too, but I enjoyed the most the time that I spent thinking of different solutions for the last one
Thanks!!!
How do you select random prize winner?
https://csacademy.com/code/XAuZvHQG