Similar to a previous problem I wrote, but this one has a trap, rounding each distance.
//
// GGGGGGGGGGGGG CCCCCCCCCCCCC AAA
// GGG::::::::::::G CCC::::::::::::C A:::A
// GG:::::::::::::::G CC:::::::::::::::C A:::::A
// G:::::GGGGGGGG::::G C:::::CCCCCCCC::::C A:::::::A
// G:::::G GGGGGG C:::::C CCCCCC A:::::::::A
//G:::::G C:::::C A:::::A:::::A
//G:::::G C:::::C A:::::A A:::::A
//G:::::G GGGGGGGGGGC:::::C A:::::A A:::::A
//G:::::G G::::::::GC:::::C A:::::A A:::::A
//G:::::G GGGGG::::GC:::::C A:::::AAAAAAAAA:::::A
//G:::::G G::::GC:::::C A:::::::::::::::::::::A
// G:::::G G::::G C:::::C CCCCCC A:::::AAAAAAAAAAAAA:::::A
// G:::::GGGGGGGG::::G C:::::CCCCCCCC::::C A:::::A A:::::A
// GG:::::::::::::::G CC:::::::::::::::C A:::::A A:::::A
// GGG::::::GGG:::G CCC::::::::::::C A:::::A A:::::A
// GGGGGG GGGG CCCCCCCCCCCCCAAAAAAA AAAAAAA
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <string\>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
#include <ctime>
using namespace std;
#ifdef DEBUG
#define debug(...) printf("DEBUG: "),printf(\_\_VA\_ARGS\_\_)
#define gettime() end\_time=clock();printf("now running time is %.7f\\n",(float)(end\_time - start\_time)/CLOCKS\_PER\_SEC);
#else
#define debug(...)
#define gettime()
#endif
typedef unsigned int uint;
typedef long long int Int;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\\n")
#define I\_de(x,n)for(int i=0;i<n;i++)printf("%d ",x\[i\]);Pln()
#define De(x)printf(#x"%d\\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\\
printf("%d ",dp\[htx\]\[hty\]);}Pln();}
#define M 105
#define PII pair<int,int\>
#define PB push\_back
#define oo (1<<29)
#define Set\_oo 0x3f
#define FOR(it,c) for(vector<PII>::iterator it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
clock\_t start\_time=clock(), end\_time;
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
int tmp=min(x,y);
return min(tmp,z);
}
int max3(int x,int y,int z){
int tmp=max(x,y);
return max(tmp,z);
}
int n,m,q;
map<string,int\> sid;
struct citys{
double lon,lat;
}city\[M\];
int mz\[M\]\[M\];
double r=6378;
double pi=3.141592653589793;
double dis(int x,int y){
double lon1=city\[x\].lon;
double lat1=city\[x\].lat;
double lon2=city\[y\].lon;
double lat2=city\[y\].lat;
double dlon=lon2-lon1;
double dlat=lat2-lat1;
double a=pow((sin(dlat/2)),2)+cos(lat1)\*cos(lat2)\*pow(sin(dlon/2),2);
double c=2\*atan2(sqrt(a),sqrt(1-a));
return r\*c;
}
void solve(){
for(int k=0;k<n;k++){
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(mz\[i\]\[k\]+mz\[k\]\[j\]<mz\[i\]\[j\]){
mz\[i\]\[j\]=mz\[i\]\[k\]+mz\[k\]\[j\];
}
}
}
}
char str\[1000\],str2\[1000\];
while(q--){
scanf("%s%s",str,str2);
int x=sid\[str\],y=sid\[str2\];
if(mz\[x\]\[y\]==oo)printf("no route exists\\n");
else printf("%d km\\n",mz\[x\]\[y\]);
}
}
int main() {
ios\_base::sync\_with\_stdio(0);
bool f=true;
int ff=0;
while(~scanf("%d%d%d",&n,&m,&q)&&n+m+q){
fill(&mz\[0\]\[0\],&mz\[M-1\]\[M-1\],oo);
sid.clear();
char str\[1000\],str2\[1000\];
for(int i=0;i<n;i++){
scanf("%s%lf%lf",str,&city\[i\].lat,&city\[i\].lon);
city\[i\].lat=city\[i\].lat\*pi/180;
city\[i\].lon=city\[i\].lon\*pi/180;
sid\[str\]=i;
}
for(int i=0;i<m;i++){
scanf("%s%s",str,str2);
int x=sid\[str\],y=sid\[str2\];
mz\[x\]\[y\]=dis(x,y)+0.5;
}
if(!f)Pln();
printf("Case #%d\\n",++ff);
solve();
f=false;
}
}