General information
Official website of the olympiad: http://izho.kz
This year computer science section of the olympiad will be hosted by Kazakh-British Technical University.
In addition to the official onsite contest, an unofficial online contest will also be available to everyone. To participate in the online contest you need to register here. Logins and passwords will be distributed closer to the contest dates.
Contest rules are generally the same as on IOI, though we do not follow the syllabus exactly.
Allowed programming languages: C/C++, Pascal and Java.
Task statements will be available in English and Russian.
You can find some information about past olympiads here: 2014, 2013, 2012, 2011, 2010, 2009.
Online contest schedule
Schedule for the online contest (all times are in Almaty timezone, GMT+6):
Registration until January 10, 11:59pm Practice session January 12, 00:00am — 11:59pm
Contest day 1, session 1 January 13, 3:00pm — 8:00pm
Contest day 1, session 2 January 14, 3:00am — 8:00am
Contest day 2, session 1 January 14, 3:00pm — 8:00pm
Contest day 2, session 2 January 15, 3:00am — 8:00am
Note, that contestants should participate in only one session for each contest day.
We do not expect any changes in the schedule, but, please, check this page closer to the contest dates to see that times are still the same.
All additional information will be published on this page. Contest environment
Information about the server software:
1. Contest system: CMS;
2. Operating system: Ubuntu 14.10 x64
3. Available compilers: FreePascal 2.6.4, GNU C/C++ 4.9.1, Oracle JDK 1.8.0_25
Onsite contest server (physical server): 2 x Intel Xeon X5570 @ 2.93GHz.
Online contest server (virtual server on Amazon EC2, c3.large): 2 vCPUs, each is HT from Intel Xeon E5-2680 v2 (Ivy Bridge).
Computers configuration for onsite participants (note, versions of compilers are a bit different from the compilers on the server):
1. Operating system: Microsoft Windows;
2. Available compilers: FreePascal 2.6.4, MinGW GNU C/C++ 4.8.1, Oracle JDK 1.8.0_20;
3. Available software: Google Chrome, Code::Blocks 13.12, Eclipse 4.4.0 (Luna), Far Manager 3.0.4040, Python 3.4.1, gVim 7.4.
If you have any questions, feel free to ask: izho-cs@olympiads.kz.
The country option for the United States is not available.
It's already available, sorry for inconvenience :-)
What about c++0x or c++11?
C++11 will be available
Is there a livescore ?!
When I enter into contest url it shows me a threat
Should I enter?
Try to write simply 54.165.47.245 instead of http://54.165.47.245/ if you don't wrote it in such way. For me it works.
Simply click on Advanced, then click Continue. I've had that problem on 1st tour.
When will we know the official results of the first day?
am I the only one who get "Submission storage failed!" when trying to submit the first problem?
No, I've been trying to submit for the last 30 mins, storage failed :(
Am I only one to whom everything works perfect?
No ,but it seems that you're the only one who haven't read last announcement yet
Yeah, i noticed that, but just I could submit the whole time, and it was evaluating properly, that's why I was asking.
Results day1???
IZhO organizing committee : "Ranking URL: https://54.165.47.245/rws (will be available during practice session and after session 2 of day 2)".
Full results(day1 and day2)???
link1 link2
I think, that nobody can not see the results. It is very sad :C
You can download pictures, and see them in increased size on your computer
i can. press +
How to solve C day1 ?
hint: ceil(d / a) have
dinict values for fixed integer d.
Does anybody know how many places will be given?
approximately 50
I know, but I need the exact number. When it will be known?
tomorow
Only in award ceremony?
Yes.
Divides the campaign will be on balls, and not on the number of participants. At least so say to the team leaders.
Congrats to all medal winners !!! I think participating in this olympiad is also a winning so don't be saddened :))
Tell that to the unofficial participants(
Full official results now available.
The problems are great!
will the server be available for upsolving or at least will the test data be available to download?
I have gold) Cool problems. Day1: 138. Day2: 257. I'm so happy) Next target is red on CF. :)
How to solve 1A about permutations?
it's sufficient to check that the maximum number in given interval to be equal to (r-l+1) and all numbers are distinct in that interval
thanks, but how to check that all numbers are distinct?
Nexti — minimum j > i such that Aj = Ai
If min(NextL, ..., NextR) > R, then all numbers in [L;R] are distinct.
We can calculate min(NextL, ..., NextR) with segment tree.
When we update some number, only 3 Next values must be changed.
simply) write segment tree with such item:
struct item{
int min_value,max_value; long long sum, multi; int count; //size of segment(r-l+1) int even_count,nodd_count; //amount of even numbers and amount of odd numbers long long even_sum,odd_sum;
}
it's easy to combine
No, buddy. This problem can easily be solved with multiplying each number of treap to prime number in degree and counting sum.
I got wrong answer with your algorithm
UPD: I forgot to make calculations in modulo prime number.
I solved that problem like I said, and 100.
You can use hashes to solve this problem. Store following prefix sum: f(i) = (pa1 + pa2 + ... + pai)%mod in Fenwick tree.
If hash of segment not equals (p1 + p2 + ... + pr - l + 1)%mod segment is not permutation.
cool)