hey guys i am new to competitive coding. Please help me regarding time limit issues.
I am talking with respect to http://www.codechef.com/problems/NI02.
This problem have time limit 3 second.
Q1) Single source shortest path solution have 0( n^2 ) time complexity. How one will detrmine considering (maximum input size)*(#test cases) whether algo will run within time limit.
Q2) I have submitted solution it got executed in 0.88. Can we approximately determine this value or at least maximum value in question 1
Or what is number of operations per second in codechef judging environment.