This weekend, once again, we'll run a parallel online contest for the 2018-2019 North-Western Europe Regional Contest (NWERC). The live contest will be held at the Eindhoven University of Technology in The Netherlands.
The online contest takes place on 25 November 2018 at 10:30 CET with the competition lasting for 5 hours. You can register for the online mirror contest here:
https://open.kattis.com/contests/nwerc18open
Solution sketches and problem archives will become available for download on the official website after the online contest ends.
Reminder that this happens on Sunday, 25 November 2018 at 10:30 CET.
We're going to publish the scoreboard for the live contest at http://www.nwerc.eu/scoreboard.
How to solve C?
The prettiest way: Draw the tree radially from (0,0). To space the vertices out enough, assign each child node a sector proportional to the number of nodes in its subtree. And then do the same thing recursively.
It looks something like this:
There is actually a super nice and simple way. Simply make it shaped like this
using dfs on the tree. It is even possible to place every node a y coordinate + 1/1000 over the previous node in the dfs ordering.
Your image is bad and you should feel bad.
When will the scoreboard be unfrozen?
Does anyone know how many teams advance to the Finals? Just one?
Last year 5 teams from NWERC advanced, in previous years it was 4.
EDIT: That's not entirely true, it seems there were 4 in 2016, 3 in 2017 and 5 in 2018.
How to solve J?