Editorial for IOI '97 P1 - Mars Explorer
Remember to use this editorial only when stuck, and not to copy-paste code from it. Please be respectful to the problem author and editorialist.
Submitting an official solution before solving the problem yourself is a bannable offence.
Submitting an official solution before solving the problem yourself is a bannable offence.
The programme reads the terrain into an array.
A binary tree is then created for all possible movements from the start to the end.
Thus… Only complete paths can be seen as the tree does not continue past rough terrain.
Therefore… The paths are evaluated to see which sample the most times, and the largest sum of the paths according to how many MEV's there are, is chosen and these paths are then used as output.
Comments