OJ Board

i have got AC in this question. Here is my input and output files. Hope they can help you.


8

RGGBBGGRBRRGGBG
RBGRBGRBGRBGRBG
RRRRGBBBRGGRBBB
GGRGBGGBRRGGGBG
GBGGRRRRRBGGRRR
BBBBBBBBBBBBBBB
BBBBBBBBBBBBBBB
RRRRRRRRRRRRRRR
RRRRRRGGGGRRRRR
GGGGGGGGGGGGGGG

RRRRRRRRRRRRRRR
RRRRRRRRRRRRRRR ...

i think my program should work correctly however i get WA from the judge. I think my program should have some bugs but i can't find it out. Can anyone post test cases and the correct results to help me. Thx

yes, Sorry i have make a mistake here.
I have done this question and i find the main problem is that when you find the minimum line among all the nodes, it is incorrect to use the concept that we can find the minimum line by just finding the minimum distance between every two nodes (dijkstra ...

to asif_rahman0
In the test case you posted above, i found the your network three cost is not minimum. My program generates the following connection:


Cable requirement to connect (0,38) to (8,107) is 85.46 feet.
Cable requirement to connect (8,107) to (27,123) is 40.84 feet.
Cable requirement to ...