bzoj4956: [Wf2017]Secret Chamber at Mount Rushmore

F......loyd?

这范围也是.....

然而大了也不会....

#include<cstdio>
#include<iostream>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<cmath>
using namespace std;
int mp[][];
char s1[],s2[];
int main()
{
    int n,m;
    scanf("%d%d",&m,&n);
    memset(mp,,sizeof(mp));
    for(int i=;i<=;i++)mp[i][i]=;
    for(int i=;i<=m;i++)
    {
        scanf("%s%s",s1+,s2+);
        mp[s1[]-'a'+][s2[]-'a'+]=;
    }

    for(int k=;k<=;k++)
        for(int i=;i<=;i++)
            if(k!=i)
                for(int j=;j<=;j++)
                    if(i!=j&&k!=j)
                        mp[i][j]=min(mp[i][j],mp[i][k]+mp[k][j]);
    while(n--)
    {
        scanf("%s%s",s1+,s2+);
        int len1=strlen(s1+),len2=strlen(s2+);
        if(len1!=len2){printf("no\n");continue;}

        bool bk=false;
        for(int i=;i<=len1;i++)
            if(mp[s1[i]-'a'+][s2[i]-'a'+]>){bk=true;break;}

        if(bk==false)printf("yes\n");
        else printf("no\n");
    }
    return ;
}