友谊赛

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <map>
#include <string>
#include <algorithm>
using namespace std;
FILE *fin=fopen("friendly.in","r"),*fout=fopen("friendly.out","w");
long n,m,qn;
struct pat{long x,y,s;} a[100005];
bool operator <(pat a,pat b){
    return a.s<b.s;
}
long mb,mc,bh[100005],h[100005];
struct pat2{long lh,to,s,h;} b[200005];
void newb(long x,long y,long s){
    mb++; b[mb].to=y; b[mb].s=s; b[mb].lh=bh[x]; bh[x]=mb;
    mb++; b[mb].to=x; b[mb].s=s; b[mb].lh=bh[y]; bh[y]=mb;
}
map<string,long> M;
struct xxx{long s,h;} d[100005][20];
struct UFS{
    long n,fa[1000005];
    void init(long nn){
        n=nn;
        for (long i=0;i<nn;i++) fa[i]=i;
    }
    long root(long p){
        if (fa[p]!=p) fa[p]=root(fa[p]);
        return fa[p];
    }
    void uni(long x,long y){
        fa[root(x)]=root(y);
    }
}U;
inline void rut(string &s,char cc){
    char c;
    s="";
    for(fscanf(fin,"%c",&c);c!=cc&&!feof(fin);fscanf(fin,"%c",&c)) s+=c;
}
void init(){
    long i;
    string s;
    fscanf(fin,"%ld%ld\n",&n,&m);
    M.clear();
    for (i=0;i<n;i++){
        rut(s,‘\n‘);
        M[s]=i;
        //cout<<s<<endl;
    }
    for (i=0;i<m;i++){
        rut(s,‘ ‘); a[i].x=M[s]; //cout<<s<<endl;
        rut(s,‘ ‘); a[i].y=M[s]; //cout<<s<<endl;
        fscanf(fin,"%ld\n",&(a[i].s)); //cout<<a[i].s<<endl;
        //cout<<a[i].x<<‘ ‘<<a[i].y<<‘ ‘<<a[i].s<<endl;
    }
    mb=0;
    for (i=0;i<n;i++) bh[i]=0;
}
void Kruskal(){
    sort(a,a+m);
    U.init(n);
    for (long i=0;i<m;i++)
        if (U.root(a[i].x)!=U.root(a[i].y)){
            U.uni(a[i].x,a[i].y);
            newb(a[i].x,a[i].y,a[i].s);
            cout<<a[i].x<<‘ ‘<<a[i].y<<‘ ‘<<a[i].s<<endl;
        }
}
void dinit(){
    long i,t,k,p=0,q=1,Q[100005],P;
    bool f[100005];
    memset(f,0,sizeof(f));
    d[0][0].s=0; d[0][0].h=-1;
    h[0]=0; f[0]=1; Q[0]=0;
    while (p<q){
        P=Q[p];
        for (i=bh[P];i>0;i=b[i].lh){
            t=b[i].to;
            if (!f[t]){
                f[t]=1;
                Q[q++]=t;
                d[t][0].s=b[i].s;
                d[t][0].h=P;
                h[t]=h[P]+1;
            }
        }
        p++;
    }
    for (k=1;k<20;k++)
        for (i=0;i<n;i++){
            t=d[i][k-1].h;
            if (t>-1){
                d[i][k].h=d[t][k-1].h;
                d[i][k].s=max(d[i][k-1].s,d[t][k-1].s);
            }else d[i][k].h=-1;
        }
}
void tr(){
    long i,j,k,p,q,pp,qq,ans;
    string s;
    fscanf(fin,"%ld\n",&qn);
    for (i=0;i<qn;i++){
        rut(s,‘ ‘); p=M[s]; //cout<<s<<endl;
        rut(s,‘\n‘); q=M[s]; //cout<<s<<endl;
        //cout<<p<<‘ ‘<<q<<endl;
        ans=0;
        if (h[p]<h[q]) {k=p;p=q;q=k;}
        for (j=0,k=h[p]-h[q];k>0;j++,k>>=1)
            if (k%2==1){
                if (ans<d[p][j].s) ans=d[p][j].s;
                p=d[p][j].h;
            }
        //cout<<h[p]<<‘ ‘<<h[q]<<endl;
        if (p==q){
            fprintf(fout,"%ld\n",ans);
            continue;
        }
        pp=p; qq=q;
        for (j=19;j>=0;j--)
            if (d[pp][j].h>-1){
                if (d[pp][j].h==d[qq][j].h)
                    k=d[pp][j].h;
                else{
                    pp=d[pp][j].h;
                    qq=d[qq][j].h;
                }
            }
        for (j=0,k=h[p]-h[k];k>0;j++,k>>=1)
            if (k%2==1){
                if (ans<d[p][j].s) ans=d[p][j].s;
                if (ans<d[q][j].s) ans=d[q][j].s;
                p=d[p][j].h;
                q=d[q][j].h;
            }
        fprintf(fout,"%ld\n",ans);
    }
}
int main(){
    init();
    Kruskal();
    dinit();
    tr();
    fclose(fin);
    fclose(fout);
    return 0;
}