### OnurSigirci's blog

By OnurSigirci, 5 years ago, ,

BOI 2014 — Website (Turkiye)

boi2014.tubitak.gov.tr

"Welcome" article:

Dear participants,

It is our pleasure to express our warm welcome to all of you and thank you for coming and taking part in the 22th Balkan Olympiad in Informatics. The onsite contest will take place in Ankara, Turkey, from August 10th (arrival day) to August 17th (departure day) 2014.

At this website, participating countries will be able to find all the information about BOI 2014.

The Organizing Committee


• +26

 » 5 years ago, # |   +6 What about age limit?
 » 5 years ago, # |   +6 If someone needs information about Junior Balkan Olympiad in Informatics 2014 (JBOI 2014) , here is the official site http://jboi2014.dms.rs/index.php?action=show&data=home :")
 » 5 years ago, # |   +20 I would like to participate this competition. But i couldn't pass the eliminations. :(I wish luck to everyone. :)
 » 5 years ago, # |   +9 Is there any schedule that describes detailed explanation ? (At least contest start time and finish time )
•  » » 5 years ago, # ^ |   0 will be announced as soon as possible.
 » 5 years ago, # |   +6 Hope all participants and team leaders would enjoy
 » 5 years ago, # |   0 Is there any feedback in this BOI?
•  » » 5 years ago, # ^ |   +5 I received info that it will be the same format as the IOI. So full feedback and cms judge.
•  » » » 5 years ago, # ^ |   0 Full feedback is great :) Thanks
•  » » 5 years ago, # ^ |   0 Well, we had full feedback on JBOI 2014, so i hope that older ones are having it too. :)
 » 5 years ago, # |   +8 No livescore, shame :(
•  » » 5 years ago, # ^ |   0
•  » » » 5 years ago, # ^ |   +8 The link doesn't work. Can someone post results? Thanks
•  » » » 5 years ago, # ^ |   0 Are you sure that this link is available outside of Turkey, because I tried it during the contest and it did not work. I still can't open it, but my son told me that he opened from Turkey
•  » » » » 5 years ago, # ^ |   0 Yes, it works for me in Slovakia.
•  » » » » » 5 years ago, # ^ |   0 Now link works, but its not original proposed link, it has been changed to correct one after the end of day contest, previous link pointed to boi2014.tubitak.gov.tr and did not work. At least hope we can watch second day of competition (unless they change it again :D )
 » 5 years ago, # |   +3 First day finished, tough problems.First is Hristo Venev with 225, Second is Mihai-iulian Andreescu with 200 and scores go down very fast. I got 6th place with 152, and 10th place is 87.During the competition third problem was found to have wrong tests and was supposedly fixed, however I'm not certain that after the fix the tests were correct. Competition was extended by 45 minutes due to that.Looking forward to the second day, hopefully I'll do better than today :)
•  » » 5 years ago, # ^ |   0 Good job. Can you post full results ?
•  » » » 5 years ago, # ^ |   0 Well, I don't have them right now. However I can open the link onursigirci provided above while in Turkey (I'm batvanio's son if you wonder). Not sure if that's the final results though because when we got out Marko Stankovic had 155 and now he has 200. And it can be clearly seen that his last submissions are at 5:59h while the competition lasted 5:45h. They may have extended the competition for him only for some reason but I have no such information.
•  » » » » 5 years ago, # ^ |   +5 Boi committee gave to Marko 20 minutes extra time, because there was a problem marko's computer.
•  » » » » » 5 years ago, # ^ |   0 Thanks for info, now I can open the results. Can someone post tasks?
 » 5 years ago, # |   0 How to solve first problem(diameter)?
•  » » 5 years ago, # ^ |   +3 Firstly you binary search the answer(we will call it D from now on) and then you test whether the answer is correct.To do so, you use several observations: — Each zone is a connected component — Each leaf is part of a componentTherefore, we notice that it is ok to use a DFS algorithm and for every node compute the largest distance in each of it's subtrees. After doing so, we can sort the given distances and eliminate them from the array as long as the sum of the largest two exceeds D. We basically consider that we 'cut' the worst subtree and make it a partition of it's own.This solution gets 55 points.For the 100 points solution, when coming back from the DFS function, you notice that you don't need all the values from the subtrees. There are some more observations: — Any two values larger than D / 2 summed up will exceed D / 2, therefore one will be cut — Any two values less than D / 2 summed up will be less than D / 2Therefore, after cutting all, but one(the smallest subtree bigger than D / 2), and keeping all, but one(the largest subtree smaller than D / 2) you only have one thing to test: Are the subtrees left breaking the conditions(ie is their sum bigger than D)? If yes, you cut the one bigger than D / 2.