#716549 (C++17) No.1745 Selfish Spies 2 (à la Princess' Perfectionism)

提出ソース

結果

問題	No.1745 Selfish Spies 2 (à la Princess' Perfectionism)
ユーザー	haruki_K
提出日時	2021-11-15 00:09:20
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	RE
実行時間	-
コード長	10,251 bytes
コンパイル時間	2,664 ms
コンパイル使用メモリ	217,792 KB
実行使用メモリ	22,144 KB
最終ジャッジ日時	2024-05-07 16:16:23
合計ジャッジ時間	12,562 ms
ジャッジサーバーID （参考情報）	judge5 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,376 KB
testcase_02	AC	1 ms 5,376 KB
testcase_03	AC	2 ms 5,376 KB
testcase_04	AC	2 ms 5,376 KB
testcase_05	AC	2 ms 5,376 KB
testcase_06	AC	2 ms 5,376 KB
testcase_07	AC	2 ms 5,376 KB
testcase_08	AC	2 ms 5,376 KB
testcase_09	RE	-
testcase_10	RE	-
testcase_11	RE	-
testcase_12	RE	-
testcase_13	AC	2 ms 6,944 KB
testcase_14	AC	2 ms 6,944 KB
testcase_15	AC	2 ms 6,940 KB
testcase_16	RE	-
testcase_17	RE	-
testcase_18	AC	3 ms 6,940 KB
testcase_19	RE	-
testcase_20	AC	2 ms 6,940 KB
testcase_21	AC	2 ms 6,940 KB
testcase_22	RE	-
testcase_23	AC	2 ms 6,940 KB
testcase_24	AC	7 ms 6,940 KB
testcase_25	AC	2 ms 6,944 KB
testcase_26	RE	-
testcase_27	RE	-
testcase_28	AC	24 ms 6,940 KB
testcase_29	AC	4 ms 6,940 KB
testcase_30	AC	3 ms 6,944 KB
testcase_31	AC	3 ms 6,944 KB
testcase_32	AC	4 ms 6,940 KB
testcase_33	AC	26 ms 6,940 KB
testcase_34	AC	23 ms 6,944 KB
testcase_35	AC	27 ms 6,944 KB
testcase_36	AC	28 ms 6,940 KB
testcase_37	AC	27 ms 6,944 KB
testcase_38	AC	26 ms 6,944 KB
testcase_39	RE	-
testcase_40	AC	20 ms 6,940 KB
testcase_41	AC	19 ms 6,940 KB
testcase_42	AC	42 ms 8,832 KB
testcase_43	AC	59 ms 10,880 KB
testcase_44	AC	79 ms 13,184 KB
testcase_45	RE	-
testcase_46	RE	-
testcase_47	RE	-
testcase_48	RE	-
testcase_49	AC	171 ms 10,624 KB
testcase_50	AC	156 ms 9,856 KB
testcase_51	RE	-
testcase_52	AC	21 ms 6,272 KB
testcase_53	RE	-
testcase_54	AC	122 ms 13,056 KB
testcase_55	RE	-
testcase_56	AC	1,212 ms 13,056 KB
testcase_57	RE	-
testcase_58	RE	-

権限があれば一括ダウンロードができます

ソースコード

raw source code

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
#define int ll
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define repR(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i, n) for (int i = (int)(n); i >= 1; i--)
#define loop(i, a, B) for (int i = a; i B; i++)
#define loopR(i, a, B) for (int i = a; i B; i--)
#define all(x) begin(x), end(x)
#define allR(x) rbegin(x), rend(x)
#define rng(x, l, r) begin(x) + (l), begin(x) + (r)
#define pb push_back
#define eb emplace_back
#define fst first
#define snd second
template <class A, class B> constexpr auto mp(A &&a, B &&b) { return make_pair(forward<A>(a), forward<B>(b)); }
template <class... T> constexpr auto mt(T&&... x) { return make_tuple(forward<T>(x)...); }
template <class Int> auto constexpr inf_ = numeric_limits<Int>::max()/2-1;
auto constexpr INF32 = inf_<int32_t>;
auto constexpr INF64 = inf_<int64_t>;
auto constexpr INF   = inf_<int>;
#ifdef LOCAL
#include "debug.hpp"
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T, class Comp> struct pque : priority_queue<T, vector<T>, Comp> { vector<T> &data() { return this->c; } void clear() { this->c.clear(); } };
template <class T> using pque_max = pque<T, less<T>>;
template <class T> using pque_min = pque<T, greater<T>>;
template <class T, class = typename T::iterator, enable_if_t<!is_same<T, string>::value, int> = 0>
ostream& operator<<(ostream& os, T const& a) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, size_t N, enable_if_t<!is_same<T, char>::value, int> = 0>
ostream& operator<<(ostream& os, const T (&a)[N]) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = decltype(begin(declval<T&>())), class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &a) { for (auto& x : a) is >> x; return is; }
template <class T, class S> ostream& operator<<(ostream& os, pair<T, S> const& p) { return os << p.first << " " << p.second; }
template <class T, class S> istream& operator>>(istream& is, pair<T, S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint { template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); } };
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T, d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T, d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T, 0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T, d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T, d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > (T)y) { x = (T)y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < (T)y) { x = (T)y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b, e, typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) { return lower_bound(begin(v), end(v), x)-begin(v); }
template <class C, class T> int ubd(C const& v, T const& x) { return upper_bound(begin(v), end(v), x)-begin(v); }
constexpr int64_t mod(int64_t x, int64_t m) { assert(m > 0); return (x %= m) < 0 ? x+m : x; }
constexpr int64_t div_floor(int64_t x, int64_t y) { assert(y != 0); return x/y - ((x^y) < 0 and x%y); }
constexpr int64_t div_ceil(int64_t x, int64_t y) { assert(y != 0); return x/y + ((x^y) > 0 and x%y); }
constexpr int dx[] = { 1, 0, -1, 0, 1, -1, -1, 1 };
constexpr int dy[] = { 0, 1, 0, -1, 1, 1, -1, -1 };
constexpr int popcnt(ll x) { return __builtin_popcountll(x); }
mt19937_64 seed_{random_device{}()};
template <class Int> Int rand(Int a, Int b) { return uniform_int_distribution<Int>(a, b)(seed_); }
i64 irand(i64 a, i64 b) { return rand<i64>(a, b); } // [a, b]
u64 urand(u64 a, u64 b) { return rand<u64>(a, b); } //
template <class It> void shuffle(It l, It r) { shuffle(l, r, seed_); }
template <class V> V &operator--(V &v) { for (auto &x : v) --x; return v; }
template <class V> V &operator++(V &v) { for (auto &x : v) ++x; return v; }
// <<<
// >>> bipartite matching
struct BMatching {
    vector<int32_t> used, p, q;
    vector<vector<int32_t>> g;
    BMatching(int L, int R) : used(L, 0), p(L, -1), q(R, -1), g(L) {}
    void add_edge(int x, int y) { g[x].push_back(y);}
    bool dfs(int32_t x) {
        if (used[x]) return false;
        used[x] = 1;
        for (int y : g[x]) {
            if (q[y] < 0 or dfs(q[y])) {
                p[x] = y, q[y] = x;
                return true;
            }
        }
        return false;
    }
    int run() {
        int match = 0, update = 1;
        while (update) {
            update = 0; fill(used.begin(), used.end(), 0);
            rep (i, p.size()) if (p[i] < 0 and dfs(i)) update = 1, ++match;
        }
        return match;
    }
};
// <<<
// >>> scc
#ifndef EDGE_INFO
#define EDGE_INFO
constexpr int dest(int v) { return v; }
template <class E, class = decltype(declval<E>().to)>
constexpr int dest(E const& e) { return e.to; }
constexpr int cost(int) { return 1; }
template <class E, class = decltype(declval<E>().cost)>
constexpr auto cost(E const& e) { return e.cost; }
template <class E> using cost_t = decltype(cost(declval<E>()));
#endif
template <class E> struct SCC {
    vector<vector<E>> const& g;
    vector<int32_t> ord, low, st;
    int32_t time = 0, pos = 0, sz = 0;
    SCC(vector<vector<E>> const& g) : g(g), ord(g.size()), low(g.size()), st(g.size()) {
        rep (v, g.size()) if (ord[v] == 0) dfs(v);
        for (auto &x : ord) x += sz;
    }
    void dfs(int32_t v) {
        low[v] = ord[v] = ++time; st[pos++] = v;
        for (auto const& e : g[v]) {
            if (ord[dest(e)] == 0) {
                dfs(dest(e));
                chmin(low[v], low[dest(e)]);
            } else if (ord[dest(e)] > 0) {
                chmin(low[v], ord[dest(e)]);
            }
        }
        if (low[v] == ord[v]) {
            sz++; do ord[st[--pos]] = -sz; while (st[pos] != v);
        }
    }

    // t-sorted id
    int id(int v) const { return ord[v]; }
    int size() const { return sz; }
    vector<vector<int>> groups() const {
        vector<vector<int>> grp(sz);
        rep (v, g.size()) grp[ord[v]].push_back(v);
        return grp;
    }

    // no multiple edges, no self-loops
    // no edge information
    vector<vector<int>> graph() const {
        vector<vector<int>> ret(size());
        vector<int32_t> last(g.size(), -1);
        rep (v, g.size()) {
            for (auto const& e : g[v]) {
                const int32_t x = id(v), y = id(dest(e));
                if (x == y or last[y] == x) continue;
                last[y] = x;
                ret[x].push_back(y);
            }
        }
        return ret;
    }
};
template <class E> auto get_scc(vector<vector<E>> const& g) { return SCC<E>(g); }

