Hello , i invite you to participate in the IOI training Contest #2 .
it will be held on Apr/21/2016 at 18 MSK
the problemset is USACO 2012 March Contest , this time there will be 3 gold and 1 silver to make it harder :D ;)
the contest URL : https://www.hackerrank.com/ioi-training-contest-2
the contets duration is 4 hours
thanks to tweety for helping me preparing the contest :)
you can read about the IOI training contests here .
if you are new on Hackerrank you can try everything you need in the test contest .
is there anyone can help us by check if there is any geometry problem in the problemset ?? :D
good luck for everyone :)
UPD: sorry , but i have to change the problemset because tweety haven't uploaded the test cases :D , thanks tweety , i won't participate this time because i have seen the problems before :'( .
the problems gonna be from USACO 2012 January .
Starts in 30 minutes.
What is the source of the new problems?
USACO too but another year .
Auto comment: topic has been updated by Bug (previous revision, new revision, compare).
MY INTERNET CONNECTION COULDN'T LET ME. OH GOD I SEEM LIKE A F**ING DEVIL NOW. FIRST THE UNRATED CONTEST NOW THIS. PEOPLE PLEASE BELIEVE ME I'M A VERY NICE GUY AND I DON'T MEAN ANY HARM TO ANYONE. FORGIVE ME PLEASE :(
Well shit, I'm almost two hours late.. Challenge accepted
Edit : Well, I sure failed :D
Lol, turns out I've already solved the a problem practically identical to the "Video Game Combos" in a Hungarian competition a few months ago. So much for the originality there :D Still submitted to make 100% sure, but yeah it's the same.
Aah, so many people solved the first one and I still can't solve it :(
Who solved third problem, please tell the explanation of problem. Because I can't fully it understand.
Here are all the solutions
Gotta admit the third problem is beautiful.
Look at discussion.
Easiest explanation in my opinion goes as follows. Task is about game. It's guaranteed that we have winning strategy (it's useful in some way in speeding solution up). Think about decision tree of this game. We have to print out optimal moves and then Bessie moves like in the input. So task is about finding path in this tree. We know Bessie decisions and we have to choose ours to be sure that we will win. Our decisions cannot just lead us to victory if Bessie moves like in the input, but we must be sure, that if Bessie'd change her move in some moment, the we'll still be able to win (possibly changing our future moves!).