Rating changes for last rounds are temporarily rolled back. They will be returned soon. ×

fushar's blog

TOKI Regular Open Contest #1
By fushar, history, 6 years ago, In English

Dear Codeforces community,

We're excited to invite you to TOKI (Indonesian informatics olympiad committee) 's first rated contest on our TLX platform:

TOKI Regular Open Contest #1!

Key details:

The first several rounds of TROCs will be used to generate the initial ratings for the contestants. Everyone can join (combined divisions), and the problemset is expected to be easier than usual.

Please register to the contest, and we hope you will enjoy TROC #1!

UPD:

Contest is over! Thanks for your participation.

Top 5:

Ratings have been updated! See the global ranklist: https://tlx.toki.id/ranking.

You can upsolve the problemset here: https://training.ia-toki.org/problemsets/117/problems.

See you in the next TROC!

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

»
6 years ago, # |
  Vote: I like it +11 Vote: I do not like it

Friendly bump! The contest starts in less than a day!

Heads up: the difficulty of the first few rounds of TROC will be a bit similar to Div2 CF contests, until we have generated enough rating distribution to split the contests into 2 divisions. However, we hope that the contests will be interesting to Div1 coders as well :)

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

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

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

There is no tab Editorial on the site. Do you plan publish editorial after rounds? Or maybe write at least on CF.

And how to solve last problem?

→ Reply
»
6 years ago, # |
← Rev. 3   Vote: I like it -11 Vote: I do not like it

Where can I read the editorial ? I am also curious about the solution to the last problem as above comment said. (Would anyone tell me the solution?)

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

taow, realDonaldTrunp, and all:

The editorial (with English version) is available here: https://docs.google.com/document/d/1LWi876Qv424-ONqw5LR9JgV3htCBYeNohpYP-C8UhDw/edit?usp=sharing.

We're planning on how to embed in the editorial in the contest system in the future. Thanks!

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

    fushar Thanks a lot. I really like the last problem. "Note that for each D, it is enough to check until the (MAX_A / D)-th tree" That is exactly what I couldn't come up with. (and what makes this problem interesting.) I'm looking forward to meeting another nice problem in the upcoming contest.

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

    omg. I really disappointed. I thought that i would read the solution to the cool problem. But only after reading editorial, I got the statement right.

    Why you dont write in the statement that A_1 should be first number of arithmetic progression, A_2 should be second and etc. Because for me, the answer for test:

    5

    1 3 5 4 2

    Needed to be : 0, not 2

    Of course, really short statements is good, but not when it can lead to misunderstanding. Or at least you could add more samples.

    P.S. big thanks that you publish editorial, problem itself is good, but a bit standard.

    → Reply