#997622 (C++23) No.2822 Lights Up! (Tree Edition)

提出ソース

結果

問題	No.2822 Lights Up! (Tree Edition)
ユーザー	hitonanode
提出日時	2024-07-26 21:50:35
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	51 ms / 2,000 ms
コード長	9,011 bytes
コンパイル時間	2,480 ms
コンパイル使用メモリ	198,520 KB
実行使用メモリ	11,904 KB
最終ジャッジ日時	2024-07-26 21:50:42
合計ジャッジ時間	6,838 ms
ジャッジサーバーID （参考情報）	judge1 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	2 ms 6,820 KB
testcase_02	AC	48 ms 11,520 KB
testcase_03	AC	48 ms 11,520 KB
testcase_04	AC	50 ms 11,904 KB
testcase_05	AC	50 ms 11,392 KB
testcase_06	AC	51 ms 11,520 KB
testcase_07	AC	51 ms 11,392 KB
testcase_08	AC	27 ms 6,940 KB
testcase_09	AC	46 ms 11,008 KB
testcase_10	AC	36 ms 8,320 KB
testcase_11	AC	27 ms 7,936 KB
testcase_12	AC	29 ms 6,944 KB
testcase_13	AC	21 ms 6,940 KB
testcase_14	AC	30 ms 7,552 KB
testcase_15	AC	32 ms 7,296 KB
testcase_16	AC	3 ms 6,940 KB
testcase_17	AC	3 ms 6,940 KB
testcase_18	AC	6 ms 6,940 KB
testcase_19	AC	3 ms 6,940 KB
testcase_20	AC	4 ms 6,940 KB
testcase_21	AC	5 ms 6,940 KB
testcase_22	AC	5 ms 6,940 KB
testcase_23	AC	5 ms 6,940 KB
testcase_24	AC	4 ms 6,944 KB
testcase_25	AC	3 ms 6,940 KB
testcase_26	AC	5 ms 6,944 KB
testcase_27	AC	2 ms 6,944 KB
testcase_28	AC	4 ms 6,944 KB
testcase_29	AC	6 ms 6,944 KB
testcase_30	AC	5 ms 6,940 KB
testcase_31	AC	3 ms 6,940 KB
testcase_32	AC	6 ms 6,944 KB
testcase_33	AC	6 ms 6,940 KB
testcase_34	AC	6 ms 6,944 KB
testcase_35	AC	6 ms 6,940 KB
testcase_36	AC	6 ms 6,940 KB
testcase_37	AC	6 ms 6,940 KB
testcase_38	AC	6 ms 6,944 KB
testcase_39	AC	6 ms 6,940 KB
testcase_40	AC	6 ms 6,940 KB
testcase_41	AC	6 ms 6,940 KB
testcase_42	AC	6 ms 6,944 KB
testcase_43	AC	6 ms 6,944 KB
testcase_44	AC	6 ms 6,944 KB
testcase_45	AC	6 ms 6,940 KB
testcase_46	AC	6 ms 6,944 KB
testcase_47	AC	6 ms 6,944 KB
testcase_48	AC	2 ms 6,940 KB
testcase_49	AC	2 ms 6,944 KB
testcase_50	AC	2 ms 6,944 KB
testcase_51	AC	2 ms 6,940 KB
testcase_52	AC	2 ms 6,944 KB
testcase_53	AC	2 ms 6,940 KB
testcase_54	AC	2 ms 6,944 KB
testcase_55	AC	2 ms 6,944 KB
testcase_56	AC	2 ms 6,944 KB
testcase_57	AC	2 ms 6,940 KB
testcase_58	AC	2 ms 6,940 KB
testcase_59	AC	2 ms 6,944 KB
testcase_60	AC	2 ms 6,940 KB
testcase_61	AC	2 ms 6,940 KB
testcase_62	AC	2 ms 6,940 KB
testcase_63	AC	2 ms 6,940 KB
testcase_64	AC	2 ms 6,940 KB
testcase_65	AC	3 ms 6,944 KB
testcase_66	AC	3 ms 6,944 KB
testcase_67	AC	2 ms 6,940 KB
testcase_68	AC	2 ms 6,944 KB
testcase_69	AC	2 ms 6,940 KB
testcase_70	AC	2 ms 6,944 KB
testcase_71	AC	2 ms 6,940 KB
testcase_72	AC	2 ms 6,940 KB
testcase_73	AC	2 ms 6,940 KB
testcase_74	AC	2 ms 6,940 KB
testcase_75	AC	2 ms 6,944 KB
testcase_76	AC	2 ms 6,944 KB
testcase_77	AC	2 ms 6,940 KB
testcase_78	AC	2 ms 6,944 KB
testcase_79	AC	2 ms 6,940 KB
testcase_80	AC	2 ms 6,940 KB
testcase_81	AC	2 ms 6,944 KB
testcase_82	AC	2 ms 6,940 KB
testcase_83	AC	2 ms 6,940 KB
testcase_84	AC	2 ms 6,940 KB
testcase_85	AC	2 ms 6,940 KB
testcase_86	AC	2 ms 6,944 KB
testcase_87	AC	2 ms 6,944 KB
testcase_88	AC	2 ms 6,940 KB
testcase_89	AC	2 ms 6,940 KB
testcase_90	AC	2 ms 6,944 KB
testcase_91	AC	2 ms 6,944 KB
testcase_92	AC	2 ms 6,940 KB
testcase_93	AC	2 ms 6,940 KB
testcase_94	AC	2 ms 6,940 KB
testcase_95	AC	2 ms 6,944 KB
testcase_96	AC	2 ms 6,940 KB
testcase_97	AC	2 ms 6,944 KB
testcase_98	AC	2 ms 6,940 KB
testcase_99	AC	2 ms 6,940 KB
testcase_100	AC	2 ms 6,940 KB
testcase_101	AC	2 ms 6,944 KB
testcase_102	AC	1 ms 6,944 KB
testcase_103	AC	2 ms 6,940 KB
testcase_104	AC	2 ms 6,944 KB
testcase_105	AC	2 ms 6,940 KB
testcase_106	AC	2 ms 6,940 KB
testcase_107	AC	2 ms 6,940 KB
testcase_108	AC	2 ms 6,944 KB
testcase_109	AC	2 ms 6,944 KB
testcase_110	AC	2 ms 6,940 KB
testcase_111	AC	2 ms 6,944 KB
testcase_112	AC	2 ms 6,944 KB
testcase_113	AC	2 ms 6,940 KB
testcase_114	AC	2 ms 6,944 KB
testcase_115	AC	2 ms 6,940 KB
testcase_116	AC	2 ms 6,940 KB
testcase_117	AC	2 ms 6,944 KB
testcase_118	AC	2 ms 6,940 KB
testcase_119	AC	2 ms 6,940 KB
testcase_120	AC	2 ms 6,944 KB
testcase_121	AC	2 ms 6,940 KB
testcase_122	AC	2 ms 6,940 KB
testcase_123	AC	2 ms 6,940 KB
testcase_124	AC	2 ms 6,940 KB
testcase_125	AC	2 ms 6,944 KB
testcase_126	AC	2 ms 6,940 KB
testcase_127	AC	2 ms 6,940 KB
testcase_128	AC	2 ms 6,940 KB
testcase_129	AC	2 ms 6,944 KB
testcase_130	AC	2 ms 6,940 KB
testcase_131	AC	2 ms 6,940 KB
testcase_132	AC	2 ms 6,944 KB
testcase_133	AC	2 ms 6,940 KB
testcase_134	AC	2 ms 6,948 KB
testcase_135	AC	2 ms 6,940 KB
testcase_136	AC	2 ms 6,940 KB
testcase_137	AC	2 ms 6,940 KB
testcase_138	AC	2 ms 6,944 KB
testcase_139	AC	2 ms 6,944 KB
testcase_140	AC	2 ms 6,940 KB
testcase_141	AC	2 ms 6,944 KB
testcase_142	AC	2 ms 6,944 KB
testcase_143	AC	2 ms 6,940 KB

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

