10472 - Fastest Vs Cheapest

All about problems in Volume 104. If there is a thread about your problem, please use it. If not, create one with its number in the subject.

Moderator: Board moderators

User avatar
Maxim
New poster
Posts: 38
Joined: Tue Aug 27, 2002 12:36 am
Location: Croatia
Contact:

Couple of questions

Post by Maxim » Sun May 04, 2003 11:08 pm

I have a couple of questions:

1. When there is more than one edge between A and B of the same type (N and A, or M and A), should only one with the shortest distance be considered?
2. Is time needed to travel from intersection to itself 0 (same doubt about fare)?

Maxim

User avatar
Maxim
New poster
Posts: 38
Joined: Tue Aug 27, 2002 12:36 am
Location: Croatia
Contact:

Post by Maxim » Mon May 05, 2003 12:46 am

Please ignore my recently asked questions. My program had a stupid bug. When checking if destination is reachable, I did the computation and at the end of function, I wrote something like:
[c]if(!reached[destination]) return 0;[/c]instead of[c]return reached[destination];[/c]

I suppose value returned by function was undefined.

Thanks to kmhasan.

Maxim

Articuno
Learning poster
Posts: 78
Joined: Sun Nov 30, 2008 5:00 pm
Location: IUT-OIC, Dhaka, Bangladesh

Re: 10472 - Fastest vs Cheapest

Post by Articuno » Mon Dec 14, 2009 11:06 pm

Can anyone give me some test cases please? I am getting WA........ Someone help :(
May be tomorrow is a better day............ :)

Post Reply

Return to “Volume 104 (10400-10499)”