結果

問題 No.1094 木登り / Climbing tree
ユーザー kuhakukuhaku
提出日時 2020-08-11 21:13:37
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 871 ms / 2,000 ms
コード長 5,108 bytes
コンパイル時間 2,389 ms
コンパイル使用メモリ 210,228 KB
実行使用メモリ 57,324 KB
最終ジャッジ日時 2024-04-25 19:23:30
合計ジャッジ時間 23,223 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 859 ms
50,940 KB
testcase_02 AC 230 ms
57,324 KB
testcase_03 AC 203 ms
6,940 KB
testcase_04 AC 200 ms
23,296 KB
testcase_05 AC 296 ms
44,560 KB
testcase_06 AC 456 ms
17,280 KB
testcase_07 AC 857 ms
50,900 KB
testcase_08 AC 871 ms
50,968 KB
testcase_09 AC 862 ms
51,004 KB
testcase_10 AC 870 ms
50,952 KB
testcase_11 AC 841 ms
51,032 KB
testcase_12 AC 848 ms
50,968 KB
testcase_13 AC 857 ms
50,876 KB
testcase_14 AC 848 ms
51,044 KB
testcase_15 AC 476 ms
14,344 KB
testcase_16 AC 702 ms
44,504 KB
testcase_17 AC 592 ms
26,912 KB
testcase_18 AC 541 ms
20,936 KB
testcase_19 AC 671 ms
36,760 KB
testcase_20 AC 842 ms
50,876 KB
testcase_21 AC 610 ms
28,616 KB
testcase_22 AC 853 ms
50,876 KB
testcase_23 AC 822 ms
50,968 KB
testcase_24 AC 810 ms
50,960 KB
testcase_25 AC 809 ms
51,040 KB
testcase_26 AC 804 ms
50,876 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
template <typename T>
using Vec1 = vector<T>;
template <typename T>
using Vec2 = vector<Vec1<T> >;
#define REP(i, m, n) for(ll i = (m); i < (n); ++i)
#define REPN(i, m, n) for(ll i = (m); i <= (n); ++i)
#define REPR(i, m, n) for(ll i = (m)-1; i >= (n); --i)
#define REPNR(i, m, n) for(ll i = (m); i >= (n); --i)
#define rep(i, n) REP(i, 0, n)
#define repn(i, n) REPN(i, 1, n)
#define repr(i, n) REPR(i, n, 0)
#define repnr(i, n) REPNR(i, n, 1)
#define all(s) (s).begin(), (s).end()
#define pb push_back
#define fs first
#define sc second
template <typename T>
bool chmax(T &a, const T b){if(a < b){a = b; return true;} return false;}
template <typename T>
bool chmin(T &a, const T b){if(a > b){a = b; return true;} return false;}
template <typename T>
ll pow2(const T n){return (1LL << n);}
template <typename T>
void cosp(const T n){cout << n << ' ';}
void co(void){cout << '\n';}
template <typename T>
void co(const T n){cout << n << '\n';}
template <typename T1, typename T2>
void co(pair<T1, T2> p){cout << p.fs << ' ' << p.sc << '\n';}
template <typename T>
void co(const Vec1<T> &v){for(T i : v) cosp(i); co();}
template <typename T>
void co(initializer_list<T> v){for(T i : v) cosp(i); co();}
void ce(void){cerr << '\n';}
template <typename T>
void ce(const T n){cerr << n << '\n';}
template <typename T>
void cesp(const T n){cerr << n << ' ';}
template <typename T>
void ce(initializer_list<T> v){for(T i : v) cesp(i); ce();}
void sonic(){ios::sync_with_stdio(false); cin.tie(0);}
void setp(const ll n){cout << fixed << setprecision(n);}
constexpr int INF = 1e9+1;
constexpr ll LINF = 1e18+1;
constexpr ll MOD = 1e9+7;
// constexpr ll MOD = 998244353;
constexpr ld EPS = 1e-11;
const double PI = acos(-1);

template <int mod>
struct ModInt {
	int x;

	ModInt() : x(0) {}

	ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

	ModInt &operator+=(const ModInt &p) {
		if((x += p.x) >= mod) x -= mod;
		return *this;
	}

	ModInt &operator-=(const ModInt &p) {
		if((x += mod - p.x) >= mod) x -= mod;
		return *this;
	}

	ModInt &operator*=(const ModInt &p) {
		x = (int) (1LL * x * p.x % mod);
		return *this;
	}

	ModInt &operator/=(const ModInt &p) {
		*this *= p.inverse();
		return *this;
	}

	ModInt operator-() const { return ModInt(-x); }

	ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }

	ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }

	ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }

	ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }

	bool operator==(const ModInt &p) const { return x == p.x; }

	bool operator!=(const ModInt &p) const { return x != p.x; }

	ModInt inverse() const {
		int a = x, b = mod, u = 1, v = 0, t;
		while(b > 0) {
			t = a / b;
			swap(a -= t * b, b);
			swap(u -= t * v, v);
		}
		return ModInt(u);
	}

	ModInt pow(int64_t n) const {
		ModInt res(1), mul(x);
		while(n > 0) {
			if(n & 1) res *= mul;
			mul *= mul;
			n >>= 1;
		}
		return res;
	}

	friend ostream &operator<<(ostream &os, const ModInt &p) {
		return os << p.x;
	}

	friend istream &operator>>(istream &is, ModInt &a) {
		int64_t t;
		is >> t;
		a = ModInt< mod >(t);
		return (is);
	}

	static int get_mod() { return mod; }
};
using Mint = ModInt<MOD>;

Vec2<P> tree;

struct LCA{
	ll V, logV;
	Vec depth;
	Vec cost;
	Vec2<ll> parent;
	
	LCA(ll v){
		V = v;
		logV = 0;
		while (v > pow2(logV)) logV++;
		depth = Vec(V);
		cost = Vec(V);
		parent = Vec2<ll>(logV, Vec(V));
		init(0, -1, 0, 0);
		build();
	}
	
	//init(0, -1, 0);
	void init(ll v, ll par, ll d, ll c) {
		depth[v] = d;
		cost[v] = c;
		parent[0][v] = par;
		for(P i : tree[v]){
			if (i.first == par) continue;
			init(i.first, v, d+1, c + i.second);
		}
	}
	
	void build(){
		rep(k, logV-1){
			rep(v, V){
				if (parent[k][v] < 0) parent[k+1][v] = -1;
				else parent[k+1][v] = parent[k][parent[k][v]];
			}
		}
	}
	
	int lca(ll u, ll v){
		if(depth[u] > depth[v])swap(u, v);
		rep(k, logV){
			if((depth[v]-depth[u]) >> k & 1) v = parent[k][v];
		}
		if (u == v) return u;
		
		repr(k, logV){
			if (parent[k][u] != parent[k][v]) {
				u = parent[k][u];
				v = parent[k][v];
			}
		}
		return parent[0][u];
	}

	ll dist(ll u, ll v) {
		return cost[u] + cost[v] - 2 * cost[lca(u, v)];
	}
};

int main(void){
	ll n;
	cin >> n;
	tree.resize(n);
	rep(i, n - 1) {
		ll a, b, c;
		cin >> a >> b >> c;
		--a, --b;
		tree[a].push_back({b, c});
		tree[b].push_back({a, c});
	}
	LCA lca(n);

	ll q;
	cin >> q;
	while (q--) {
		ll s, t;
		cin >> s >> t;
		--s, --t;
		co(lca.dist(s, t));
	}

	return 0;
}
0