結果
問題 | No.2337 Equidistant |
ユーザー | ei1333333 |
提出日時 | 2022-08-22 19:23:02 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 990 ms / 4,000 ms |
コード長 | 3,905 bytes |
コンパイル時間 | 2,478 ms |
コンパイル使用メモリ | 216,036 KB |
実行使用メモリ | 41,764 KB |
最終ジャッジ日時 | 2024-11-17 02:09:34 |
合計ジャッジ時間 | 18,291 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 1 ms
5,248 KB |
testcase_03 | AC | 2 ms
5,248 KB |
testcase_04 | AC | 2 ms
5,248 KB |
testcase_05 | AC | 1 ms
5,248 KB |
testcase_06 | AC | 7 ms
5,248 KB |
testcase_07 | AC | 7 ms
5,248 KB |
testcase_08 | AC | 7 ms
5,248 KB |
testcase_09 | AC | 8 ms
5,248 KB |
testcase_10 | AC | 7 ms
5,248 KB |
testcase_11 | AC | 750 ms
34,560 KB |
testcase_12 | AC | 732 ms
34,688 KB |
testcase_13 | AC | 733 ms
34,688 KB |
testcase_14 | AC | 732 ms
34,560 KB |
testcase_15 | AC | 699 ms
34,816 KB |
testcase_16 | AC | 686 ms
34,688 KB |
testcase_17 | AC | 710 ms
34,560 KB |
testcase_18 | AC | 711 ms
34,688 KB |
testcase_19 | AC | 703 ms
34,560 KB |
testcase_20 | AC | 735 ms
34,560 KB |
testcase_21 | AC | 874 ms
41,764 KB |
testcase_22 | AC | 651 ms
33,824 KB |
testcase_23 | AC | 676 ms
35,072 KB |
testcase_24 | AC | 889 ms
39,180 KB |
testcase_25 | AC | 698 ms
35,072 KB |
testcase_26 | AC | 990 ms
39,056 KB |
testcase_27 | AC | 716 ms
35,072 KB |
testcase_28 | AC | 693 ms
35,072 KB |
ソースコード
#include<bits/stdc++.h> using namespace std; #line 2 "graph/tree/doubling-lowest-common-ancestor.hpp" #line 2 "graph/graph-template.hpp" /** * @brief Graph Template(グラフテンプレート) */ template< typename T = int > struct Edge { int from, to; T cost; int idx; Edge() = default; Edge(int from, int to, T cost = 1, int idx = -1) : from(from), to(to), cost(cost), idx(idx) {} operator int() const { return to; } }; template< typename T = int > struct Graph { vector< vector< Edge< T > > > g; int es; Graph() = default; explicit Graph(int n) : g(n), es(0) {} size_t size() const { return g.size(); } void add_directed_edge(int from, int to, T cost = 1) { g[from].emplace_back(from, to, cost, es++); } void add_edge(int from, int to, T cost = 1) { g[from].emplace_back(from, to, cost, es); g[to].emplace_back(to, from, cost, es++); } void read(int M, int padding = -1, bool weighted = false, bool directed = false) { for(int i = 0; i < M; i++) { int a, b; cin >> a >> b; a += padding; b += padding; T c = T(1); if(weighted) cin >> c; if(directed) add_directed_edge(a, b, c); else add_edge(a, b, c); } } inline vector< Edge< T > > &operator[](const int &k) { return g[k]; } inline const vector< Edge< T > > &operator[](const int &k) const { return g[k]; } }; template< typename T = int > using Edges = vector< Edge< T > >; #line 4 "graph/tree/doubling-lowest-common-ancestor.hpp" /** * @brief Doubling-Lowest-Common-Ancestor(最小共通祖先) * @docs docs/doubling-lowest-common-ancestor.md */ template< typename T > struct DoublingLowestCommonAncestor : Graph< T > { public: using Graph< T >::g; vector< int > dep; vector< int > sum; vector< vector< int > > table; const int LOG; explicit DoublingLowestCommonAncestor(int n) : Graph< T >(n), LOG(32 - __builtin_clz(g.size())) {} explicit DoublingLowestCommonAncestor(const Graph< T > &g) : LOG(32 - __builtin_clz(g.size())), Graph< T >(g) {} void build(int root = 0) { dep.assign(g.size(), 0); sum.assign(g.size(), 0); table.assign(LOG, vector< int >(g.size(), -1)); dfs(root, -1, 0); for(int k = 0; k + 1 < LOG; k++) { for(int i = 0; i < (int)table[k].size(); i++) { if(table[k][i] == -1) table[k + 1][i] = -1; else table[k + 1][i] = table[k][table[k][i]]; } } } int lca(int u, int v) { if(dep[u] > dep[v]) swap(u, v); v = climb(v, dep[v] - dep[u]); if(u == v) return u; for(int i = LOG - 1; i >= 0; i--) { if(table[i][u] != table[i][v]) { u = table[i][u]; v = table[i][v]; } } return table[0][u]; } int climb(int u, int k) { if(dep[u] < k) return -1; for(int i = LOG - 1; i >= 0; i--) { if((k >> i) & 1) u = table[i][u]; } return u; } int dist(int u, int v) { return dep[u] + dep[v] - 2 * dep[lca(u, v)]; } int size(int u) { return sum[u]; } private: void dfs(int idx, int par, int d) { table[0][idx] = par; dep[idx] = d; sum[idx] = 1; for(auto &to : g[idx]) { if(to != par) { sum[to] = sum[idx] + to.cost; dfs(to, idx, d + 1); sum[idx] += sum[to]; } } } }; int main() { int N, Q; cin >> N >> Q; DoublingLowestCommonAncestor< int > g(N); g.read(N - 1); g.build(); while(Q--) { int a, b; cin >> a >> b; --a, --b; int d = g.dist(a, b); if(d % 2 == 1) { cout << 0 << endl; continue; } d /= 2; int lca = g.lca(a, b); if(g.dist(a, lca) == d) { cout << N - g.size(g.climb(a, d - 1)) - g.size(g.climb(b, d - 1)) << endl; } else { if(g.dist(a, lca) > g.dist(b, lca)) { swap(a, b); } cout << g.size(g.climb(b, d)) - g.size(g.climb(b, d - 1)) << endl; } } }