結果
| 問題 |
No.898 tri-βutree
|
| コンテスト | |
| ユーザー |
👑  CleyL
|
| 提出日時 | 2024-02-11 16:42:46 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 6,228 bytes |
| コンパイル時間 | 2,181 ms |
| コンパイル使用メモリ | 157,908 KB |
| 最終ジャッジ日時 | 2025-02-19 05:09:10 |
|
ジャッジサーバーID （参考情報） |
judge5 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 |
| other | AC * 1 WA * 20 |
ソースコード
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <cctype>
#include <climits>
#include <cassert>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <random>
#include <bitset>
#include <complex>
#include <utility>
#include <numeric>
#include <functional>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
const ll MOD = 998244353;
const ll MODx = 1000000007;
const int INF = (1<<30)-1;
const ll LINF = (1LL<<62LL)-1;
const double EPS = (1e-10);
P ar4[4] = {{0,1},{0,-1},{1,0},{-1,0}};
P ar8[8] = {{-1,-1},{-1,0},{-1,1},{0,-1},{0,1},{1,-1},{1,0},{1,1}};
template <typename T> vector<T> make_vector(size_t a, T b) { return vector<T>(a, b); }
template <typename... Ts> auto make_vector(size_t a, Ts... ts) { return vector<decltype(make_vector(ts...))>(a, make_vector(ts...)); }
/*
確認ポイント
cout << fixed << setprecision(n) << 小数計算//n桁の小数表記になる
計算量は変わらないが楽できるシリーズ
min(max)_element(iter,iter)で一番小さい(大きい)値のポインタが帰ってくる
count(iter,iter,int)でintがiterからiterの間にいくつあったかを取得できる
*/
/* comment outed because can cause bugs
__attribute__((constructor))
void initial() {
cin.tie(0);
ios::sync_with_stdio(false);
}
*/
template< typename T, typename F>
struct SegmentTree{
private:
int n;
vector<T> node;
F f;
T initer;
public:
SegmentTree(int n_, F f, T initer) : f(f),initer(initer) {
n = 1;
while(n < n_)n*=2;
node.resize(2*n-1, initer);
}
SegmentTree(int n_, F f,T initer, vector<T> x) : f(f),initer(initer) {
n = 1;
while(n < n_)n*=2;
node.resize(2*n-1, initer);
set(x);
}
void set(vector<T> x){
for(int i = 0; (int)x.size() > i; i++){
update(i,x[i]);
}
}
void update(int x, T val){
x += (n-1);
node[x] = val;
while(x > 0){
x = (x-1)/2;
node[x] = f(node[2*x+1],node[2*x+2]);
}
}
void add(int x, T val){
x += (n-1);
node[x] += val;
while(x > 0){
x = (x-1)/2;
node[x] = f(node[2*x+1],node[2*x+2]);
}
}
T getf(int a,int b, int k=0, int l=0, int r=-1){
if(r < 0){
r = n-1;
}
if(r < a || b < l){
return initer;
}
if(a <= l && r <= b){
return node[k];
}
T vl = getf(a,b,2*k+1,l,(l+r)/2);
T vr = getf(a,b,2*k+2,(l+r)/2+1,r);
return f(vl,vr);
}
void debug(){
int nw = 1;
int curr = 1;
cout << "---begin---" << endl;
for(int i = 0; 2*n-1 > i; i++){
cout << node[i] << " ";
if(nw == curr)cout << endl,nw *= 2, curr=1;
else curr++;
}
cout << "---end---" << endl;
}
};
template <typename T, typename F>
SegmentTree<T, F> get_segment_tree(int N, const F &f, T initer){
return SegmentTree<T,F>{N,f,initer};
}
template <typename T, typename F>
SegmentTree<T, F> get_segment_tree(int N, const F &f, T initer, vector<T> x){
return SegmentTree<T,F>{N,f,initer,x};
}
struct EulerTourForLCA {
int n;
vector<vector<int>> edge;
vector<pair<int, int>> timeline;
vector<pair<int,int>> stump;
vector<int> parent;
EulerTourForLCA(int n, vector<vector<int>> edge):
n(n), edge(edge), timeline(2*n, {-1, 0}), stump(n, {-1,-1}), parent(n, 0), lock(n, false) {}
void build(int top){
timer = 0;
lock.assign(n, false);
lock[top] = true;
dfs(top, 0);
}
const pair<int,int> operator[](int index){
return stump[index];
}
private:
vector<bool> lock;
int timer = 0;
void dfs(int vertex, int depth){
stump[vertex].first = timer;
timeline[timer].first = vertex;
timeline[timer].second = depth;
timer++;
for(int i = 0; (int)edge[vertex].size() > i; i++){
if(!lock[edge[vertex][i]]){
lock[edge[vertex][i]] = true;
parent[edge[vertex][i]] = vertex;
dfs(edge[vertex][i], depth+1);
}
}
stump[vertex].second = timer;
timeline[timer].first = parent[vertex];
timeline[timer].second = depth-1;
timer++;
}
};
struct LowestCommonAncestor {
int n;
vector<vector<int>> edge;
EulerTourForLCA et;
function<pair<int,int>(pair<int,int>, pair<int,int>)> RMQ = [](pair<int,int> a, pair<int,int> b){
if(a.second < b.second)return a;
return b;
};
//function<const pair<int,int>> RMQ = [](pair<int,int> a, pair<int,int> b){
//};
SegmentTree<pair<int,int>, decltype(RMQ)> st;
LowestCommonAncestor(int n, vector<vector<int>> edge):n(n), edge(edge), et(n, edge), st(2*n, RMQ, {n+1, n+1}){
et.build(0);
st.set(et.timeline);
}
int compute(int l, int r){
auto ls = et[l].first;
auto rs = et[r].first;
if(ls > rs)swap(ls, rs);
auto mn = st.getf(ls, rs);
return mn.first;
}
};
using LCA = LowestCommonAncestor;
vector<vector<int>> A;
vector<vector<pair<int,long long>>> Ac;
vector<long long> dist;
vector<int> vis;
void dfs(int nw, long long x){
dist[nw] = x;
for(int i = 0; A[nw].size() > i; i++){
if(vis[A[nw][i]])continue;
vis[A[nw][i]] = 1;
dfs(A[nw][i], x+Ac[nw][i].second);
}
}
int main(){
int n;cin>>n;
A.assign(n, vector<int>());
Ac.assign(n, vector<pair<int,long long>>());
dist.assign(n, 0);
vis.assign(n, 0);
for(int i = 0; n-1 > i; i++){
int a,b,c;cin>>a>>b>>c;
A[a].push_back(b);
A[b].push_back(a);
Ac[a].push_back({b,c});
Ac[b].push_back({a,c});
}
vis[0] = 1;
dfs(0,0);
LCA lca(n, A);
int q;cin>>q;
for(int i = 0; q > i; i++){
int a,b,c;cin>>a>>b>>c;
int z1 = lca.compute(a,b);
int z2 = lca.compute(a,c);
int z3 = lca.compute(b,c);
if(z1 == z2 && z2 && z3){
cout << dist[a]+dist[b]+dist[c]-3*dist[z1] << endl;
}else if(z1 == z2){
cout << dist[b]+dist[c]-2*dist[z3] + dist[z3]+dist[a]-2*dist[z1] << endl;
}else if(z1 == z3){
cout << dist[a]+dist[c]-2*dist[z2] + dist[z2]+dist[b]-2*dist[z1] << endl;
}else{
cout << dist[a]+dist[b]-2*dist[z1] + dist[z1]+dist[c]-2*dist[z2] << endl;
}
}
return 0;
}