Try this test
1 100
4
1 1
2 1
3 1
4 1
1 2
3 4
0 0
0 1
5 1

Correct answer is:
3.0200000
4 1 2 3 4

Looks like stations can overlap (have same coordinates) while not being connected with underground!

in this test the footspeed is lower than one.
sorry for my poor english.

GOOD LUCK!!!

If the starting point A is a station but you go by feet, is the station a visited station. For example, what is the solution for the following:
100 101
3
0 0
0 10
1 0
1 2
2 3
0 0
0 0
1 0

1. Stations may not all be connected. You may have to walk on foot between stations.
2. A and B may be one of the stations or may even be the same point. Maybe the best route is from A to B is on foot without using any stations. Consider all cases.
3. Coordinates are floating points, not integer.
4. Simple dijsktra will work.
5. Use a map to store the node number of the points. If A or B are not one of the stations then give them n and n+1 or n+1 and n+2 (depending on indexing).

Спасибо парню из предыдущей ветки,лично мне это реально помогло
Короче смысл в том,что в 7 тесте либо координаты A совпадают с координатами какой-нибудь станции (или тоже самое с B),либо у нескольких станций одинаковые координаты.

Ну и прикол в том,что если вы строите матрицу смежности,то он будет считать что там нет пути, 0 же стоит

Hello guys,

those, who have wa on 7'th case may try to change output precision to some big number. As for me, it worked on 15 signs.

I have no idea why this happens ^,^

If ever dear admins may be interested in case, please compare:
id 4772942 has wa7
id 4772947 has ok (line 167).

Best regards, mq.

C++ Clang 14.

Read with BufferedReader not with StreamTokenizer. This was only mistake for me for > 100 tries :)

 Help please.I think my prog is OK and i think that is precision problem or something like that.


Edited by author 13.06.2011 12:04

Edited by author 13.06.2011 12:41

Edited by author 13.06.2011 13:27

adjacent table g

for N+2 points
  g[i][j] = time-of-foot
for connections
  g[i][j] = time-of-metro

And then I run shortest path. from 0 to n+1

Can somebody give me hint about this testcase.
Thanks!!!!



Edited by author 05.12.2010 23:32

I had WA 5 when I used type "single" (pascal; in C++ - float) for floating point number. After I have changed to "double" I have got AC.

[code was deleted by moderator :-)]

Edited by moderator 09.05.2004 00:06

please give me the test!

I know that the first test is like sample, so I passed
begin
  writeln('2.6346295');
  write('4 4 2 1 3');
end.
and got WA#2. And my REAL program get the same answer, but I have Crash (floating-point invalid operation) from Judge.
This is my program:
[Code deleted by author]
Please, answer me anybody!

Edited by author 24.01.2007 23:29

can the speed of traveling be greater then 300000km/sek ?

I mean, take the metro for a few stations, that exit, walk, and take the metro again ?
Thanks,
A.

Please give me some tests
Thanks.