This documentation is automatically generated by online-judge-tools/verification-helper
View the Project on GitHub tko919/library
#define PROBLEM "https://yukicoder.me/problems/no/901" #include "Template/template.hpp" #include "Utility/fastio.hpp" #include "Graph/lca.hpp" #include "Graph/auxiliarytree.hpp" int main() { int n; read(n); AuxiliaryTree g(n); LCA lca(n); using P = pair<int, int>; vector tree(n, vector<P>()); rep(_, 0, n - 1) { int u, v, w; read(u, v, w); g.add_edge(u, v); lca.add_edge(u, v); tree[u].push_back({v, w}); tree[v].push_back({u, w}); } g.run(); lca.run(); vector<ll> dep(n); auto dfs = [&](auto &dfs, int v, int p) -> void { for (auto &[to, w] : tree[v]) if (to != p) { dep[to] = dep[v] + w; dfs(dfs, to, v); } }; dfs(dfs, 0, -1); auto dist = [&](int u, int v) -> ll { return dep[u] + dep[v] - 2 * dep[lca.lca(u, v)]; }; int q; read(q); while (q--) { int k; read(k); vector<int> vs(k); read(vs); g.query(vs); ll ret = 0; for (auto &v : vs) for (auto &to : g.g[v]) ret += dist(v, to); ret /= 2; print(ret); g.clear(vs); } return 0; }
#line 1 "Verify/YUKI_901.test.cpp" #define PROBLEM "https://yukicoder.me/problems/no/901" #line 1 "Template/template.hpp" #include <bits/stdc++.h> using namespace std; #define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++) #define rrep(i, a, b) for (int i = (int)(b-1); i >= (int)(a); i--) #define ALL(v) (v).begin(), (v).end() #define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end()) #define SZ(v) (int)v.size() #define MIN(v) *min_element(ALL(v)) #define MAX(v) *max_element(ALL(v)) #define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin()) #define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin()) using uint = unsigned int; using ll = long long int; using ull = unsigned long long; using i128 = __int128_t; using u128 = __uint128_t; const int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; template <typename T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return 1; } return 0; } template <typename T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return 1; } return 0; } template <typename T, typename U> T ceil(T x, U y) { assert(y != 0); if (y < 0) x = -x, y = -y; return (x > 0 ? (x + y - 1) / y : x / y); } template <typename T, typename U> T floor(T x, U y) { assert(y != 0); if (y < 0) x = -x, y = -y; return (x > 0 ? x / y : (x - y + 1) / y); } template <typename T> int popcnt(T x) { return __builtin_popcountll(x); } template <typename T> int topbit(T x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); } template <typename T> int lowbit(T x) { return (x == 0 ? -1 : __builtin_ctzll(x)); } #ifdef LOCAL #define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__) #else #define show(...) true #endif template <typename T> void _show(int i, T name) { cerr << '\n'; } template <typename T1, typename T2, typename... T3> void _show(int i, const T1 &a, const T2 &b, const T3 &...c) { for (; a[i] != ',' && a[i] != '\0'; i++) cerr << a[i]; cerr << ":" << b << " "; _show(i + 1, a, c...); } template <class T, class U> ostream &operator<<(ostream &os, const pair<T, U> &p) { os << "P(" << p.first << ", " << p.second << ")"; return os; } template <typename T, template <class> class C> ostream &operator<<(ostream &os, const C<T> &v) { os << "["; for (auto d : v) os << d << ", "; os << "]"; return os; } #line 2 "Utility/fastio.hpp" #include <unistd.h> namespace fastio { static constexpr uint32_t SZ = 1 << 17; char ibuf[SZ]; char obuf[SZ]; char out[100]; // pointer of ibuf, obuf uint32_t pil = 0, pir = 0, por = 0; struct Pre { char num[10000][4]; constexpr Pre() : num() { for (int i = 0; i < 10000; i++) { int n = i; for (int j = 3; j >= 0; j--) { num[i][j] = n % 10 | '0'; n /= 10; } } } } constexpr pre; inline void load() { memmove(ibuf, ibuf + pil, pir - pil); pir = pir - pil + fread(ibuf + pir - pil, 1, SZ - pir + pil, stdin); pil = 0; if (pir < SZ) ibuf[pir++] = '\n'; } inline void flush() { fwrite(obuf, 1, por, stdout); por = 0; } void rd(char &c) { do { if (pil + 1 > pir) load(); c = ibuf[pil++]; } while (isspace(c)); } void rd(string &x) { x.clear(); char c; do { if (pil + 1 > pir) load(); c = ibuf[pil++]; } while (isspace(c)); do { x += c; if (pil == pir) load(); c = ibuf[pil++]; } while (!isspace(c)); } template <typename T> void rd_real(T &x) { string s; rd(s); x = stod(s); } template <typename T> void rd_integer(T &x) { if (pil + 100 > pir) load(); char c; do c = ibuf[pil++]; while (c < '-'); bool minus = 0; if constexpr (is_signed<T>::value || is_same_v<T, i128>) { if (c == '-') { minus = 1, c = ibuf[pil++]; } } x = 0; while ('0' <= c) { x = x * 10 + (c & 15), c = ibuf[pil++]; } if constexpr (is_signed<T>::value || is_same_v<T, i128>) { if (minus) x = -x; } } void rd(int &x) { rd_integer(x); } void rd(ll &x) { rd_integer(x); } void rd(i128 &x) { rd_integer(x); } void rd(uint &x) { rd_integer(x); } void rd(ull &x) { rd_integer(x); } void rd(u128 &x) { rd_integer(x); } void rd(double &x) { rd_real(x); } void rd(long double &x) { rd_real(x); } template <class T, class U> void rd(pair<T, U> &p) { return rd(p.first), rd(p.second); } template <size_t N = 0, typename T> void rd_tuple(T &t) { if constexpr (N < std::tuple_size<T>::value) { auto &x = std::get<N>(t); rd(x); rd_tuple<N + 1>(t); } } template <class... T> void rd(tuple<T...> &tpl) { rd_tuple(tpl); } template <size_t N = 0, typename T> void rd(array<T, N> &x) { for (auto &d : x) rd(d); } template <class T> void rd(vector<T> &x) { for (auto &d : x) rd(d); } void read() {} template <class H, class... T> void read(H &h, T &...t) { rd(h), read(t...); } void wt(const char c) { if (por == SZ) flush(); obuf[por++] = c; } void wt(const string s) { for (char c : s) wt(c); } void wt(const char *s) { size_t len = strlen(s); for (size_t i = 0; i < len; i++) wt(s[i]); } template <typename T> void wt_integer(T x) { if (por > SZ - 100) flush(); if (x < 0) { obuf[por++] = '-', x = -x; } int outi; for (outi = 96; x >= 10000; outi -= 4) { memcpy(out + outi, pre.num[x % 10000], 4); x /= 10000; } if (x >= 1000) { memcpy(obuf + por, pre.num[x], 4); por += 4; } else if (x >= 100) { memcpy(obuf + por, pre.num[x] + 1, 3); por += 3; } else if (x >= 10) { int q = (x * 103) >> 10; obuf[por] = q | '0'; obuf[por + 1] = (x - q * 10) | '0'; por += 2; } else obuf[por++] = x | '0'; memcpy(obuf + por, out + outi + 4, 96 - outi); por += 96 - outi; } template <typename T> void wt_real(T x) { ostringstream oss; oss << fixed << setprecision(15) << double(x); string s = oss.str(); wt(s); } void wt(int x) { wt_integer(x); } void wt(ll x) { wt_integer(x); } void wt(i128 x) { wt_integer(x); } void wt(uint x) { wt_integer(x); } void wt(ull x) { wt_integer(x); } void wt(u128 x) { wt_integer(x); } void wt(double x) { wt_real(x); } void wt(long double x) { wt_real(x); } template <class T, class U> void wt(const pair<T, U> val) { wt(val.first); wt(' '); wt(val.second); } template <size_t N = 0, typename T> void wt_tuple(const T t) { if constexpr (N < std::tuple_size<T>::value) { if constexpr (N > 0) { wt(' '); } const auto x = std::get<N>(t); wt(x); wt_tuple<N + 1>(t); } } template <class... T> void wt(tuple<T...> tpl) { wt_tuple(tpl); } template <class T, size_t S> void wt(const array<T, S> val) { auto n = val.size(); for (size_t i = 0; i < n; i++) { if (i) wt(' '); wt(val[i]); } } template <class T> void wt(const vector<T> val) { auto n = val.size(); for (size_t i = 0; i < n; i++) { if (i) wt(' '); wt(val[i]); } } void print() { wt('\n'); } template <class Head, class... Tail> void print(Head &&head, Tail &&...tail) { wt(head); if (sizeof...(Tail)) wt(' '); print(forward<Tail>(tail)...); } void __attribute__((destructor)) _d() { flush(); } } // namespace fastio using fastio::flush; using fastio::print; using fastio::read; inline void first(bool i = true) { print(i ? "first" : "second"); } inline void Alice(bool i = true) { print(i ? "Alice" : "Bob"); } inline void yes(bool i = true) { print(i ? "yes" : "no"); } inline void Yes(bool i = true) { print(i ? "Yes" : "No"); } inline void No() { print("No"); } inline void YES(bool i = true) { print(i ? "YES" : "NO"); } inline void NO() { print("NO"); } inline void Yay(bool i = true) { print(i ? "Yay!" : ":("); } inline void Possible(bool i = true) { print(i ? "Possible" : "Impossible"); } inline void POSSIBLE(bool i = true) { print(i ? "POSSIBLE" : "IMPOSSIBLE"); } /** * @brief Fast IO */ #line 5 "Verify/YUKI_901.test.cpp" #line 2 "Graph/lca.hpp" struct LCA{ LCA(int _n=0):n(_n),g(_n),depth(_n+1,inf),start(_n){} void add_edge(int u,int v){ g[u].push_back(v); g[v].push_back(u); } void run(int root=0){ depth[root]=0; dfs(root,-1); N=1; while(N<int(euler.size()))N<<=1; tree.resize(N*2,n); rep(i,0,euler.size())tree[N+i]=euler[i]; for(int i=N-1;i>0;i--)tree[i]=op(tree[i*2],tree[i*2+1]); } int lca(int u,int v){ int a=start[u],b=start[v]; if(a>b)swap(a,b); b++; int res=n; for(int T=b-a;T>=1;T=b-a){ int x=a|((1U<<31)>>__builtin_clz(T)); int y=x&-x,k=__builtin_ctz(x); res=op(res,tree[(N|a)>>k]); a+=y; } return res; } private: int n,N; vector<vector<int>> g; vector<int> depth,start,euler,tree; void dfs(int v,int p){ start[v]=euler.size(); euler.push_back(v); for(auto& to:g[v])if(to!=p){ depth[to]=depth[v]+1; dfs(to,v); euler.push_back(v); } } int op(int u,int v){ if(depth[u]<depth[v])return u; else return v; } }; /** * @brief Lowest Common Ancestor */ #line 2 "Graph/auxiliarytree.hpp" #line 4 "Graph/auxiliarytree.hpp" struct AuxiliaryTree{ int n,pos; LCA lca; vector<int> in,dep; vector<vector<int>> _g,g; AuxiliaryTree(int _n):n(_n),pos(0),lca(n),in(n),dep(n),_g(n),g(n){} void add_edge(int u,int v){ lca.add_edge(u,v); _g[u].push_back(v); _g[v].push_back(u); } void run(int root=0){ lca.run(root); dfs(root,-1); } void query(vector<int>& vs){ sort(ALL(vs),[&](int u,int v){return in[u]<in[v];}); vs.erase(unique(ALL(vs)),vs.end()); int m=vs.size(); stack<int> st; st.push(vs[0]); rep(i,0,m-1){ int w=lca.lca(vs[i],vs[i+1]); if(w!=vs[i]){ int cur=st.top(); st.pop(); while(!st.empty() and dep[w]<dep[st.top()]){ add(st.top(),cur); cur=st.top(); st.pop(); } if(st.empty() or st.top()!=w){ st.push(w); vs.push_back(w); } add(w,cur); } st.push(vs[i+1]); } while(st.size()>1){ int c=st.top(); st.pop(); add(st.top(),c); } } void clear(vector<int>& vs){ for(auto& w:vs)g[w].clear(); } private: void dfs(int v,int p){ in[v]=pos++; for(auto& to:_g[v])if(to!=p){ dep[to]=dep[v]+1; dfs(to,v); } } void add(int u,int v){ g[u].push_back(v); g[v].push_back(u); } }; /** * @brief Auxiliary Tree(Virtual Tree) */ #line 8 "Verify/YUKI_901.test.cpp" int main() { int n; read(n); AuxiliaryTree g(n); LCA lca(n); using P = pair<int, int>; vector tree(n, vector<P>()); rep(_, 0, n - 1) { int u, v, w; read(u, v, w); g.add_edge(u, v); lca.add_edge(u, v); tree[u].push_back({v, w}); tree[v].push_back({u, w}); } g.run(); lca.run(); vector<ll> dep(n); auto dfs = [&](auto &dfs, int v, int p) -> void { for (auto &[to, w] : tree[v]) if (to != p) { dep[to] = dep[v] + w; dfs(dfs, to, v); } }; dfs(dfs, 0, -1); auto dist = [&](int u, int v) -> ll { return dep[u] + dep[v] - 2 * dep[lca.lca(u, v)]; }; int q; read(q); while (q--) { int k; read(k); vector<int> vs(k); read(vs); g.query(vs); ll ret = 0; for (auto &v : vs) for (auto &to : g.g[v]) ret += dist(v, to); ret /= 2; print(ret); g.clear(vs); } return 0; }