結果
問題 | No.898 tri-βutree |
ユーザー |
![]() |
提出日時 | 2019-10-04 22:02:36 |
言語 | C++11 (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 541 ms / 4,000 ms |
コード長 | 3,095 bytes |
コンパイル時間 | 1,147 ms |
コンパイル使用メモリ | 71,960 KB |
実行使用メモリ | 33,212 KB |
最終ジャッジ日時 | 2024-11-08 22:12:20 |
合計ジャッジ時間 | 11,147 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 21 |
ソースコード
#include <iostream>#include <algorithm>#include <vector>using namespace std;struct edge{long to, cost;};vector<long> G[100000];vector<edge> Ge[100000];vector<long> et;bool used[100000];long depth[100001];long idx[100000];template <typename T>struct segtree{long n;T UNIT;vector<T> dat;segtree(long n_, T unit){UNIT = unit;n = 1;while(n < n_) n *= 2;dat = vector<T>(2*n);for(long i = 0; i < 2*n; i++) dat[i] = UNIT;}//これを変更T calc(T a, T b){if(depth[a] < depth[b]){return a;}else{return b;}}void insert(long k, T a){dat[k+n-1] = a;}void update_all(){for(long i = n-2; i >= 0; i--){dat[i] = calc(dat[i*2+1], dat[i*2+2]);}}//k番目の値(0-indexed)をaに変更void update(long k, T a){k += n-1;dat[k] = a;while(k > 0){k = (k-1)/2;dat[k] = calc(dat[k*2+1], dat[k*2+2]);}}//[a, b)//区間[a, b]へのクエリに対してはquery(a, b+1, 0, 0, segtree.n)と呼ぶことT query(long a, long b, long k, long l, long r){if(r <= a || b <= l) return UNIT;if(a <= l && r <= b) return dat[k];else{T vl = query(a, b, k*2+1, l, (l+r)/2);T vr = query(a, b, k*2+2, (l+r)/2, r);return calc(vl, vr);}}};long cnt = 0;void dfs(long v, long d){used[v] = true;depth[v] = d;for(long i = 0; i < G[v].size(); i++){if(!used[G[v][i]]){et.push_back(G[v][i]);idx[G[v][i]] = et.size()-1;dfs(G[v][i], d+1);et.push_back(v);}}}long dist[100000];void dfs1(long v, long d){used[v] = true;dist[v] = d;for(long i = 0; i < Ge[v].size(); i++){if(!used[Ge[v][i].to]){dfs1(Ge[v][i].to, d+Ge[v][i].cost);}}}int main(){long n;cin >> n;for(long i = 0; i < n-1; i++){long u, v, w;cin >> u >> v >> w;G[u].push_back(v);G[v].push_back(u);Ge[u].push_back(edge{v, w});Ge[v].push_back(edge{u, w});}et.push_back(0);dfs(0, 0);for(int i = 0; i < n; i++) used[i] = false;dfs1(0, 0);depth[n] = n+1;segtree<long> sgt(et.size()+1, n);for(long i = 0; i < et.size(); i++){sgt.insert(i, et[i]);}sgt.update_all();long q;cin >> q;for(long i = 0; i < q; i++){long x, y, z;cin >> x >> y >> z;long id[3]; id[0] = idx[x]; id[1] = idx[y]; id[2] = idx[z];sort(id, id+3);long ans = 0;long p = sgt.query(id[0], id[1], 0, 0, sgt.n);ans += (dist[x]+dist[y]-dist[p]*2);p = sgt.query(id[0], id[2], 0, 0, sgt.n);ans += (dist[x]+dist[z]-dist[p]*2);p = sgt.query(id[1], id[2], 0, 0, sgt.n);ans += (dist[y]+dist[z]-dist[p]*2);cout << ans/2 << endl;}}