結果
問題 | No.901 K-ary εxtrεεmε |
ユーザー | ebi_fly |
提出日時 | 2024-03-12 16:29:39 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 142 ms / 3,000 ms |
コード長 | 17,374 bytes |
コンパイル時間 | 5,485 ms |
コンパイル使用メモリ | 283,464 KB |
実行使用メモリ | 38,384 KB |
最終ジャッジ日時 | 2024-09-29 22:22:06 |
合計ジャッジ時間 | 8,038 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 78 ms
38,384 KB |
testcase_01 | AC | 6 ms
11,072 KB |
testcase_02 | AC | 5 ms
11,088 KB |
testcase_03 | AC | 5 ms
11,136 KB |
testcase_04 | AC | 6 ms
11,120 KB |
testcase_05 | AC | 5 ms
11,176 KB |
testcase_06 | AC | 5 ms
11,100 KB |
testcase_07 | AC | 98 ms
31,280 KB |
testcase_08 | AC | 98 ms
32,364 KB |
testcase_09 | AC | 98 ms
32,440 KB |
testcase_10 | AC | 103 ms
31,168 KB |
testcase_11 | AC | 103 ms
30,964 KB |
testcase_12 | AC | 114 ms
32,372 KB |
testcase_13 | AC | 115 ms
32,248 KB |
testcase_14 | AC | 111 ms
31,828 KB |
testcase_15 | AC | 116 ms
30,924 KB |
testcase_16 | AC | 117 ms
31,128 KB |
testcase_17 | AC | 142 ms
31,776 KB |
testcase_18 | AC | 134 ms
31,724 KB |
testcase_19 | AC | 135 ms
32,932 KB |
testcase_20 | AC | 113 ms
31,524 KB |
testcase_21 | AC | 109 ms
31,108 KB |
testcase_22 | AC | 98 ms
34,612 KB |
testcase_23 | AC | 100 ms
35,372 KB |
testcase_24 | AC | 99 ms
33,896 KB |
testcase_25 | AC | 98 ms
34,556 KB |
testcase_26 | AC | 96 ms
34,828 KB |
testcase_27 | AC | 74 ms
23,604 KB |
testcase_28 | AC | 73 ms
23,256 KB |
testcase_29 | AC | 73 ms
24,496 KB |
ソースコード
#line 1 "test/yuki/yuki_901.test.cpp" #define PROBLEM "https://yukicoder.me/problems/no/901" #line 2 "graph/base.hpp" #include <cassert> #include <iostream> #include <ranges> #include <vector> #line 2 "data_structure/simple_csr.hpp" #line 4 "data_structure/simple_csr.hpp" #include <utility> #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 to; T cost; int id; }; template <class E> struct Graph { private: using cost_type = E; using edge_type = Edge<cost_type>; public: Graph(int n_) : n(n_) {} Graph() = default; void add_edge(int u, int v, cost_type c) { edges.emplace_back(u, edge_type{v, c, 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_edge(p, i, 1); add_edge(i, p, 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; add_edge(u, v, c); if (!is_directed) { add_edge(v, u, c); } } else { add_edge(u, v, 1); if (!is_directed) { add_edge(v, u, 1); } } } build(); } void build() { assert(!prepared); csr = simple_csr<edge_type>(n, edges); edges.clear(); prepared = true; } int size() const { return n; } 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>> edges; simple_csr<edge_type> csr; bool prepared = false; }; } // namespace ebi #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 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 "tree/heavy_light_decomposition.hpp" #line 6 "tree/heavy_light_decomposition.hpp" #line 8 "tree/heavy_light_decomposition.hpp" namespace ebi { template <class T> struct heavy_light_decomposition { private: void dfs_sz(int v) { for (auto &e : g[v]) { if (e.to == par[v]) continue; par[e.to] = v; depth_[e.to] = depth_[v] + 1; dist[e.to] = dist[v] + e.cost; dfs_sz(e.to); sz[v] += sz[e.to]; if (sz[e.to] > sz[g[v][0].to] || g[v][0].to == par[v]) std::swap(e, g[v][0]); } } void dfs_hld(int v) { in[v] = num++; rev[in[v]] = v; for (auto e : g[v]) { if (e.to == par[v]) continue; nxt[e.to] = (e.to == g[v][0].to ? nxt[v] : e.to); dfs_hld(e.to); } out[v] = num; } // [u, v) パスの取得 (v は u の祖先) std::vector<std::pair<int, int>> ascend(int u, int v) const { std::vector<std::pair<int, int>> res; while (nxt[u] != nxt[v]) { res.emplace_back(in[u], in[nxt[u]]); u = par[nxt[u]]; } if (u != v) res.emplace_back(in[u], in[v] + 1); return res; } // (u, v] パスの取得 (u は v の祖先) std::vector<std::pair<int, int>> descend(int u, int v) const { if (u == v) return {}; if (nxt[u] == nxt[v]) return {{in[u] + 1, in[v]}}; auto res = descend(u, par[nxt[v]]); res.emplace_back(in[nxt[v]], in[v]); return res; } public: heavy_light_decomposition(const Graph<T> &gh, int root = 0) : n(gh.size()), g(gh), sz(n, 1), in(n), out(n), nxt(n), par(n, -1), depth_(n, 0), rev(n), dist(n, 0) { nxt[root] = root; dfs_sz(root); dfs_hld(root); } int idx(int u) const { return in[u]; } int rev_idx(int i) const { return rev[i]; } int la(int v, int k) const { while (1) { int u = nxt[v]; if (in[u] <= in[v] - k) return rev[in[v] - k]; k -= in[v] - in[u] + 1; v = par[u]; } } int lca(int u, int v) const { while (nxt[u] != nxt[v]) { if (in[u] < in[v]) std::swap(u, v); u = par[nxt[u]]; } return depth_[u] < depth_[v] ? u : v; } int jump(int s, int t, int i) const { if (i == 0) return s; int l = lca(s, t); int d = depth_[s] + depth_[t] - depth_[l] * 2; if (d < i) return -1; if (depth_[s] - depth_[l] >= i) return la(s, i); i = d - i; return la(t, i); } std::vector<int> path(int s, int t) const { int l = lca(s, t); std::vector<int> a, b; for (; s != l; s = par[s]) a.emplace_back(s); for (; t != l; t = par[t]) b.emplace_back(t); a.emplace_back(l); std::reverse(b.begin(), b.end()); a.insert(a.end(), b.begin(), b.end()); return a; } int parent(int u) const { return par[u]; } T distance(int u, int v) const { return dist[u] + dist[v] - 2 * dist[lca(u, v)]; } T distance_from_root(int v) const { return dist[v]; } T depth(int v) const { return depth_[v]; } bool at_path(int u, int v, int s) const { return distance(u, v) == distance(u, s) + distance(s, v); } template <class F> void path_noncommutative_query(int u, int v, bool vertex, const F &f) const { int l = lca(u, v); for (auto [a, b] : ascend(u, l)) f(a + 1, b); if (vertex) f(in[l], in[l] + 1); for (auto [a, b] : descend(l, v)) f(a, b + 1); } std::vector<std::pair<int, int>> path_sections(int u, int v, bool vertex) const { int l = lca(u, v); std::vector<std::pair<int, int>> sections; for (auto [a, b] : ascend(u, l)) sections.emplace_back(a + 1, b); if (vertex) sections.emplace_back(in[l], in[l] + 1); for (auto [a, b] : descend(l, v)) sections.emplace_back(a, b + 1); return sections; } template <class F> int max_path(int u, int v, bool vertex, F binary_search) const { int prev = -1; int l = lca(u, v); for (auto [a, b] : ascend(u, l)) { a++; int m = binary_search(a, b); if (m == b) { prev = rev[b]; } else { return (m == a ? prev : rev[m]); } } if (vertex) { int m = binary_search(in[l], in[l] + 1); if (m == in[l]) { return prev; } else { prev = l; } } for (auto [a, b] : descend(l, v)) { b++; int m = binary_search(a, b); if (m == b) { prev = rev[b - 1]; } else { return m == a ? prev : rev[m - 1]; } } return v; } template <class F> void subtree_query(int u, bool vertex, const F &f) { f(in[u] + int(!vertex), out[u]); } const std::vector<int> &dfs_order() const { return rev; } std::vector<std::pair<int, int>> lca_based_auxiliary_tree_dfs_order( std::vector<int> vs) const; std::pair<std::vector<int>, Graph<T>> lca_based_auxiliary_tree(std::vector<int> vs) const; private: int n; Graph<T> g; std::vector<int> sz, in, out, nxt, par, depth_, rev; std::vector<T> dist; int num = 0; }; } // namespace ebi #line 2 "tree/lca_based_auxiliary_tree.hpp" #line 8 "tree/lca_based_auxiliary_tree.hpp" #line 10 "tree/lca_based_auxiliary_tree.hpp" namespace ebi { template<class T> std::vector<std::pair<int, int>> heavy_light_decomposition<T>::lca_based_auxiliary_tree_dfs_order( std::vector<int> vs) const { if (vs.empty()) return {}; std::sort(vs.begin(), vs.end(), [&](int u, int v) -> bool { return in[u] < in[v]; }); auto s = vs; for (int i = 1; i < int(vs.size()); i++) { s.emplace_back(lca(vs[i - 1], vs[i])); } std::sort(s.begin(), s.end(), [&](int u, int v) -> bool { return in[u] < in[v]; }); s.erase(std::unique(s.begin(), s.end()), s.end()); std::stack<int> stack; stack.push(s[0]); int sz = s.size(); std::vector<std::pair<int, int>> dfs_order(sz); dfs_order[0] = {s[0], -1}; for (int i = 1; i < int(s.size()); i++) { int v = s[i]; while (!stack.empty()) { int u = stack.top(); if (in[u] <= in[v] && in[v] < out[u]) { break; } else { stack.pop(); } } assert(!stack.empty()); int par = stack.top(); dfs_order[i] = {v, par}; stack.push(v); } return dfs_order; } template<class T> std::pair<std::vector<int>, Graph<T>> heavy_light_decomposition<T>::lca_based_auxiliary_tree(std::vector<int> vs) const { static std::vector<int> a(1'000'000, -1), p(1'000'000, -1); int k = vs.size(); if (k == 1) { return {vs, Graph<T>(1)}; } std::sort(vs.begin(), vs.end(), [&](int v, int u) { return in[v] < in[u]; }); std::stack<int> stack; std::vector<int> s; stack.push(vs[0]); for (int i : std::views::iota(1, k)) { int w = lca(vs[i - 1], vs[i]); int prev = -1; while (!stack.empty() && depth_[w] <= depth_[stack.top()]) { if (prev != -1) { s.emplace_back(prev); p[prev] = stack.top(); } prev = stack.top(); stack.pop(); } if (prev != w) { assert(prev != -1); s.emplace_back(prev); p[prev] = w; } stack.push(w); stack.push(vs[i]); } { int prev = -1; while (!stack.empty()) { int v = stack.top(); s.emplace_back(v); if (prev != -1) p[prev] = v; prev = v; stack.pop(); } } std::reverse(s.begin(), s.end()); int m = s.size(); for (int i : std::views::iota(0, m)) { a[s[i]] = i; } Graph<T> tree(m); for (auto v : s) { if (p[v] < 0) continue; T cost = distance(p[v], v); tree.add_edge(a[p[v]], a[v], cost); tree.add_edge(a[v], a[p[v]], cost); } tree.build(); for (auto v : s) { a[v] = -1; p[v] = -1; } return {s, tree}; } } // namespace ebi #line 7 "test/yuki/yuki_901.test.cpp" namespace ebi { void main_() { int n; std::cin >> n; Graph<i64> g(n); g.read_tree(0, true); heavy_light_decomposition hld(g); int q; std::cin >> q; while (q--) { int k; std::cin >> k; std::vector<int> vs(k); for (auto &v : vs) std::cin >> v; if(k == 1) { std::cout << "0\n"; continue; } auto [ids, tree] = hld.lca_based_auxiliary_tree(vs); std::vector<int> par(tree.size(), -1); i64 ans = 0; auto dfs = [&](auto &&self, int v) -> void { for (auto e : tree[v]) { if (par[v] == e.to) continue; ans += e.cost; par[e.to] = v; self(self, e.to); } }; dfs(dfs, 0); std::cout << ans << '\n'; } } } // namespace ebi int main() { ebi::fast_io(); int t = 1; // std::cin >> t; while (t--) { ebi::main_(); } return 0; }