ikatanic's blog

CERC 2017 Warm up contest
By ikatanic, history, 7 years ago, In English

On Saturday, 11 November 2017 09:00CET the organizers of the Central Europe Regional Contest will host the 'CERC 2017 Warm up!' online contest. The primary goal of the contest is to provide the CERC teams an additional opportunity to practice and familiarize themselves with the Evaluation System to be used at this year's CERC. All CERC teams are strongly encouraged to participate, all other teams (or individuals) are welcome to participate as well.

The contest will last for 5 hours and be conducted under the standard ACM ICPC rules (supported languages are C, C++, Java and Python). The problemset will feature 10-12 problems selected from the previous Croatian ICPC and highschool contests.

The Evaluation System will be available at http://cerc-warmup.hsin.hr/.

If you are not an official CERC team, you need to register through the Evaluation System at least one hour before the contest starts in order to participate. Registration opens on Friday, 10 November 2017 08:00CET and closes on Saturday, 11 November 2017 08:00CET..

The CERC 2017 organizing committee.

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

Comments Comments (6)
| Write comment?
»
7 years ago, # |
  Vote: I like it 0 Vote: I do not like it

How to solve D? I have only 2^20*50*20 solution.

→ Reply
»
7 years ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

When will the final result be published?

Edit: It has been published about 15 minutes after contest ends.

→ Reply
»
7 years ago, # |
  Vote: I like it +8 Vote: I do not like it

How to solve problem H and L?

→ Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it +8 Vote: I do not like it

    H: It turns out that the shortest path from one point to another one will always involve at most 2 directions and an additional one for at most one step. It's then possible to try out O(n2) meeting points which gives us O(n3 d3).

    I also had an alternative solution which I wasn't able to prove but we couldn't break it: if we look at costs of all the feasible meeting points with a fixed parity of x coordinate, and a fixed parity of y coordinate then the optimal one will be 2d-ternary-searchable. That gives us O(n (logM)2 d3) where M is coordinates range.

    L: http://hsin.hr/2009/final/second_day/solutions.zip; task dvapravca

    → Reply
»
7 years ago, # |
  Vote: I like it +5 Vote: I do not like it

You've just closed the contest. Will it be possible to upsolve problems later? I think that I finally found my bug in one of my codes...

→ Reply
»
7 years ago, # |
  Vote: I like it +18 Vote: I do not like it

Will there be an online version of CERC 2017 (just like the warmup-contest for unofficial users)?

→ Reply