OJ Board

I keep getting WA for this problem.
I found that it is possible for cost to be zero, and the input doesn't say what to do about them.
What I do in this problem is to determine if graph is bipartite, and find the minimum spanning tree. It's not very difficult, yet I'm getting WA.

but sometimes you can take more egdes not only those needed to form spanning tree

Thanks, I missed that.

I have got WA for a lot,Thanks!

but sometimes you can take more egdes not only those needed to form spanning tree

I couldn't get what u mean

asmaamagdi wrote:

but sometimes you can take more egdes not only those needed to form spanning tree

I couldn't get what u mean

THIS. Same here. Couldn't understand what he said.

Regards,
George
Pret travaux

but sometimes you can take more egdes not only those needed to form spanning tree

this means you can add edges which have not been used in the mst but have negative cost . u can add these negative cost to reduce the total cost of the mst.i hope you understand now. but i think you should have understood before if you have given proper effort .
thank you.

hello every one i got WA 2 times in this prob,pls help me, advanced thanks,

code removed got acc, silly mistake