I did not find any official Solutions to the problems. So If anyone could post their solutions or ideas about the problems, it would be really helpful..

Link to the problems: IOI 2013 Problems

I have read the Analysis to the problems , but i had some problems understanding them. I thought it would be better to discuss the problems here since it would help many people.

Can we discuss about the solutions and the alternative methods to solve the problems?

Here is the Link : http://usaco.org/index.php?page=open13problems

hogloid

I have mentioned your name, because i have seen you give the usaco contest.

Hello there, Can anyone please help me out with this? Problem : http://www.spoj.com/problems/BTCODE_G/

I am getting RE(Segmentation Fault). i tried doing the DFS with Stack but it doesnt help.

Here is my code:http://paste.ubuntu.com/5583070//

My Algo is: First i do an inorder traversal of the tree. Then i keep a BIT for every colour. When they ask me to colour a node, i add +1 to the BIT WITH ID start time, and -1 to the BIT with ID endtym. Then i find the number of nodes that are of the colour of node a, in the path from a-->b.

Please help me.

Here is the problem: http://acm.timus.ru/problem.aspx?space=1&num=1930

Basically we have to find the shortest path form one node to another where the weights of the edges are 0 or 1.

Here is my code: http://paste.ubuntu.com/1527659/

Can anyone please help?