E - Excting 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 m
(1≤m≤500) and n (1≤n≤50), where m is the number of translations of letters and n is the number of word pairs. Each of the next m lines contains two distinct space-separated letters a and b, indicating that the letter a can be translated to the letter b. Each ordered pair of letters (a,b) appears at most once. Following this are n lines, each containing a word pair to check. Translations and words use only lowercase letters ‘a’–‘z’, and each word contains at least 1 and at most 50

letters.
Output

For each pair of words, display yes if the two words match, and no otherwise.
Sample Input 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

Sample Output 1
yes
no
no
yes
yes

Sample Input 2
3 3
a c
b a
a b
aaa abc
abc aaa
acm bcm

Sample Output 2
yes
no
yes

题意：输入m和n，代表有m个翻译，和n句带翻译的两个单词，如果两个单词可以从前面的翻译成后面的，打印yes，否则no

//#include<bits/stdc++.h>
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<map>
#include<set>
#include<vector>
#include<queue>
#include<stdlib.h>
#include<cstring>
#include<string.h>
#include<string>
#include<math.h>
using namespace std ;
typedef long long ll;
#define MAXN 1005
#define INF 0x3f3f3f3f // µÈÓÚ1061109567
#define MALL (Qnode *)malloc(sizeof(Qnode));

char sh[MAXN], ch[MAXN];
int Find[30][30];
int main()
{
    int n, m;
    cin >> n >> m;
    memset(Find, 0, sizeof(Find));
    char a, b;
    for(int i=0; i<n; ++i)
    {
        getchar();
        scanf("%c %c", &a, &b);
        Find[a-'a'][b-'a'] = 1;//建立关系
    }
    for(int i=0; i<26; ++i)
        for(int j=0; j<26; ++j)
            if(Find[i][j] == 1)//i能找到j
                for(int k=0; k<26; ++k)//如果k能找到i，则k也可以找到j
                    if(Find[k][i] == 1)
                        Find[k][j]=1;
 	 for(int l=0; l<m; ++l)
    {
        scanf("%s%s", sh, ch);
        int les = strlen(sh);
        int lec = strlen(ch);
        int i=0, j=0, flag=0;
        while(i<les && j<lec && flag==0)
        {
            if(sh[i] == ch[j] || Find[sh[i]-'a'][ch[j]-'a'])
            {
                i++;
                j++;
            }
            else
                flag=1;
        }
        if(les == lec && flag == 0)
            cout << "yes" << '\n';
        else
            cout << "no" << '\n';
    }
    return 0;
}
        

没啥好说的，我居然想到用树存。。。。。。然后dfs。。。