OJ Board

My team also suffered with the same problem in the on-site contest... I think the same input set is used in both contests (online & onsite). In that case, I'm really surprised how 2 teams (even one team without any penalty :roll: ) managed to solve the problem in the onsite contest... with lacki...

thanks to Vexorian... I got accepted easily by reading the graph as an array of edges... :D the solution is obviously brute force search... nymo, The only optimization that I did, was: whenever I decided not to take a vertex as an information centre, I marked all the adjacent vertices as taken. Hope...

Hi,

I am 23 years old. solved 500+ problems. joined October, 2002.
Though registerd long time before, this is my first post