saketh's blog

Invitation to join the 5th ProgNova Programming Contest (2020)
By saketh, history, 4 years ago, In English

We cordially invite the Codeforces community to participate in the 5th ProgNova Programming Contest, which will take place next Friday, February 7, 5-8pm EST. The contest will be hosted online on Kattis and feature an original problemset.

Problems have been prepared and tested by yubowenok, szfck, zapray, Sotskin, zpl1, MRain, and saketh. The contest will be harder than a typical ICPC North American regional, but easier than a typical ICPC World Finals. We hope this will in particular provide a good warmup opportunity for contestants competing in the 2020 ICPC North America Championship. The problem-set is designed to offer something to all levels of competitive programmers.

All students enrolled in North American universities are welcome to participate in the North America Division and compete for prizes. All others are welcome to join the Open Division and win raffles.

 Prizes are sponsored by BlindData.

Registration via the contest website is required and must be completed by Wednesday, February 5, 11:59pm EST. Participation is individual.

If you have any questions, feel free to ask me or email [email protected].

We look forward to seeing you at the contest!!

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

»
4 years ago, # |
  Vote: I like it +5 Vote: I do not like it

Thanks also to dinosaurs and agural for some discussion of problems.

→ Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Registration closes tomorrow!

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

The registration has closed, you may still participate unofficially at the contest mirror.

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

Your script is buggy. You forgot to shuffle arrays na_solve2 and open_solve2. Also, you have small implementational bug. In Python, you cannot use random.shuffle on filter object. So, you should transform it to list previously.

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

    Thanks for catching! We have fixed it. The updated lines have been marked and I referred to your comment here.

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

Problem D is similar to this problem

→ Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

How to solve E?

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

    Do some $$$O(n^4)$$$ DP on intervals by considering lowest $$$d_i$$$ first (or in my case, $$$n\cdot 300^3/6$$$ ...)

    → Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

How to solve F?

→ Reply