結果

問題 No.2800 Game on Tree Inverse
コンテスト
ユーザー ebi_fly
提出日時 2024-06-29 00:58:19
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 12,575 bytes
コンパイル時間 3,915 ms
コンパイル使用メモリ 272,596 KB
実行使用メモリ 443,192 KB
最終ジャッジ日時 2024-06-29 00:59:08
合計ジャッジ時間 43,741 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 29 WA * 35
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 1 "template/template.hpp"
#include <bits/stdc++.h>

#define rep(i, a, n) for (int i = (int)(a); i < (int)(n); i++)
#define rrep(i, a, n) for (int i = ((int)(n)-1); i >= (int)(a); i--)
#define Rep(i, a, n) for (i64 i = (i64)(a); i < (i64)(n); i++)
#define RRep(i, a, n) for (i64 i = ((i64)(n)-i64(1)); i >= (i64)(a); i--)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()

#line 2 "template/debug_template.hpp"

#line 4 "template/debug_template.hpp"

namespace ebi {

#ifdef LOCAL
#define debug(...)                                                      \
    std::cerr << "LINE: " << __LINE__ << "  [" << #__VA_ARGS__ << "]:", \
        debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif

void debug_out() {
    std::cerr << std::endl;
}

template <typename Head, typename... Tail> void debug_out(Head h, Tail... t) {
    std::cerr << " " << h;
    if (sizeof...(t) > 0) std::cerr << " :";
    debug_out(t...);
}

}  // namespace ebi
#line 2 "template/int_alias.hpp"

#line 4 "template/int_alias.hpp"

namespace ebi {

using ld = long double;
using std::size_t;
using i8 = std::int8_t;
using u8 = std::uint8_t;
using i16 = std::int16_t;
using u16 = std::uint16_t;
using i32 = std::int32_t;
using u32 = std::uint32_t;
using i64 = std::int64_t;
using u64 = std::uint64_t;
using i128 = __int128_t;
using u128 = __uint128_t;

}  // namespace ebi
#line 2 "template/io.hpp"

#line 5 "template/io.hpp"
#include <optional>
#line 7 "template/io.hpp"

namespace ebi {

template <typename T1, typename T2>
std::ostream &operator<<(std::ostream &os, const std::pair<T1, T2> &pa) {
    return os << pa.first << " " << pa.second;
}

template <typename T1, typename T2>
std::istream &operator>>(std::istream &os, std::pair<T1, T2> &pa) {
    return os >> pa.first >> pa.second;
}

template <typename T>
std::ostream &operator<<(std::ostream &os, const std::vector<T> &vec) {
    for (std::size_t i = 0; i < vec.size(); i++)
        os << vec[i] << (i + 1 == vec.size() ? "" : " ");
    return os;
}

template <typename T>
std::istream &operator>>(std::istream &os, std::vector<T> &vec) {
    for (T &e : vec) std::cin >> e;
    return os;
}

template <typename T>
std::ostream &operator<<(std::ostream &os, const std::optional<T> &opt) {
    if (opt) {
        os << opt.value();
    } else {
        os << "invalid value";
    }
    return os;
}

void fast_io() {
    std::cout << std::fixed << std::setprecision(15);
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);
}

}  // namespace ebi
#line 2 "template/utility.hpp"

#line 5 "template/utility.hpp"

#line 2 "graph/base.hpp"

#line 5 "graph/base.hpp"
#include <ranges>
#line 7 "graph/base.hpp"

#line 2 "data_structure/simple_csr.hpp"

#line 6 "data_structure/simple_csr.hpp"

