提出 #71496334

---

ソースコード 拡げる

#include <bits/stdc++.h>

#include <atcoder/all>

using namespace std;
using namespace atcoder;

#define int long long
#define ALL(x) (x).begin(), (x).end()
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))

typedef pair<int, int> PI;
typedef pair<int, pair<int, int>> PII;
static const int INF = 1010000000000000017LL;
static const double eps = 1e-12;
static const double pi = 3.14159265358979323846;
static const int dx[4] = {1, -1, 0, 0};
static const int dy[4] = {0, 0, 1, -1};
static const int ddx[8] = {1, -1, 0, 0, 1, 1, -1, -1};
static const int ddy[8] = {0, 0, 1, -1, 1, -1, 1, -1};

template <class T>
inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T>
inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

int N, M, Q;

signed main() {
    cin >> N >> M;
    vector<vector<int>> A(N);
    for (int i = 0; i < M; ++i) {
        int u, v;
        cin >> u >> v;
        u--, v--;
        A[v].push_back(u);
    }
    cin >> Q;
    vector<bool> visited(N, false);
    while (Q--) {
        int q, v;
        cin >> q >> v;
        v--;
        if (q == 1) {
            if (!visited[v]) {
                visited[v] = true;
                queue<int> que;
                que.push(v);
                while (que.size() > 0) {
                    int q = que.front();
                    que.pop();
                    for (auto u : A[q]) {
                        if (visited[u]) {
                            continue;
                        }
                        visited[u] = true;
                        que.push(u);
                    }
                }
            }
        } else {
            if (visited[v]) {
                cout << "Yes" << endl;
            } else {
                cout << "No" << endl;
            }
        }
    }
}

提出情報

ジャッジ結果