### Tima's blog

By Tima, 2 years ago, translation, ,

You can submit the problems in this group.

Bronze  ≥ 206 points.

Silver  ≥ 301.

Gold  ≥ 371.

Upd. Thanks to the new updates, now tasks are available in IOI format. Almost all solutions are rejudged, except for the AC solutions. For some reason I can't rejudge them together.

• +67

 » 2 years ago, # |   +10 What about un-official participants ?
•  » » 2 years ago, # ^ |   +1
 » 2 years ago, # | ← Rev. 2 →   +2 ..
 » 2 years ago, # |   +1 Can you give the problems?
•  » » 2 years ago, # ^ |   +3 https://www.dropbox.com/sh/ljs9b2ifjza19qb/AABKgvi7CbEZq8KBlBoJlYRFa?dl=0 sorry for not clear statement.
•  » » » 2 years ago, # ^ | ← Rev. 3 →   +1 Can you please find the english version? Also IZHO organizers didn't realize that it's "2018" now.
•  » » » » 2 years ago, # ^ |   +1
•  » » » » » 2 years ago, # ^ |   0 Thanks what about today's problems and results?
•  » » » » » » 2 years ago, # ^ |   0 I don't know results, but I'll send today's problems
•  » » » » » » » 2 years ago, # ^ |   0 Yeah, please
•  » » » » » » 2 years ago, # ^ |   +5 Total results of IZHO
 » 2 years ago, # | ← Rev. 2 →   +12
•  » » 2 years ago, # ^ |   +9 Are these observations true and sufficient for solving treearrray? all vertices in an arbitrary answer are from subtree of v in an arbitrary answer there must be two vertices from subtrees of different sons of v so, if there does not exist subarray of length 2 there is no answer, otherwise answer can always be of length 2
•  » » » 2 years ago, # ^ |   0 Yes
•  » » » 2 years ago, # ^ | ← Rev. 3 →   0 Yes I used it in my solution and I got 56 points (complexity O(n^2)). But there is one more observation that if v is in the array answer can be subarray consisting only from v.
 » 2 years ago, # |   0 Day 2 results: https://photos.app.goo.gl/Av6yktTHQ5J4Kml22
 » 2 years ago, # |   +5 Tima, Can you change style of contests (which in the group) to ACM ICPC style. And access to see code, if you solve this problem.Sorry for my English.
•  » » 2 years ago, # ^ |   +18 I think IOI format is better suited.
•  » » » 2 years ago, # ^ |   0 What about access to see code, if you get max. score. Can you do this?
•  » » » 2 years ago, # ^ |   +7 I think it would be better if you make each sub-task a problem in codeforces so you can see how many sub-tasks your code passes.
 » 2 years ago, # |   0 Why there is only results of people who have got a medal?
•  » » 2 years ago, # ^ |   +1 Fixed. All results are available.
 » 2 years ago, # |   +10 How to solve problem A from the second day?
•  » » 2 years ago, # ^ |   0 I think sqrt decomposition and bin. search.
 » 2 years ago, # |   0 Where can I find the solutions?
•  » » 2 years ago, # ^ |   +10 Here.
•  » » » 2 years ago, # ^ | ← Rev. 2 →   +6 Access Denied (for the tests and solutions)
•  » » » » 2 years ago, # ^ |   +5 Now it should work. Sorry for the inconvenience caused.