antontrygubO_o's blog

By antontrygubO_o, 3 years ago, translation, In English

It’s finally time for one of the biggest events in the competitive programming world. The SnackDown ‘21 Grand Finale is here.

The entire Grand Finale event is scheduled to be completed in two days — January 8 (Saturday), and January 9 (Sunday).

For the Finalists

All the information has been shared over email, but summarising — The Grand Finale will be spread over two days and will be a closed event accessible only to the finalists, and a few invited guests. The SnackDown 2021 Final contest will be held on Jan 9th between 6:30 — 10:30 PM (IST).

For the last time for this SnackDown, meet the panelists!

For the Community

For those who would like to have a taste of the SnackDown Final problems, we also have the SnackDown Final Parallel Unrated Contest scheduled for January 9, 2022, 6:30 PM — 10:30 PM (IST). The problems will be the same as the Finale. Since the main Finals will be a restricted session, the rank list can be viewed here. Note that the rank list will be frozen for the last hour, and will be resolved in the post-contest ceremony on YouTube.

The Grand Finale Closing & Crowning Ceremony

The SnackDown ‘21 Finale closing ceremony will start on Jan 9th at 10.30 PM IST. It will be hosted by Kamil Debowski and Ashish Gupta, who will be analyzing the contest problems and the strategies and performances of the participants. This is also where you can witness the moment of truth, the SnackDown ‘21 Grand Finale winner announcement! Everyone is cordially invited to the event, and we request you to set your reminders here.

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

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

as a tester, i overslept the elimination round

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

as a setter, i have tried to make interesting and beautiful problems and recommend to give this contest

»
3 years ago, # |
  Vote: I like it +31 Vote: I do not like it

Up, the contest starts in 30 minutes.

»
3 years ago, # |
Rev. 2   Vote: I like it -30 Vote: I do not like it

.

»
3 years ago, # |
Rev. 2   Vote: I like it 0 Vote: I do not like it

i think codechef should keep this leaderboard for regular standing too. it looks quite nice and able to see all problems at once makes a big difference . i think it will be much better than normal standing page in codechef rounds

  • »
    »
    3 years ago, # ^ |
      Vote: I like it +15 Vote: I do not like it

    You mean displaying all the problems in the leaderboard without needing to scroll, right?

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

      yes

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

        Sure. Thank you for the feedback. We are already revamping the rankings page, will try to accommodate this too. :)

        • »
          »
          »
          »
          »
          3 years ago, # ^ |
            Vote: I like it +13 Vote: I do not like it

          Would it be difficult to also show timestamps of submissions for each problem on the leaderboard? This information is useful during contests, because it allows to roughly guess how much time people (from someone's friend list) typically spend on each problem.

          And after a contest, being able to sort submissions by execution time would be also very useful. I'm sometimes interested in checking the most performance optimized submission, but the CodeChef UI doesn't seem to provide an easy way to find it.

»
3 years ago, # |
Rev. 2   Vote: I like it +95 Vote: I do not like it

The contest has finished, we hope you liked the problems!. We enjoyed seeing the finalists compete fiercely up to the very last minute!

If you are interested, there is a wonderful final ceremony (with some comments on the contest by none other than antontrygubO_o and Um_nik, and with the revelation of the final ranking) hosted by Errichto and Ashishgup.

»
3 years ago, # |
  Vote: I like it +39 Vote: I do not like it

Congratulations Rewinding!, tourist! and Benq!

»
3 years ago, # |
  Vote: I like it +82 Vote: I do not like it

I really enjoyed the problems. It was the best onsite final problemset in 2021. Thank you!

dario2994 could you mind sharing some tricky cases for Climbing?

  • »
    »
    3 years ago, # ^ |
      Vote: I like it +64 Vote: I do not like it

    I am very happy to read that.

    Here is a list of 1000 small tests (they are not tricky, but they are many): in and out.

    Achtung: The editorial of CLIMBINGRANK will appear only after the first AC.

»
3 years ago, # |
  Vote: I like it +181 Vote: I do not like it

Thank you for the contest! I enjoyed thinking about every problem.

ONESGUESS
ANDOFMAXES
PERMRANGES
EQPRFMAXSPLT
ROBBERYPLAN
BAKERY
CLIMBINGRANK
  • »
    »
    3 years ago, # ^ |
      Vote: I like it +26 Vote: I do not like it

    For ANDOFMAXES we originally wanted only $$$O(n \log C)$$$, but closer to the contest it turned out that we can't separate it well enough from $$$O(n \log n \log C)$$$ but we wanted to have a second problem before "hard part" so we decided to lower the limitations to let $$$O(n \log n \log C)$$$ to pass freely.

  • »
    »
    3 years ago, # ^ |
    Rev. 3   Vote: I like it +8 Vote: I do not like it

    Thanks for the contest. I really enjoyed solving the first 4 problems.

    In the contest, I implemented $$$O(n * (logn + logC))$$$ soln for ANDOFMAXES and it's a bit different from the soln given in the editorial. Probably others would have implemented it as well but since solns aren't public I will write it here for the sake of completeness.

    Spoiler

    My submission

    • »
      »
      »
      3 years ago, # ^ |
        Vote: I like it +2 Vote: I do not like it

      "solns aren't public"

      Sorry, missed that. All submissions should be public now.