ソースコード

raw source code

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <optional>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }
template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }
const std::vector<std::pair<int, int>> grid_dxs{{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <class T1, class T2> T1 floor_div(T1 num, T2 den) { return (num > 0 ? num / den : -((-num + den - 1) / den)); }
template <class T1, class T2> std::pair<T1, T2> operator+(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first + r.first, l.second + r.second); }
template <class T1, class T2> std::pair<T1, T2> operator-(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first - r.first, l.second - r.second); }
template <class T> std::vector<T> sort_unique(std::vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <class T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }
template <class T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }
template <class IStream, class T> IStream &operator>>(IStream &is, std::vector<T> &vec) { for (auto &v : vec) is >> v; return is; }

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec);
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr);
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const pair<T, U> &pa);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa);
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp);
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp);
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl);

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
template <class... T> std::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa) { return os << '(' << pa.first << ',' << pa.second << ')'; }
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl
#define dbgif(cond, x) ((cond) ? std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl : std::cerr)
#else
#define dbg(x) ((void)0)
#define dbgif(cond, x) ((void)0)
#endif

// UnionFind Tree (0-indexed), based on size of each disjoint set
struct UnionFind {
    std::vector<int> par, cou;
    UnionFind(int N = 0) : par(N), cou(N, 1) { iota(par.begin(), par.end(), 0); }
    int find(int x) { return (par[x] == x) ? x : (par[x] = find(par[x])); }
    bool unite(int x, int y) {
        x = find(x), y = find(y);
        if (x == y) return false;
        if (cou[x] < cou[y]) std::swap(x, y);
        par[y] = x, cou[x] += cou[y];
        return true;
    }
    int count(int x) { return cou[find(x)]; }
    bool same(int x, int y) { return find(x) == find(y); }
    std::vector<std::vector<int>> groups() {
        std::vector<std::vector<int>> ret(par.size());
        for (int i = 0; i < int(par.size()); ++i) ret[find(i)].push_back(i);
        ret.erase(std::remove_if(ret.begin(), ret.end(),
                                 [&](const std::vector<int> &v) { return v.empty(); }),
                  ret.end());
        return ret;
    }
};


