結果
問題 | No.977 アリス仕掛けの摩天楼 |
ユーザー | Pachicobue |
提出日時 | 2020-02-01 01:08:38 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 163 ms / 2,000 ms |
コード長 | 10,736 bytes |
コンパイル時間 | 2,581 ms |
コンパイル使用メモリ | 221,496 KB |
実行使用メモリ | 32,596 KB |
最終ジャッジ日時 | 2024-09-17 15:10:34 |
合計ジャッジ時間 | 4,570 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,940 KB |
testcase_02 | AC | 2 ms
6,944 KB |
testcase_03 | AC | 2 ms
6,944 KB |
testcase_04 | AC | 2 ms
6,940 KB |
testcase_05 | AC | 2 ms
6,944 KB |
testcase_06 | AC | 2 ms
6,940 KB |
testcase_07 | AC | 2 ms
6,940 KB |
testcase_08 | AC | 2 ms
6,940 KB |
testcase_09 | AC | 2 ms
6,940 KB |
testcase_10 | AC | 2 ms
6,944 KB |
testcase_11 | AC | 2 ms
6,940 KB |
testcase_12 | AC | 2 ms
6,940 KB |
testcase_13 | AC | 11 ms
6,940 KB |
testcase_14 | AC | 11 ms
6,944 KB |
testcase_15 | AC | 10 ms
6,944 KB |
testcase_16 | AC | 11 ms
6,940 KB |
testcase_17 | AC | 12 ms
7,040 KB |
testcase_18 | AC | 32 ms
12,140 KB |
testcase_19 | AC | 37 ms
14,208 KB |
testcase_20 | AC | 62 ms
16,896 KB |
testcase_21 | AC | 115 ms
22,656 KB |
testcase_22 | AC | 163 ms
28,032 KB |
testcase_23 | AC | 161 ms
31,560 KB |
testcase_24 | AC | 146 ms
32,596 KB |
testcase_25 | AC | 148 ms
31,288 KB |
ソースコード
#include <bits/stdc++.h> // created [2020/02/01] 01:02:49 #pragma GCC diagnostic ignored "-Wsign-compare" #pragma GCC diagnostic ignored "-Wsign-conversion" using i32 = int32_t; using i64 = int64_t; using u32 = uint32_t; using u64 = uint64_t; using uint = unsigned int; using usize = std::size_t; using ll = long long; using ull = unsigned long long; using ld = long double; template<typename T, usize n> using arr = T (&)[n]; template<typename T, usize n> using c_arr = const T (&)[n]; template<typename T> using max_heap = std::priority_queue<T>; template<typename T> using min_heap = std::priority_queue<T, std::vector<T>, std::greater<T>>; template<typename T> constexpr T popcount(const T u) { return u ? static_cast<T>(__builtin_popcountll(static_cast<u64>(u))) : static_cast<T>(0); } template<typename T> constexpr T log2p1(const T u) { return u ? static_cast<T>(64 - __builtin_clzll(static_cast<u64>(u))) : static_cast<T>(0); } template<typename T> constexpr T msbp1(const T u) { return log2p1(u); } template<typename T> constexpr T lsbp1(const T u) { return __builtin_ffsll(u); } template<typename T> constexpr T clog(const T u) { return u ? log2p1(u - 1) : static_cast<T>(u); } template<typename T> constexpr bool ispow2(const T u) { return u and (static_cast<u64>(u) & static_cast<u64>(u - 1)) == 0; } template<typename T> constexpr T ceil2(const T u) { return static_cast<T>(1) << clog(u); } template<typename T> constexpr T floor2(const T u) { return u == 0 ? static_cast<T>(0) : static_cast<T>(1) << (log2p1(u) - 1); } template<typename T> constexpr bool btest(const T mask, const usize ind) { return static_cast<bool>((static_cast<u64>(mask) >> ind) & static_cast<u64>(1)); } template<typename T> void bset(T& mask, const usize ind) { mask |= (static_cast<T>(1) << ind); } template<typename T> void breset(T& mask, const usize ind) { mask &= ~(static_cast<T>(1) << ind); } template<typename T> void bflip(T& mask, const usize ind) { mask ^= (static_cast<T>(1) << ind); } template<typename T> void bset(T& mask, const usize ind, const bool b) { (b ? bset(mask, ind) : breset(mask, ind)); } template<typename T> constexpr T bcut(const T mask, const usize ind) { return ind == 0 ? static_cast<T>(0) : static_cast<T>((static_cast<u64>(mask) << (64 - ind)) >> (64 - ind)); } template<typename T> bool chmin(T& a, const T& b) { return (a > b ? a = b, true : false); } template<typename T> bool chmax(T& a, const T& b) { return (a < b ? a = b, true : false); } constexpr unsigned int mod = 1000000007; template<typename T> constexpr T inf_v = std::numeric_limits<T>::max() / 4; template<typename Real> constexpr Real pi_v = Real{3.141592653589793238462643383279502884}; auto mfp = [](auto&& f) { return [=](auto&&... args) { return f(f, std::forward<decltype(args)>(args)...); }; }; template<typename T> T in() { T v; return std::cin >> v, v; } template<typename T, typename Uint, usize n, usize i> T in_v(typename std::enable_if<(i == n), c_arr<Uint, n>>::type) { return in<T>(); } template<typename T, typename Uint, usize n, usize i> auto in_v(typename std::enable_if<(i < n), c_arr<Uint, n>>::type& szs) { const usize s = (usize)szs[i]; std::vector<decltype(in_v<T, Uint, n, i + 1>(szs))> ans(s); for (usize j = 0; j < s; j++) { ans[j] = in_v<T, Uint, n, i + 1>(szs); } return ans; } template<typename T, typename Uint, usize n> auto in_v(c_arr<Uint, n> szs) { return in_v<T, Uint, n, 0>(szs); } template<typename... Types> auto in_t() { return std::tuple<std::decay_t<Types>...>{in<Types>()...}; } struct io_init { io_init() { std::cin.tie(nullptr), std::ios::sync_with_stdio(false); std::cout << std::fixed << std::setprecision(20); } void clear() { std::cin.tie(), std::ios::sync_with_stdio(true); } } io_setting; int out() { return 0; } template<typename T> int out(const T& v) { return std::cout << v, 0; } template<typename T> int out(const std::vector<T>& v) { for (usize i = 0; i < v.size(); i++) { if (i > 0) { std::cout << ' '; } out(v[i]); } return 0; } template<typename T1, typename T2> int out(const std::pair<T1, T2>& v) { return out(v.first), std::cout << ' ', out(v.second), 0; } template<typename T, typename... Args> int out(const T& v, const Args... args) { return out(v), std::cout << ' ', out(args...), 0; } template<typename... Args> int outln(const Args... args) { return out(args...), std::cout << '\n', 0; } template<typename... Args> int outel(const Args... args) { return out(args...), std::cout << std::endl, 0; } # define SHOW(...) static_cast<void>(0) constexpr ull TEN(const usize n) { return n == 0 ? 1ULL : TEN(n - 1) * 10ULL; } template<typename T, typename Uint, usize n, usize i> auto make_v(typename std::enable_if<(i == n), c_arr<Uint, n>>::type, const T& v = T{}) { return v; } template<typename T, typename Uint, usize n, usize i> auto make_v(typename std::enable_if<(i < n), c_arr<Uint, n>>::type szs, const T& v = T{}) { const usize s = (usize)szs[i]; return std::vector<decltype(make_v<T, Uint, n, i + 1>(szs, v))>(s, make_v<T, Uint, n, i + 1>(szs, v)); } template<typename T, typename Uint, usize n> auto make_v(c_arr<Uint, n> szs, const T& t = T{}) { return make_v<T, Uint, n, 0>(szs, t); } class unionfind { public: unionfind(const usize sz) : sz{sz}, rt(sz), comp_sz(sz, 1) { std::iota(rt.begin(), rt.end(), 0); } usize root_of(const usize a) { return assert(a < sz), rt[a] == a ? a : rt[a] = root_of(rt[a]); } bool unite(usize a, usize b) { assert(a < sz), assert(b < sz), a = root_of(a), b = root_of(b); if (a == b) { return false; } if (comp_sz[a] < comp_sz[b]) { std::swap(a, b); } return comp_sz[a] += comp_sz[b], rt[b] = a, true; } usize size_of(const usize a) { return assert(a < sz), comp_sz[root_of(a)]; } friend std::ostream& operator<<(std::ostream& os, const unionfind& uf) { os << "["; for (usize i = 0; i < uf.sz; i++) { os << uf.rt[i] << (i + 1 == uf.sz ? "" : ","); } return (os << "]\n"); } private: const usize sz; std::vector<usize> rt, comp_sz; }; template<typename Cost = usize> struct edge { using cost_type = Cost; usize u, v; Cost c; edge(const usize u, const usize v) : u{u}, v{v}, c{1} {} edge(const usize u, const usize v, const Cost& c) : u{u}, v{v}, c{c} {} operator usize() const { return v; } usize from() const { return u; } usize to() const { return v; } Cost cost() const { return c; } friend std::ostream& operator<<(std::ostream& os, const edge& e) { return os << e.u << "->" << e.v << ":" << e.c; } }; template<typename Edge> class base_graph { public: base_graph(const usize n) : v{n}, es(n), res(n) {} void add_edge(const usize u, const usize v, const bool bi = false) { es[u].emplace_back(u, v), res[v].emplace_back(v, u); if (bi) { es[v].emplace_back(v, u), res[u].emplace_back(u, v); } } template<typename Cost> void add_edge(const usize u, const usize v, const Cost& c, const bool bi = false) { es[u].emplace_back(u, v, c), res[v].emplace_back(v, u, c); if (bi) { es[v].emplace_back(v, u, c), res[u].emplace_back(u, v, c); } } std::vector<Edge>& operator[](const usize u) { return es[u]; } const std::vector<Edge>& operator[](const usize u) const { return es[u]; } std::vector<Edge>& from(const usize u) { return es[u]; } const std::vector<Edge>& from(const usize u) const { return es[u]; } std::vector<Edge>& to(const usize v) { return res[v]; } const std::vector<Edge>& to(const usize v) const { return res[v]; } usize size() const { return v; } friend std::ostream& operator<<(std::ostream& os, const base_graph& g) { for (usize i = 0; i < g.v; i++) { for (const auto& e : g.es[i]) { os << e << '\n'; } } return os; } private: usize v; std::vector<std::vector<Edge>> es, res; }; template<typename Edge> using base_tree = base_graph<Edge>; using graph = base_graph<edge<>>; using tree = base_graph<edge<>>; template<typename Cost> using cost_graph = base_graph<edge<Cost>>; template<typename Cost> using cost_tree = base_graph<edge<Cost>>; template<typename Edge = edge<>> class lowlink_manager { private: using P = std::pair<usize, usize>; const usize sz; std::vector<P> bs; std::vector<usize> ord, low, as; std::vector<bool> is_a; std::vector<std::vector<usize>> dfs_tree; public: lowlink_manager(const base_tree<Edge>& g) : sz(g.size()), ord(sz, sz), low(sz, sz), is_a(sz, false), dfs_tree(sz) { usize num = 0; auto dfs = [&](auto&& self, const usize s, const usize p) -> void { ord[s] = low[s] = num++; usize back = 0; for (const auto& e : g[s]) { const usize to = e.to(); if (ord[to] == sz) { dfs_tree[s].push_back(to), self(self, to, s), low[s] = std::min(low[s], low[to]); } else { if (p == to) { back++; } if (p != to or back > 1) { low[s] = std::min(low[s], ord[to]); } } } }; auto dfs2 = [&](auto&& self, const usize s) -> void { usize max = 0; for (const usize to : dfs_tree[s]) { max = std::max(max, low[to]); if (this->is_bridge(s, to)) { bs.push_back(std::minmax(s, to)); } self(self, to); } is_a[s] = ord[s] <= max and (s != 0 or dfs_tree[s].size() > 1); if (is_a[s]) { as.push_back(s); } }; for (usize i = 0; i < sz; i++) { if (ord[i] != sz) { continue; } dfs(dfs, i, sz), dfs2(dfs2, i); } } bool is_art(const usize i) const { return is_a[i]; } bool is_bridge(const usize i, const usize j) const { return (ord[i] < ord[j]) ? ord[i] < low[j] : ord[j] < low[i]; } const std::vector<P>& bridges() const { return bs; } const std::vector<usize>& arts() const { return as; } }; int main() { const auto N = in<int>(); unionfind uf(N); int c = N; graph g(N); for (int i = 0; i < N - 1; i++) { const auto [u, v] = in_t<int, int>(); if (uf.unite(u, v)) { c--; } g.add_edge(u, v, true); } lowlink_manager lowlink(g); if (c >= 3) { outln("Alice"); } else if (c == 1) { outln("Bob"); } else { const auto bridge = lowlink.bridges(); if (bridge.empty()) { outln("Bob"); } else { outln("Alice"); } } return 0; }