問題ページ
考えたこと
- グラフのつなぎ方が2種類
- 蟻本の食物連鎖と実質同じ
- 頂点を2倍したunionfindを使って矛盾がなければつなぐという処理を繰り返す
- これでYES,NOには答えられる
- 単語の関係を答えるクエリはufでつながっているか確認すればよい
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using PII = pair<int, int>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
template<typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template<typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
template<typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }
template<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }
template<typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}
template<typename T,typename V> typename enable_if<is_class<T>::value==0>::type
fill_v(T &t, const V &v) { t=v; }
template<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type
fill_v(T &t, const V &v ) { for(auto &e:t) fill_v(e,v); }
template<class S,class T>
ostream &operator <<(ostream& out,const pair<S,T>& a){
out<<'('<<a.first<<','<<a.second<<')'; return out;
}
template<typename T>
istream& operator >> (istream& is, vector<T>& vec){
for(T& x: vec) {is >> x;} return is;
}
template<class T>
ostream &operator <<(ostream& out,const vector<T>& a){
out<<'['; for(T i: a) {out<<i<<',';} out<<']'; return out;
}
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
const int INF = 1<<30;
const ll LLINF = 1LL<<60;
const ll MOD = 1000000007;
struct UnionFind {
vector<int> par, s;
UnionFind(int n=2e5) { init(n); }
void init(int n) {
s.assign(n, 1); par.resize(n);
iota(par.begin(), par.end(), 0);
}
int find(int x) {
if(par[x] == x) return x;
return par[x] = find(par[x]);
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if(x == y) return;
if(s[x] < s[y]) par[x] = y, s[y] = s[x] + s[y];
else par[y] = x, s[x] = s[x] + s[y];
}
bool same(int x, int y) { return find(x) == find(y); }
int size(int x) { return s[find(x)]; }
};
signed main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
ll n, m, q;
cin >> n >> m >> q;
map<string,ll> mp;
REP(i, n) {
string s;
cin >> s;
mp[s] = i;
}
UnionFind uf(2*n);
REP(i, m) {
ll type;
string s, t;
cin >> type >> s >> t;
ll a = mp[s], b = mp[t];
if(type == 1) {
if(uf.same(a*2, b*2+1)) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
uf.unite(a*2, b*2);
uf.unite(a*2+1, b*2+1);
}
} else {
if(uf.same(a*2, b*2)) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
uf.unite(a*2, b*2+1);
uf.unite(a*2+1, b*2);
}
}
}
REP(i, q) {
string s, t;
cin >> s >> t;
ll a = mp[s], b = mp[t];
if(uf.same(a*2, b*2)) cout << 1 << endl;
else if(uf.same(a*2, b*2+1)) cout << 2 << endl;
else cout << 3 << endl;
}
return 0;
}