Mahmoud wants to write a new dictionary that contains n words and relations between them. There are two types of relations: synonymy (i. e. the two words mean the same) and antonymy (i. e. the two words mean the opposite). From time to time he discovers a new relation between two words.
He know that if two words have a relation between them, then each of them has relations with the words that has relations with the other. For example, if like means love and love is the opposite of hate, then like is also the opposite of hate. One more example: if love is the opposite of hate and hate is the opposite of like, then love means like, and so on.
Sometimes Mahmoud discovers a wrong relation. A wrong relation is a relation that makes two words equal and opposite at the same time. For example if he knows that love means like and like is the opposite of hate, and then he figures out that hate means like, the last relation is absolutely wrong because it makes hate and like opposite and have the same meaning at the same time.
After Mahmoud figured out many relations, he was worried that some of them were wrong so that they will make other relations also wrong, so he decided to tell every relation he figured out to his coder friend Ehab and for every relation he wanted to know is it correct or wrong, basing on the previously discovered relations. If it is wrong he ignores it, and doesn't check with following relations.
After adding all relations, Mahmoud asked Ehab about relations between some words based on the information he had given to him. Ehab is busy making a Codeforces round so he asked you for help.
The first line of input contains three integers n, m and q (2 ≤ n ≤ 105, 1 ≤ m, q ≤ 105) where n is the number of words in the dictionary, mis the number of relations Mahmoud figured out and q is the number of questions Mahmoud asked after telling all relations.
The second line contains n distinct words a1, a2, ..., an consisting of small English letters with length not exceeding 20, which are the words in the dictionary.
Then m lines follow, each of them contains an integer t (1 ≤ t ≤ 2) followed by two different words xi and yi which has appeared in the dictionary words. If t = 1, that means xi has a synonymy relation with yi, otherwise xi has an antonymy relation with yi.
Then q lines follow, each of them contains two different words which has appeared in the dictionary. That are the pairs of words Mahmoud wants to know the relation between basing on the relations he had discovered.
All words in input contain only lowercase English letters and their lengths don't exceed 20 characters. In all relations and in all questions the two words are different.
First, print m lines, one per each relation. If some relation is wrong (makes two words opposite and have the same meaning at the same time) you should print "NO" (without quotes) and ignore it, otherwise print "YES" (without quotes).
After that print q lines, one per each question. If the two words have the same meaning, output 1. If they are opposites, output 2. If there is no relation between them, output 3.
See the samples for better understanding.
3 3 4
hate love like
1 love like
2 love hate
1 hate like
love like
love hate
like hate
hate like
YES
YES
NO
1
2
2
2
8 6 5
hi welcome hello ihateyou goaway dog cat rat
1 hi welcome
1 ihateyou goaway
2 hello ihateyou
2 hi goaway
2 hi hello
1 hi hello
dog cat
dog hi
hi hello
ihateyou goaway
welcome ihateyou
YES
YES
YES
YES
NO
YES
3
3
1
1
2
題意：給出n個單詞，m條定義，每條定義給出兩個單詞是近義詞還是反義詞，如果定義不成立就輸出NO，否則輸出YES，並建立關係。 然後是q次查詢，查詢給出的兩個單詞的關係，近義，反義或者未定義關係。
題解：一眼的帶權並查集裸題，由於是給出的單詞，不便於建立並查集關係，用map將單詞和數字對應起來就好了。
代碼如下：
#include<cstdio>
#include<cstring>
#include<map>
#include<algorithm>
using namespace std;
const int maxn = 1e5+10;
char a[30],b[30];
int tree[maxn*2];
int find(int x)
{
if(tree[x]==x)
return x;
return tree[x]=find(tree[x]);
}
void merge(int x,int y)
{
int fx=find(x);
int fy=find(y);
if(fx!=fy)
tree[fx]=fy;
}
int main()
{
int n,m,q,t;
while(scanf("%d%d%d",&n,&m,&q)!=EOF)
{
map<string,int>mp;
for(int i=1;i<=n;++i)
{
scanf("%s",a);
mp[a]=i;
}
for(int i=1;i<=2*n;++i)
tree[i]=i;
while(m--)
{
scanf("%d%s%s",&t,a,b);
int x,y;
x=mp[a];
y=mp[b];
if(t==1)
{
if(find(x+n)==find(y)||find(x)==find(y+n))
printf("NO\n");
else
{
printf("YES\n");
merge(x,y);
merge(x+n,y+n);
}
}
else
{
if(find(x)==find(y))
printf("NO\n");
else{
printf("YES\n");
merge(x+n,y);
merge(x,y+n);
}
}
}
while(q--)
{
scanf("%s%s",a,b);
int x,y;
x=mp[a];
y=mp[b];
if(find(x)==find(y))
puts("1");
else if(find(x)==find(y+n)||find(x+n)==find(y))
puts("2");
else
puts("3");
}
}
return 0;
}