Submission #44544823

---

Source Code Expand

// clang-format off
#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif

#define _overload3(_1,_2,_3,name,...) name
#define _REP(i,n) REPI(i,0,n)
#define REPI(i,a,b) for(int i=int(a);i<int(b);++i)
#define REP(...) _overload3(__VA_ARGS__,REPI,_REP,)(__VA_ARGS__)
#define _RREP(i,n) RREPI(i,n,0)
#define RREPI(i,a,b) for(int i=int(a);i>=int(b);--i)
#define RREP(...) _overload3(__VA_ARGS__,RREPI,_RREP,)(__VA_ARGS__)
#define ALL(a) (a).begin(),(a).end()
#define ALLR(a) (a).rbegin(),(a).rend()
typedef long long ll;
const int INF32 = 1001001001;
const long long INF64 = 1001001001001001001;
struct Init { Init() { ios::sync_with_stdio(0); cin.tie(0); cout << setprecision(15); }} init;
template<class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if (a > b) { a = b; return true; } return false; }
template<class T> T gcd(T x, T y){ return (x % y) ? gcd(y, x % y) : y; }
template<class T> T lcm(T x, T y){ return x / gcd(x, y) * y; }
template<class T, class... Ts> void output(const T& a, const Ts&... b) { cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T> void output(vector<T> v) { for (auto u : v) cout << u << ' '; cout << '\n'; };
void yesno(bool is_ok) { cout << (is_ok ? "yes" : "no") << '\n'; }
void YesNo(bool is_ok) { cout << (is_ok ? "Yes" : "No") << '\n'; }
void YESNO(bool is_ok) { cout << (is_ok ? "YES" : "NO") << '\n'; }

// clang-format on
int main() {
    int n, m;
    cin >> n >> m;
    vector<int> a(n), b(n);
    REP(i, m) cin >> a[i] >> b[i], --a[i], --b[i];
    int q;
    cin >> q;
    vector<tuple<int, int, int>> queries(q);
    vector<bool> stop(n, false);
    REP(i, q) {
        int t;
        cin >> t;
        if (t == 1) {
            int x;
            cin >> x;
            --x;
            queries[i] = {t, x, -1};
            stop[x] = true;
        } else {
            int u, v;
            cin >> u >> v;
            --u, --v;
            queries[i] = {t, u, v};
        }
    }
    reverse(ALL(queries));
    dsu uf(n);
    REP(i, m) {
        if (stop[i]) continue;
        if (uf.same(a[i], b[i])) continue;
        uf.merge(a[i], b[i]);
    }
    vector<bool> ans;
    for (auto [t, x, y] : queries) {
        if (t == 1) {
            if (!uf.same(a[x], b[x])) {
                uf.merge(a[x], b[x]);
            }
        } else {
            ans.push_back(uf.same(x, y));
        }
    }
    reverse(ALL(ans));
    for (bool v : ans) {
        YesNo(v);
    }
}

Submission Info

Judge Result