namespace ebi {

template <class E> struct simple_csr {
    simple_csr() = default;

    simple_csr(int n, const std::vector<std::pair<int, E>>& elements)
        : start(n + 1, 0), elist(elements.size()) {
        for (auto e : elements) {
            start[e.first + 1]++;
        }
        for (auto i : std::views::iota(0, n)) {
            start[i + 1] += start[i];
        }
        auto counter = start;
        for (auto [i, e] : elements) {
            elist[counter[i]++] = e;
        }
    }

    simple_csr(const std::vector<std::vector<E>>& es)
        : start(es.size() + 1, 0) {
        int n = es.size();
        for (auto i : std::views::iota(0, n)) {
            start[i + 1] = (int)es[i].size() + start[i];
        }
        elist.resize(start.back());
        for (auto i : std::views::iota(0, n)) {
            std::copy(es[i].begin(), es[i].end(), elist.begin() + start[i]);
        }
    }

    int size() const {
        return (int)start.size() - 1;
    }

    const auto operator[](int i) const {
        return std::ranges::subrange(elist.begin() + start[i],
                                     elist.begin() + start[i + 1]);
    }
    auto operator[](int i) {
        return std::ranges::subrange(elist.begin() + start[i],
                                     elist.begin() + start[i + 1]);
    }

    const auto operator()(int i, int l, int r) const {
        return std::ranges::subrange(elist.begin() + start[i] + l,
                                     elist.begin() + start[i + 1] + r);
    }
    auto operator()(int i, int l, int r) {
        return std::ranges::subrange(elist.begin() + start[i] + l,
                                     elist.begin() + start[i + 1] + r);
    }

  private:
    std::vector<int> start;
    std::vector<E> elist;
};

}  // namespace ebi
#line 9 "graph/base.hpp"

namespace ebi {

template <class T> struct Edge {
    int from, to;
    T cost;
    int id;
};

template <class E> struct Graph {
    using cost_type = E;
    using edge_type = Edge<cost_type>;

    Graph(int n_) : n(n_) {}

    Graph() = default;

    void add_edge(int u, int v, cost_type c) {
        buff.emplace_back(u, edge_type{u, v, c, m});
        edges.emplace_back(edge_type{u, v, c, m++});
    }

    void add_undirected_edge(int u, int v, cost_type c) {
        buff.emplace_back(u, edge_type{u, v, c, m});
        buff.emplace_back(v, edge_type{v, u, c, m});
        edges.emplace_back(edge_type{u, v, c, m});
        m++;
    }

    void read_tree(int offset = 1, bool is_weighted = false) {
        read_graph(n - 1, offset, false, is_weighted);
    }

    void read_parents(int offset = 1) {
        for (auto i : std::views::iota(1, n)) {
            int p;
            std::cin >> p;
            p -= offset;
            add_undirected_edge(p, i, 1);
        }
        build();
    }

    void read_graph(int e, int offset = 1, bool is_directed = false,
                    bool is_weighted = false) {
        for (int i = 0; i < e; i++) {
            int u, v;
            std::cin >> u >> v;
            u -= offset;
            v -= offset;
            if (is_weighted) {
                cost_type c;
                std::cin >> c;
                if (is_directed) {
                    add_edge(u, v, c);
                } else {
                    add_undirected_edge(u, v, c);
                }
            } else {
                if (is_directed) {
                    add_edge(u, v, 1);
                } else {
                    add_undirected_edge(u, v, 1);
                }
            }
        }
        build();
    }

    void build() {
        assert(!prepared);
        csr = simple_csr<edge_type>(n, buff);
        buff.clear();
        prepared = true;
    }

    int size() const {
        return n;
    }

    int node_number() const {
        return n;
    }

    int edge_number() const {
        return m;
    }

    edge_type get_edge(int i) const {
        return edges[i];
    }

    std::vector<edge_type> get_edges() const {
        return edges;
    }

    const auto operator[](int i) const {
        return csr[i];
    }
    auto operator[](int i) {
        return csr[i];
    }

  private:
    int n, m = 0;

    std::vector<std::pair<int,edge_type>> buff;

    std::vector<edge_type> edges;
    simple_csr<edge_type> csr;
    bool prepared = false;
};

}  // namespace ebi
#line 8 "template/utility.hpp"

namespace ebi {

template <class T> inline bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template <class T> inline bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <class T> T safe_ceil(T a, T b) {
    if (a % b == 0)
        return a / b;
    else if (a >= 0)
        return (a / b) + 1;
    else
        return -((-a) / b);
}

template <class T> T safe_floor(T a, T b) {
    if (a % b == 0)
        return a / b;
    else if (a >= 0)
        return a / b;
    else
        return -((-a) / b) - 1;
}

constexpr i64 LNF = std::numeric_limits<i64>::max() / 4;

constexpr int INF = std::numeric_limits<int>::max() / 2;

const std::vector<int> dy = {1, 0, -1, 0, 1, 1, -1, -1};
const std::vector<int> dx = {0, 1, 0, -1, 1, -1, 1, -1};

}  // namespace ebi
#line 2 "a.cpp"

