| Title |
User |
Message |
Date Posted |
| help |
TheBoss77 |
last test case |
Feb 22, 2020 - 2:54:26 am UTC |
| Re: weight? |
jargon |
Yes. |
Feb 18, 2017 - 10:29:19 pm UTC |
| weight? |
Chinadoll |
Is the weight always going to be 0 or 1? |
Feb 17, 2017 - 9:25:52 pm UTC |
| Re: ... |
Kirito |
Read this first: http://wcipeg.com/wiki/Graph_theory#Adjacency_matrix |
Nov 25, 2016 - 12:50:18 am UTC |
| ... |
4Dmovie |
What does the problem mean? Should the sample print 0 instead of 2? Because it seems that dist[1][3] = 0 so we can directly go from 1 to 3. |
Nov 24, 2016 - 5:02:21 pm UTC |
| Re: ... |
jargon |
In general, if other people have solved the problem (there've been 65 in this case!), it probably isn't a problem with the judge. |
Apr 17, 2015 - 3:15:40 am UTC |
| Re: ... |
Guru_Charis |
Thank You!!! :) |
Apr 16, 2015 - 10:05:03 am UTC |
| Re: ... |
wgma00 |
You're not pruning your depth first search correctly. Lets assume your program does find the shortest path of length 100 from vertex 1 to 100. It will still take a long time traversing all of the poss... |
Apr 16, 2015 - 4:56:26 am UTC |
| ... |
Guru_Charis |
My program solves all test cases in a few milliseconds, but i am always getting that timeline expired error in the last test case and i' m wondering if that is a bug |
Apr 15, 2015 - 4:32:09 pm UTC |