// <<<
// >>> DM decomposition
struct DMdecomp {
    BMatching bm;
    vector<int> id;
    DMdecomp(int L, int R) : bm(L, R), id(L + R) {}
    void add_edge(int x, int y) { bm.add_edge(x, y); }
    void run() {
        bm.run();
        const int L = bm.p.size(), R = bm.q.size();
        fill(id.begin(), id.end(), 0);
        vector<int> st;
        rep (i, L) if (bm.p[i] < 0) {
            st.push_back(i);
            while (st.size()) {
                int x = st.back(); st.pop_back();
                if (id[x] < 0) continue;
                id[x] = -1;
                for (int y : bm.g[x]) {
                    id[L+y] = id[x];
                    if (bm.q[y] >= 0) st.push_back(bm.q[y]);
                }
            }
        }
        vector<vector<int32_t>> rg(R);
        rep (i, L) for (int j : bm.g[i]) rg[j].push_back(i);
        rep (j, R) if (bm.q[j] < 0) {
            st.push_back(j);
            while (st.size()) {
                int y = st.back(); st.pop_back();
                if (id[L+y] < 0) continue;
                id[L+y] = -2;
                for (int x : rg[y]) {
                    id[x] = id[L+y];
                    if (bm.p[x] >= 0) st.push_back(bm.p[x]);
                }
            }
        }

        dump(L, R, id);
        dump(bm.p);
        dump(bm.q);

        int cnt = 0;
        rep (i, L) if (id[i] >= 0) id[i] = id[L+bm.p[i]] = cnt++;
        vector<vector<int32_t>> G(cnt);
        rep (i, L) if (id[i] >= 0) {
            for (int j : bm.g[i]) {
                int x = id[i], y = id[L+j];
                if (x != y) G[x].push_back(y);
            }
        }
        auto scc = get_scc(G);
        int K = scc.size();

        rep (i, L+R) {
            if (id[i] == -2) id[i] = 0;
            else if (id[i] == -1) id[i] = K+1;
            else id[i] = scc.id(id[i])+1;
        }
    }
};
// <<<

int32_t main() {
    int n, m, L; cin >> n >> m >> L;
    vector<int> s(L), t(L);
    rep (i, L) cin >> s[i] >> t[i], --s[i], --t[i];

    DMdecomp dm(n, m);
    rep (i, L) dm.add_edge(s[i], t[i]);
    dm.run();

    rep (i, L) {
        int x = s[i], y = n+t[i];
        if (dm.id[x] != dm.id[y]) {
            cout << "No" << '\n';
        } else {
            cout << "Yes" << '\n';
        }
    }


}

yukicoder

結果

テストケース

ソースコード