1283. Globetrotter

单点时限: 2.0 sec

内存限制: 256 MB

As a member of an ACM programming team you’ll soon find yourself always traveling around the world: Zürich, Philadelphia, San José, Atlanta,… from 1999 on the Contest Finals even will be on a different continent each year, so one day you might get to Japan or Australia.

At the contest site it would be interesting to know how many miles you are away from home. For this sake, your job is to write a program to compute the geographical distance between two given locations on the Earth’s surface.

We assume that the Earth is a perfect sphere with a radius of exactly $6378$ km. The geographical distance between $A$ and $B$ is the length of the geodetic line segment connecting $A$ and $B$.

The geodetic line segment between two points on a sphere is the shortest connecting curve lying entirely in the surface of the sphere.

The value of $\pi$ is approximately $3.141592653589793$.

输入格式

The input will consist of two parts: a list of cities and a list of queries.

City List

The city list consists of up to $100$ lines, one line per city. Each line will contain a string $c_i$ and two real numbers $lati$ and $longi$, representing the city name, its latitude and its longitude, respectively.

The city name will be shorter than $30$ characters and will not contain white-space characters.

The latitude will be between $-90$ (South Pole) and $+90$ (North Pole). The longitude will be between $-180$ and $+180$ where negative numbers denote locations west of the meridian and positive numbers denote locations east of the meridian. (The meridian passes through Greenwich, London.)

The city list will be terminated by a line consisting of a single #.

Query List

Each line will contain two city names $A$ and $B$.

The query list will be terminated by the line # #.

输出格式

For each query, print a line saying A - B where $A$ and $B$ are replaced by the city names. Then print a line saying x km where $x$ is replaced by the geographical distance (in km) between the two cities, rounded to the nearest integer.

If one of the cities in the query didn’t occur in the city list, print a line saying Unknown instead. Print a blank line after each query.

样例

Input
Ulm 48.700 10.500
Freiburg 47.700 9.500
Philadelphia 39.883 -75.250
SanJose 37.366 -121.933
NorthPole 90 0
SouthPole -90 0
#
Ulm Philadelphia
Ulm SanJose
Freiburg Philadelphia
Freiburg SanJose
Ulm Freiburg
SanJose Philadelphia
Ulm LasVegas
Ulm Ulm
Ulm NorthPole
Ulm SouthPole
NorthPole SouthPole
# #
Output
Ulm - Philadelphia
6536 km
Ulm - SanJose
9367 km
Freiburg - Philadelphia
6519 km
Freiburg - SanJose
9412 km
Ulm - Freiburg
134 km
SanJose - Philadelphia
4023 km
Ulm - LasVegas
Unknown
Ulm - Ulm
0 km
Ulm - NorthPole
4597 km
Ulm - SouthPole
15440 km
NorthPole - SouthPole
20037 km

5 人解决,14 人已尝试。

5 份提交通过,共有 35 份提交。

8.4 EMB 奖励。

创建: 12 年,11 月前.

修改: 2 年,5 月前.

最后提交: 1 年,9 月前.

来源: Ulm Local 1997

题目标签