Secret Chamber at Mount Rushmore

By now you have probably heard that there is a spectacular stone sculpture featuring four famous U.S. presidents at Mount Rushmore. However, very few people know that this monument contains a secret chamber. This sounds like something out of a plot of a Hollywood movie, but the chamber really exists. It can be found behind the head of Abraham Lincoln and was designed to serve as a Hall of Records to store important historical U.S. documents and artifacts. Historians claim that the construction of the hall was halted in 1939 and the uncompleted chamber was left untouched until the late 1990s, but this is not the whole truth.

In 1982, the famous archaeologist S. Dakota Jones secretly visited the monument and found that the chamber actually was completed, but it was kept confidential. This seemed suspicious and after some poking around, she found a hidden vault and some documents inside. Unfortunately, these documents did not make any sense and were all gibberish. She suspected that they had been written in a code, but she could not decipher them despite all her efforts.

Earlier this week when she was in the area to follow the ACM-ICPC World Finals, Dr. Jones finally discovered the key to deciphering the documents, in Connolly Hall of SDSM&T. She found a document that contains a list of translations of letters. Some letters may have more than one translation, and others may have no translation. By repeatedly applying some of these translations to individual letters in the gibberish documents, she might be able to decipher them to yield historical U.S. documents such as the Declaration of Independence and the Constitution. She needs your help.

You are given the possible translations of letters and a list of pairs of original and deciphered words. Your task is to verify whether the words in each pair match. Two words match if they have the same length and if each letter of the first word can be turned into the corresponding letter of the second word by using the available translations zero or more times.

Input

The first line of input contains two integers mm (1≤m≤5001≤m≤500) and nn (1≤n≤501≤n≤50), where mm is the number of translations of letters and nn is the number of word pairs. Each of the next mm lines contains two distinct space-separated letters aa and bb, indicating that the letter aa can be translated to the letter bb. Each ordered pair of letters (a,b)(a,b) appears at most once. Following this are nn lines, each containing a word pair to check. Translations and words use only lowercase letters ‘a’–‘z’, and each word contains at least 11 and at most 5050 letters.

Output

For each pair of words, display yes if the two words match, and no otherwise.

Sample Input 1	Sample Output 1
9 5 c t i r k p o c r o t e t f u h w p we we can the work people it of out the	yes no no yes yes

Sample Input 2	Sample Output 2
3 3 a c b a a b aaa abc abc aaa acm bcm	yes no yes

比赛的时候没有看懂题意，题目的意思就是有m组字母，n组词，每组的前一个字母可以推出后一个字母，并且，如果a可以转换为b，b可以转化为c，那么a也可以转换为c。 n组词，如果前者经过转换变为后者输出yes，否则输出no；

#include <iostream>
#include<stdio.h>
#include<algorithm>
#include<string>
#include<string.h>
#include<map>
#include<queue>
using namespace std;
int main()
{
    int m,n;
    cin>>m>>n;
    int a[26][26];
    memset(a,0,sizeof(a));
    for(int i=0;i<26;i++)
        a[i][i]=1;//不用转换
    for(int i=0; i<m; i++)
    {
       string s3,s4;
       cin>>s3>>s4;
       a[s3[0]-'a'][s4[0]-'a']=1;
    }
    for(int k=0;k<26;k++)
        for(int i=0;i<26;i++)
        for(int j=0;j<26;j++)//a->b,b->c,a->c;
    {
        if(!a[i][j])
        {
            if(a[i][k]&&a[k][j])
                a[i][j]=1;
        }
    }
    for(int i=0; i<n; i++)
    {
        int flag=0;
        string s1,s2;
        cin>>s1>>s2;
        if(s1.size()!=s2.size())
        {
            printf("no\n");
            continue;
        }
        for(int j=0; j<s1.size(); j++)
        {
            if(!a[s1[j]-'a'][s2[j]-'a'])
            {
               flag=0;
               printf("no\n");
               break;
            }
            flag=1;
        }
        if(flag)
            printf("yes\n");
    }
}