You are viewing a single comment's thread. Return to all comments →
Thanks for you comments!
My solution passed the test case 7 now after I made the following one line patch!
//cin >> u >> v >> d;
scanf("%d %d %d", &u, &v, &d);
:~/language/c++$ time cat ~/Downloads/dij_input07.txt | 999 > 999.txt
real 0m2.005s user 0m1.984s sys 0m0.044s
:~/language/c++$ time cat ~/Downloads/dij_input07.txt | 99 > 99.txt
real 0m0.881s user 0m0.876s sys 0m0.036s
Seems like cookies are disabled on this browser, please enable them to open this website
Dijkstra: Shortest Reach 2
You are viewing a single comment's thread. Return to all comments →
Thanks for you comments!
My solution passed the test case 7 now after I made the following one line patch!
//cin >> u >> v >> d;
scanf("%d %d %d", &u, &v, &d);
:~/language/c++$ time cat ~/Downloads/dij_input07.txt | 999 > 999.txt
real 0m2.005s user 0m1.984s sys 0m0.044s
:~/language/c++$ time cat ~/Downloads/dij_input07.txt | 99 > 99.txt
real 0m0.881s user 0m0.876s sys 0m0.036s