arknave's blog

2019 North American Qualifier (NAQ)
By arknave, history, 5 years ago, In English

The 2019 North American Qualifier (NAQ) will be held tomorrow. The NAQ is an online, pre-regional programming contest to help coaches choose teams for regional competitions (or serve as practice). The contest begins at 2019-10-05 18:00 UTC. Official participants who have already registered can access the problems at https://naq19.kattis.com/.

There is also a slightly delayed open mirror where anyone can compete. The open mirror begins fifteen minutes after the official contest, and is available here: https://open.kattis.com/contests/naq19open.

More details here: http://cs.baylor.edu/~hamerly/icpc/qualifier_2019/. Past versions: 2018, 2017.

Good luck to all competing!

EDIT: Contest is over, congratulations to all the teams that competed! Some statistics and solution outlines available here: https://cs.baylor.edu/~hamerly/icpc/qualifier_2019/

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

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

Reminder! Open contest starts in 1 hour,

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

How to solve F? Thanks

P.S. Don't post it until 15 minutes later.

→ Reply
  • »
    »
    5 years ago, # ^ |
    ← Rev. 2   Vote: I like it +24 Vote: I do not like it

    See the slides for an outline. Here is my code.

    The worst-case can be computed by a simple DFS (although I messed that up in my first submission ...)

    The best-case can be computed using priority queues. Let me know if the comments in my code aren't sufficiently clear. (It's a slightly harder version of a problem from this year's USACO Camp. :o)

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

      I can't see the code. Is the code set to secret mode?

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

        Sorry, it should be fixed now.

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

      Oh, was the USACO camp problem from Eric Price by any chance?

      We discussed this problem and its solution a few years ago :)

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

        No, although I can think of at least one other instance where USACO Camp used a task which was quite similar to a previous one by Eric ...

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

          Huh, guess it's a coincidence then.

          Are the USACO camp problems available online somewhere? I'd like to check that the Regionals problems won't be too similar (especially the harder ones).

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

        Problem E from CERC 2013 may interest you.

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

I can help you to upload it to the Codeforces::GYM. Feel free to contact me if you neep help.

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

Auto comment: topic has been updated by arknave (previous revision, new revision, compare).

→ Reply
»
5 years ago, # |
← Rev. 3   Vote: I like it +8 Vote: I do not like it

Are the data for problem E correct?

I downloaded the data from the NAQ website to do some testing locally and I found that my in-contest AC submission was generating reconstructions that have more vowels than the ones provided in the official data. I have already validated that the reconstructions are valid otherwise.

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

    Yes, sorry, the judge data is incorrect (and the current output validator on Kattis is too lenient as a result). It should be fixed soon.

    → Reply