提出 #68766271

---

ソースコード 拡げる

#include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
using namespace __gnu_pbds;
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
#define rep(i, m, n) for (ll i = (ll)m; i < (ll)n; i++)
#define drep(i, m, n) for (ll i = m - 1; i >= n; i--)
#define Endl endl
#define all(a) a.begin(), a.end()
#define pr(i, j) make_pair(i, j)
#define isin(x, l, r) (l <= x && x < r)
#define chmin(a, b) a = min(a, b)
#define chmax(a, b) a = max(a, b)
#define srt(ar) sort(ar.begin(), ar.end())
#define rev(ar) reverse(ar.begin(), ar.end())
#define jge(f, s, t) cout << (f ? s : t) << endl
template <typename T>
using ordered_set = tree<T, null_type, std::less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#define printar(ar)             \
    do                          \
    {                           \
        for (auto dbg : ar)     \
        {                       \
            cout << dbg << " "; \
        }                       \
        cout << endl;           \
    } while (0)
const ll inf = 1e18;
const ld pi = 3.14159265358979;
const ld eps = 1e-9;
template <class T, ll n, ll idx = 0>
auto make_vec(const ll (&d)[n], const T &init) noexcept
{
    if constexpr (idx < n)
        return std::vector(d[idx], make_vec<T, n, idx + 1>(d, init));
    else
        return init;
}

template <class T, ll n>
auto make_vec(const ll (&d)[n]) noexcept
{
    return make_vec(d, T{});
}
template <class T>
size_t HashCombine(const size_t seed, const T &v)
{
    return seed ^ (std::hash<T>()(v) + 0x9e3779b9 + (seed << 6) + (seed >> 2));
}
/* pair用 */
template <class T, class S>
struct std::hash<std::pair<T, S>>
{
    size_t operator()(const std::pair<T, S> &keyval) const noexcept
    {
        return HashCombine(std::hash<T>()(keyval.first), keyval.second);
    }
};
/* vector用 */
template <class T>
struct std::hash<std::vector<T>>
{
    size_t operator()(const std::vector<T> &keyval) const noexcept
    {
        size_t s = 0;
        for (auto &&v : keyval)
            s = HashCombine(s, v);
        return s;
    }
};
/* tuple用 */
template <int N>
struct HashTupleCore
{
    template <class Tuple>
    size_t operator()(const Tuple &keyval) const noexcept
    {
        size_t s = HashTupleCore<N - 1>()(keyval);
        return HashCombine(s, std::get<N - 1>(keyval));
    }
};
template <>
struct HashTupleCore<0>
{
    template <class Tuple>
    size_t operator()(const Tuple &keyval) const noexcept { return 0; }
};
template <class... Args>
struct std::hash<std::tuple<Args...>>
{
    size_t operator()(const tuple<Args...> &keyval) const noexcept
    {
        return HashTupleCore<tuple_size<tuple<Args...>>::value>()(keyval);
    }
};
template <typename Type3>
class union_find
{
private:
    vector<Type3> graph;
    vector<Type3> sum;

public:
    union_find(Type3 n)
    {
        graph.resize(n);
        sum.resize(n);
        for (int i = 0; i < n; i++)
        {
            graph[i] = i;
            sum[i] = 1;
        }
    }
    Type3 root(Type3 n)
    {
        if (graph[n] == n)
            return n;
        else
        {
            graph[n] = root(graph[n]);
            return graph[n];
        }
    }
    void debug()
    {
        for (unsigned i = 0; i < graph.size(); i++)
        {
            cout << graph[i] << " ";
        }
        cout << endl;
        for (unsigned i = 0; i < graph.size(); i++)
        {
            cout << sum[i] << " ";
        }
        cout << endl;
    }
    void line(Type3 m, Type3 n)
    {
        if (check(m, n))
            return;
        sum[root(m)] += sum[root(n)];
        sum[root(n)] = 0;
        graph[root(n)] = root(m);
        graph[n] = root(m);
    }
    Type3 size(Type3 n)
    {
        return sum[root(n)];
    }
    bool check(Type3 m, Type3 n)
    {
        return root(m) == root(n);
    }
};

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    ll n, q;
    cin >> n >> q;
    union_find<ll> uf(n);
    vector<bool> f(n);
    vector<ll> c(n);
    rep(i, 0, q)
    {
        ll op;
        cin >> op;
        if (op == 1)
        {
            ll u, v;
            cin >> u >> v;
            u--;
            v--;
            ll A = uf.root(u);
            ll B = uf.root(v);
            uf.line(u, v);
            if (A != B)
            {
                c[uf.root(u)] = c[A] + c[B];
            }
        }
        else if (op == 2)
        {
            ll v;
            cin >> v;
            v--;
            if (f[v])
            {
                c[uf.root(v)]--;
            }
            else
            {
                c[uf.root(v)]++;
            }
            f[v] = !f[v];
        }
        else
        {
            ll v;
            cin >> v;
            v--;
            if (c[uf.root(v)] > 0)
            {
                cout << "Yes" << Endl;
            }
            else
            {
                cout << "No" << Endl;
            }
        }
    }
}

提出情報

ジャッジ結果