Hello Codeforces Community, TOKI Open Contest is back again! :D
We would like to invite you to participate in this TOKI Open Contest January 2018. TOKI Open Contest is Indonesian monthly online programming contest. It's been a long hiatus since we decided to make this contest international: on February and March 2017! :')
Every problem is written in both Bahasa Indonesia and English. The contest will be divided into two divisions: Division 1 and Division 2. It is pretty similar to the divisions in Atcoder (Beginner and Regular). You are free to register in any division (it's extremely OK if you are a Div2 Codeforces user and register to our Division 1 contest)! The expected difficulties of the problems are much the same with Atcoder's contest problems.
TOKI Open Contest January 2018 will be held on Saturday, 27 January 2018, 19.00 — 21.00 Western Indonesian Time (UTC+7). This contest is written by Kwee Lung Sin (Klungs) and Maximilianus Maria Kolbe (Yoshiyuki); also monitored and supervised by Agus Sentosa Hermawan (aguss787), Ammar Fathin Sabili (athin), and Anthony Ng (anthonyhkf).
Several details related to the contest:
The contest will use ACM-ICPC scoring type.
For each division, there will be FOUR (4) problems with various difficulties but the weight for each problem is the same. The contest duration is 2 hours.
The problems are sorted by their expected difficulty from easy to hard. Participants are recommended to read all the problems.
Any non-Accepted submission will get 8 minutes penalty but it will only be counted after the respective problem got Accepted.
The rank will be sorted according to the most number of solves (problems with Accepted verdict). If there are ties, it will be determined by least (sum of solving time + sum of penalties). The rank will be separated for Division 1 and Division 2.
The allowed programming languages are C, C++11, Pascal, Python 3, and Java 8. However, please note that we do not ensure that every language can solve all the problems on the given time limit.
The contest will be held on https://competition.ia-toki.org/contests/253 for division 1 and https://competition.ia-toki.org/contests/254 for division 2. Registration is already opened at the same place. Registering the contest requires a TLX (http://competition.ia-toki.org) account. You may need to register for an account if you don't have one.
Wish you all good luck and have fun! See you at the leaderboard! :)
UPD 1: The contest will be held in less than 20 hours, make sure you are already registered! :D
UPD 2 : The contest is over, thanks for participating the TOKI Open Contest January 2018! :D
This contest has 31 contestants in Division 1 and 41 contestants in Division 2 with at least one submission.
The following are the winner of the TOKI Open Contest January 2018:
Division 1:
ayaze solved 4 problems with 164 minutes total penalty.
jonathanirvings solved 4 problems with 207 minutes total penalty.
wiwitrifai solved 4 problems with 254 minutes total penalty.
Division 2:
Reiva5 solved 4 problems with 164 minutes total penalty.
farizazmip solved 4 problems with 203 minutes total penalty.
ipul23 solved 4 problems with 278 minutes total penalty.
Congratulation to winners! :D
The problems are available at https://training.ia-toki.org/problemsets/106/problems for upsolving. See you at the next TOKI Open Contest! :D
Auto comment: topic has been updated by athin (previous revision, new revision, compare).
It's not really a fun experience when you wasted 23 minutes and 3 wrong submission because you forget to print the line ending...
How to solve the last problem of Div 1, by the way?
You can find its solution here http://mirror.codeforces.com/blog/entry/57319.
Yeah, unfortunately we found the post about "Segment Tree Beats" (it is also very new) after we set the problems (like 2 weeks ago or more).
The solutions that we had are also different from "Segment Tree Beats" technique. One way to solve it is by using Segment Tree (in
but unlike "Segment Tree Beats" this solution cannot do the sum part (or at least we don't know)) and another way is by using a data structure that we usually call it as "Segment Array" (in 
).
You can find an explanation about Segment Array here.
We are sorry for the inconvenience. We use the usual standard contest (e.g. ICPC) rule that is very strict about newline and whitespace.
i participated in div2..why can't i see div1 prob or any archive contest problem??
The post is already updated. You may find the problem archive here, :)
Auto comment: topic has been updated by athin (previous revision, new revision, compare).