Submission #47332193

---

Source Code Expand

#include <bits/stdc++.h>
#include <atcoder/modint>
#include <atcoder/dsu>

namespace {
using ModInt [[maybe_unused]] = atcoder::modint998244353;
using Num [[maybe_unused]] = long long int;
using Vec [[maybe_unused]] = std::vector<Num>;
using Set [[maybe_unused]] = std::set<Num>;
using Mset [[maybe_unused]] = std::multiset<Num>;
using Edges [[maybe_unused]] = std::vector<std::vector<Num>>;

template<typename T>
using Q [[maybe_unused]] = std::queue<T>;

template<typename T>
using PQ [[maybe_unused]] = std::priority_queue<T, std::vector<T>, std::greater<T>>;
}

void solve(std::istream& is, std::ostream& os) {
    Num n, m;
    is >> n >> m;

    Vec aset(m, 0);
    for(auto&& x : aset) {
        is >> x;
        --x;
    }

    Vec bset(m, 0);
    for(auto&& x : bset) {
        is >> x;
        --x;
    }

    atcoder::dsu tree(n*2);
    Edges edges(n);
    for(Num i{0}; i<m; ++i) {
        const auto a = aset.at(i);
        const auto b = bset.at(i);
        if (a == b) {
            os << "No\n";
            return;
        }

        const auto a0 = a * 2;
        const auto a1 = a0 | 1;
        const auto b0 = b * 2;
        const auto b1 = b0 | 1;
        tree.merge(a0, b1);
        tree.merge(a1, b0);
    }

    for(Num i{0}; i<n; ++i) {
        const auto i0 = i * 2;
        if (tree.same(i0, i0 | 1)) {
            os << "No\n";
            return;
        }
    }

    os << "Yes\n";
}

int main(void) {
    solve(std::cin, std::cout);
    return 0;
}

Submission Info

Judge Result