1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
|
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class B15723 {
static int N,M, cnt=0;
static char a,b;
static int[] parent;
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringBuilder sb = new StringBuilder();
StringTokenizer st;
N = Integer.parseInt(br.readLine());
parent = new int[27];
for (int i = 0; i < N; i++) {
st = new StringTokenizer(br.readLine()," ");
a = st.nextToken().charAt(0);
st.nextToken();
b = st.nextToken().charAt(0);
parent[a-'a'+1] = b-'a'+1;
}
M = Integer.parseInt(br.readLine());
for (int i = 0; i < M; i++) {
st = new StringTokenizer(br.readLine()," ");
a = st.nextToken().charAt(0);
st.nextToken();
b = st.nextToken().charAt(0);
a-=('a'-1);
b-=('a'-1);
// 부모를 찾는 과정
while(a!=b && parent[a]!=0) {
a = (char)parent[a];
}
sb.append(a==b?'T':'F').append("\n");
}
System.out.println(sb);
}
}
|