Wormhole

Wormhole

 

 

 注意精度，不要用long long 输出，用%.0f输出

AC_Code

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <string>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 65;
const int inf=0x3f3f3f3f;
const ll mod=1e9+7;

map<string,int>mp;
int n,w,q;
struct node{
    ll xi,yi,zi;
//    string s;
}a[maxn];
double f[maxn][maxn];
double h[maxn];
string s1[maxn], s2[maxn];

void floyd(){
    for(int k=0;k<n;k++){
        for(int i=0;i<n;i++){
            for(int j=0;j<n;j++){
                if( f[i][j]>f[i][k]+f[k][j]){
                    f[i][j]=f[i][k]+f[k][j];
                }
            }
        }
    }
}

void init(){
    for(int i=0;i<n;i++){
        for(int j=i+1;j<n;j++){
            ll x=abs(a[i].xi-a[j].xi);
            ll y=abs(a[i].yi-a[j].yi);
            ll z=abs(a[i].zi-a[j].zi);
            f[i][j]=(double)sqrt(1.0*x*x+1.0*y*y+1.0*z*z);
            f[j][i]=f[i][j];
        }
    }
}

int main()
{
    int t,cas=0;
    scanf("%d",&t);
    while( t-- ){
        string ss,sss;
        memset(a,0,sizeof(a));
        scanf("%d",&n);
        for(int i=0;i<n;i++){
            ll x,y,z;
            cin>>ss>>x>>y>>z;
            mp[ss]=i;
//            a.s = ss;
            a[i].xi = x;
            a[i].yi = y;
            a[i].zi = z;
        }
        init();
        scanf("%d",&w);
        for(int i=0;i<w;i++){
            cin>>ss>>sss;
            int u=mp[ss];
            int v=mp[sss];
            f[u][v]=0.0;
        }
        floyd();
        scanf("%d",&q);
        for(int i=0;i<q;i++){
            cin>>s1[i]>>s2[i];
            int u=mp[s1[i]];
            int v=mp[s2[i]];
            h[i]=f[u][v];
        }
        printf("Case %d:
", ++cas);
        for(int i=0;i<q;i++){
//            int u=mp[s1[i]];
//            int v=mp[s2[i]];
            cout<<"The distance from "<<s1[i]<<" to "<<s2[i]<<" is ";
            printf("%.0f",h[i]);
            cout<<" parsecs."<<endl;
        }
    }
    return 0;
}