Submission #47249750

---

Source Code Expand

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

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;
    }

    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;
        }

        edges[a].push_back(b);
        edges[b].push_back(a);
    }

    Vec colors(n, -1);
    for(Num i{0}; i<n; ++i) {
        if (colors.at(i) >= 0) {
            continue;
        }

        Q<std::pair<Num, Num>> q;
        q.push(std::make_pair(i, 0));
        colors.at(i) = 0;

        while(!q.empty()) {
            const auto [from, color] = q.front();
            q.pop();

            const auto next_color = 1 - color;
            for(const auto& next : edges[from]) {
                const auto c = colors.at(next);
                if (c < 0) {
                    colors.at(next) = next_color;
                    q.push(std::make_pair(next, next_color));
                } else {
                    if (c != next_color) {
                        os << "No\n";
                        return;
                    }
                }
            }
        }
    }

    os << "Yes\n";
}

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

Submission Info

Judge Result