hex539's blog

By hex539, history, 6 years ago, In English

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.

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

| Write comment?
»
6 years ago, # |
  Vote: I like it +10 Vote: I do not like it

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.

»
6 years ago, # |
  Vote: I like it 0 Vote: I do not like it

How to solve C?

  • »
    »
    6 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    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:

  • »
    »
    6 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    There is actually a super nice and simple way. Simply make it shaped like this

    paint

    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.

»
6 years ago, # |
  Vote: I like it 0 Vote: I do not like it

When will the scoreboard be unfrozen?

»
6 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Does anyone know how many teams advance to the Finals? Just one?

  • »
    »
    6 years ago, # ^ |
    Rev. 2   Vote: I like it +11 Vote: I do not like it

    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.

»
6 years ago, # |
  Vote: I like it 0 Vote: I do not like it

How to solve J?