University Innopolis is organizing and holding Innopolis Open, an Olympiad in Informatics for secondary school students (until 19 y.o.). The Olympiad consists of two rounds — online contest and the on-site competition (held at Innopolis, Russia).

Winners of the first round will be invited to Innopolis to take part in the on-site competition. During the Olympiad, all participants will be offered a free of charge accommodation, meals and transfer from Kazan to Innopolis and back.

Winners of the second (on-site) round will receive awards and can be enrolled in Innopolis University without any admission tests.

The first (online contest) round will start on December 18 at 10.00 a.m. (UTC +3).

The second (on-site) round will take place on February 25-26 in Innopolis city, Russia.

Registration is open until December 15, 2016. Participation is free of charge.

Please follow the link to register and find detailed information.

Is the onsite round for Russians only?

Hello, all participants who received the required number of points during the online contest, may take part in the onsite round regardless of the citizenship.

Am I the only one who can't open the given link?

I cant too...

it works now :)

WoW !! That's Impressive !!!

Thank you :) You are more than welcome to take part in the contest!

We visited Innopolis on a tour during IOI. The University is built standing alone in the middle of the countryside, a long bus ride away from any other major city. The presentations were a little difficult due to the language barrier, but I could definitely appreciate what went into developing the place, since it is so far away from civilisation. I think the University will pursue a successful future in attracting bright minds — although not quite yet.

We appreciate your feedback.

Innopolis is the youngest city in Russia and we are on the way to become the IT center. The infrastructure of the city is rapidly developing and we are sure that you'll be impressed by the progress in the nearest future. Also, Innopolis is only 40 kilometers away from Kazan and 70 kilometers from Kazan International airport.

We'll be happy to see you in Innopolis again and show you the city :)

Will there be online mirror contests for non-eligible people ?

The training on codeforce will be organized as soon as the online contest is finished.

will people from other country get free accomodation too?

As I know,yes.

what about transportation?

All transport expenses to Kazan should be covered by participants. We offer free transfer from Kazan to Innopolis

Yes, they will.

Free accommodation will be available for just the participant or for more persons (family members)?

For any questions about the final of the competition please email: olymp@innopolis.ru

What is proper way to write Date of birth?

DD.MM.YYYY

How long will the contest last for?

first contest was 5H,i think second will be same

The contest will last for 5 hrs.

Thanks.

When will the ranklist be published?

Click here

How many will be selected for finals?

Hello, The list of finalists will be published till the end of the week (approximately on December 22-23).

Any estimate on number of finalists?

The results will be announced only at the end of the week:)

Any updates?

https://pcms.university.innopolis.ru/results/innopolis/2016-2017/open-elimination-20161218-int.html

What if someone can't participate on finals? Will you invite next from the list?

We have sent the information via emails to all invited candidates and candidates from the waiting list. Please, check your email

How to solve D?

http://paste.ubuntu.com/23648281/

I won't explain my solution, but it's not hard to understand what I'm doing just by looking at it.

Will there be any editorials? And also how many will be selected?

The list of finalists will be published till the end of the week (approximately on December 22-23).

How to solve C??

Here's my solution: http://ideone.com/rsE5sO Basic explanation: Count those

iindexes that for everyone of them there's an indexj, such thata_{i}≤a_{i + 1}≤ ... ≤a_{j}, anda_{i}<a_{j}.How to solve E for 100 points? I got 66 but couldn't think of a better solution :(

Sqrt decomposition. Handle the numbers with

B_{i}>bucketnormally and others by keeping a hash map on modulo value. Just use slightly smaller buckets than sqrt(T) and it should be enough to pass.CodeThank you :)

How to solve question C??

Solution from Marik

Let pref[i] be the maximum volume of liquid that we can get by doing some opreations on prefix i, the same for suf[i], but here we calculate maximum volume that we can get on suffix i.

Therefore,

`pref[i] = v[i] + min(pref[i — 1], l[i])`

`suf[i] = v[i] + min(suf[i + 1], r[i])`

Then iterate i from 1 to n and calculate this value:

`ans = max(ans, suf[i] + pref[i] — v[i]).`

Code: http://pastebin.com/rEQLM2zK