int main() {
    int N;
    cin >> N;

    vector<int> par(N, -1);
    vector<vector<int>> child(N);
    FOR(i, 1, N) {
        int p;
        cin >> p;
        --p;
        par.at(i) = p;
        child.at(p).push_back(i);
    }

    UnionFind uf1(N);
    UnionFind uf2(N * 2);

    string S;
    cin >> S;

    vector<int> tgt(N);
    auto rec = [&](auto &&self, int now) -> bool {
        int st = 0;

        for (int c : child.at(now)) {
            st ^= self(self, c);
        }

        if (now) {
            bool b = S.at(now - 1) == '#';
            if (b != st) {
                tgt.at(now) = 1;
                st ^= 1;
            }
        }

        return st;
    };

    rec(rec, 0);

    dbg(tgt);

    int K;
    cin >> K;
    REP(k, K) {
        int u, v;
        cin >> u >> v;
        --u, --v;
        dbg(make_tuple(u, v));

        uf1.unite(u, v);
        uf2.unite(u, v + N);
        uf2.unite(v, u + N);
    }

    vector<int> is_free(N);

    REP(i, N) {
        if (uf2.same(i, i + N)) is_free.at(i) = 1;
    }

    map<int, int> mp;

    REP(i, N) {
        if (tgt.at(i)) {
            if (is_free.at(i)) {
                continue;
            } else {
                mp[uf1.find(i)]++;
            }
        }
    }

    for (auto [r, v] : mp) {
        if (v % 2 == 0) continue;
        
        if (r != uf1.find(0)) {
            puts("No");
            return 0;
        }
    }

    puts("Yes");
}

yukicoder

結果

テストケース

ソースコード