jonathanirvings's blog

TOKI CMS Contest
By jonathanirvings, history, 4 years ago, In English

Hi all,

As a preparation for the Indonesian Informatics Olympiad committee to host IOI 2022, we decided to organise a test contest using CMS, the contest system used for IOI since 2012. The main purpose of this contest is for us to be familiar with CMS, including troubleshooting issues that may arise before, during, or after the contest.

Therefore, we would like to invite everyone to participate in this contest. The contest will be held on Sunday, 10 January 2021 9:05PM UTC+7 (Western Indonesian Time).

Since we are using the contest to be familiar with IOI-related features in CMS, the contest follows several IOI specifications, including:

  • There are batch, output-only, interactive, and communication tasks.
  • For non output-only tasks, you only need to implement one or more functions specified in the problem specification.
  • There are one or more subtasks for each task.
  • Full-feedback for each submission will be given (there is no pretest).
  • The supported programming language is C++ (IOI will no longer support Java from 2021).

However, the quality, novelty, and difficulty of the tasks may not be the same as IOI. Since this is a test contest, we are trying to make the contest as fun and approachable as possible. The contest duration is 2 hours.

The contest will be hosted in https://cms.toki.id/. To participate in the contest, you will need to register in this form by the end of Friday, 8 January 2021 UTC+7 (Western Indonesian Time).

We are planning to distribute TOKI souvenirs to random participants with a non-zero score of this contest. The details of the souvenirs are yet to be confirmed. We will update the post once the details are confirmed.

See you in the contest :)

UPD1: The problems are now available for upsolving in TLX. Note that we need to modify several details due to CMS vs TLX incompatibilities.

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

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

Full-feedback for each submission will be given (there is no pretest).

IOI used to give full feedback, but from IOI 2018 they use the "Restricted" feedback in CMS, that is "If a subtask is not fully solved, the grading system gives a feedback only for the first test case among the lowest scored test cases in the subtask."

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

    I wonder what should be the correct term for this, but what I meant by "full-feedback" is that there is no pretest.

    In other words, each submission will be judged using the full tests immediately after the submission, and the final score for the submission will also be revealed after it has been judged.

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

Friendly reminder that the registration closes in approximately 2 weeks. Make sure that you are already registered. :)

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

    Registration closes in a week. Make sure once again that you are already registered :)

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

Thanks to all registrants for registering to the contest. The registration for TOKI CMS Contest is now closed.

The credentials to participate the contest have been emailed to all registrants. In case you have not received it, please check your Spam folder. For any enquiries, feel free to contact me via any channel (including Codeforces message).

The contest starts in less than 5 hours. The public scoreboard of the contest will be available in https://scoreboard.cms.toki.id/ during the contest.

Good luck and have fun! :)

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

Will the problems be open for upsolving?

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

Cool tasks! Thanks

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

The premise for Origami was very cool :). Does anyone have a link to a tutorial on how to make origami using that idea?

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

lol i somehow managed to squeeze a O(n*sqrt(n)*log2(n)) solution for the last question, is that intended or is there a faster solution?

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

    I have n*log2(n)*log2(n)
    main observations:
    a)1/1+1/2..........+1/n=log2(n)
    b)if there are z elements which are equal to x then the answer is atmost (z/x)+1
    c)memoize the answers and don't calculate answer for every query more than once
    d) implementing efficiently with binary search gives n*log2(n)*log2(n)
    code- https://ideone.com/9gcEYW

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

Sorry for the late update. The problems are now available for upsolving in TLX. Note that we need to modify several details due to CMS vs TLX incompatibilities.

→ Reply