gKseni's blog

By gKseni, 4 years ago, translation, In English

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.

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

»
4 years ago, # |
Rev. 2   Vote: I like it +19 Vote: I do not like it

Is the onsite round for Russians only?

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

    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.

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

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

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

WoW !! That's Impressive !!!

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

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

»
4 years ago, # |
Rev. 2   Vote: I like it +18 Vote: I do not like it

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.

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

    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 :)

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

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

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

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

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

will people from other country get free accomodation too?

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

What is proper way to write Date of birth?

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

How long will the contest last for?

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

Thanks.

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

When will the ranklist be published?

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

How to solve D?

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

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

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

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

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

How to solve C??

  • »
    »
    4 years ago, # ^ |
    Rev. 2   Vote: I like it 0 Vote: I do not like it

    Here's my solution: http://ideone.com/rsE5sO Basic explanation: Count those i indexes that for everyone of them there's an index j, such that ai ≤ ai + 1 ≤ ... ≤ aj, and ai < aj.

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

How to solve E for 100 points? I got 66 but couldn't think of a better solution :(

  • »
    »
    4 years ago, # ^ |
      Vote: I like it +11 Vote: I do not like it

    Sqrt decomposition. Handle the numbers with Bi > bucket normally 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.

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

How to solve question C??

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

    Solution from markaq

    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