namespace ebi {

template <class T> struct binary_trie {
  private:
    struct Node;
    using node_ptr = std::shared_ptr<Node>;
    struct Node {
        int count = 0;
        std::array<node_ptr, 2> childs;
        Node() = default;
    };

  public:
    binary_trie() = default;

    void insert(T x) {
        x ^= val;
        node_ptr now = root;
        now->count++;
        for (int i = bit_size - 1; i >= 0; i--) {
            int index = (x >> i) & 1;
            if (now->childs[index] == nullptr) {
                now->childs[index] = std::make_shared<Node>();
            }
            now = now->childs[index];
            now->count++;
        }
        return;
    }

    void erase(T x) {
        x ^= val;
        if (find(x) == false) return;
        node_ptr now = root;
        now->count--;
        for (int i = bit_size - 1; i >= 0; i--) {
            int index = (x >> i) & 1;
            assert(now->childs[index]);
            now = now->childs[index];
            now->count--;
        }
        return;
    }

    bool find(T x) const {
        x ^= val;
        node_ptr now = root;
        for (int i = bit_size - 1; i >= 0; i--) {
            int index = (x >> i) & 1;
            if (now->childs[index] == nullptr) {
                return false;
            }
            now = now->childs[index];
            if (now->count == 0) {
                return false;
            }
        }
        return true;
    }

    T mex() const {
        T res = 0;
        node_ptr now = root;
        for(int i = bit_size - 1; i >= 0; i--) {
            if(now == nullptr) return res;
            int idx = (val >> i) & 1;
            if(now->childs[idx] == nullptr) {
                return res;
            }
            else {
                if(now->childs[idx]->count == (1<<i)) {
                    res |= 1<<i;
                    now = now->childs[1 - idx];
                }
                else {
                    now = now->childs[idx];
                }
            }
        }
        return res;
    }

    std::vector<T> enumerate() const {
        std::vector<T> p;
        auto dfs = [&](auto &&self, node_ptr v, int depth, T now) -> void {
            if(depth == -1) {
                p.emplace_back(now);
                return;
            }
            int idx = (val >> depth) & 1;
            if(v->childs[idx] != nullptr) {
                self(self, v->childs[idx], depth - 1, now);
            }
            if(v->childs[1-idx] != nullptr) {
                self(self, v->childs[1-idx], depth-1,now | (1<<depth));
            }
        };
        dfs(dfs, root, bit_size - 1, 0);
        return p;
    }

    void all_xor(T a) {
        val ^= a;
    }

    int size() const {
        return root->count;
    }

  private:
    const size_t bit_size = sizeof(T) * CHAR_BIT;
    node_ptr root = std::make_shared<Node>();
    T val = 0;
};

}  // namespace ebi

namespace ebi {

void main_() {
    int n;
    std::cin >> n;
    Graph<int> g(n);
    g.read_tree();
    std::vector<u32> grundy(n), idx(n);
    std::iota(all(idx), 0);
    std::vector<binary_trie<u32>> bt(n);
    auto dfs = [&](auto &&self, int v, int par = -1) -> void {
        u32 ret = 0;
        for(auto e: g[v]) {
            if(e.to == par) continue;
            self(self, e.to, v);
            ret ^= grundy[e.to];
        }
        for(auto e: g[v]) {
            if(e.to == par) continue;
            bt[idx[e.to]].all_xor(ret ^ grundy[e.to]);
            if(bt[idx[v]].size() < bt[idx[e.to]].size()) {
                std::swap(idx[v], idx[e.to]);
            }
            for(auto x: bt[idx[e.to]].enumerate()) {
                if(!bt[idx[v]].find(x)) {
                    bt[idx[v]].insert(x);
                }
            }
        }
        bt[idx[v]].insert(ret);
        grundy[v] = bt[idx[v]].mex();
    };
    dfs(dfs, 0);
    std::vector<int> ans;
    auto dfs2 = [&](auto &&self, int v, int par, u32 r) -> void {
        for(auto e: g[v]) {
            if(e.to == par) continue;
            r ^= grundy[e.to];
        }
        if(r == 0) ans.emplace_back(v+1);
        for(auto e: g[v]) {
            if(e.to == par) continue;
            self(self, e.to, v, r ^ grundy[e.to]);
        }
    };
    dfs2(dfs2, 0, -1, 0);
    std::cout << "Alice\n";
    std::cout << ans.size() << '\n';
    std::cout << ans << '\n';
}

}  // namespace ebi

int main() {
    ebi::fast_io();
    int t = 1;
    // std::cin >> t;
    while (t--) {
        ebi::main_();
    }
    return 0;
}
0