結果

問題 No.1442 I-wate Shortest Path Problem
コンテスト
ユーザー heno239
提出日時 2021-03-26 22:00:02
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
AC  
実行時間 2,060 ms / 3,000 ms
コード長 6,598 bytes
コンパイル時間 14,931 ms
コンパイル使用メモリ 208,796 KB
最終ジャッジ日時 2025-01-19 22:36:35
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 25
権限があれば一括ダウンロードができます

ソースコード

diff #
raw source code 

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acosl(-1.0);

ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n % mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 2;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}

struct lcagraph {
private:
	int n;
	vector<vector<int>> G;
	vector<vector<int>> parent;
	vector<int> depth;
	int root;
	int tmp;
public:
	lcagraph(int n_) {
		n = n_;
		G.resize(n);
		parent.resize(n);
		depth.resize(n);
		tmp = 0;
		int cop = n;
		while (cop) {
			tmp++; cop /= 2;
		}
		rep(i, n)parent[i].resize(tmp);
		root = 0;
	}
	lcagraph() {}
	void init(int n_) {
		n = n_;
		G.resize(n);
		parent.resize(n);
		depth.resize(n);
		tmp = 0;
		int cop = n;
		while (cop) {
			tmp++; cop /= 2;
		}
		rep(i, n)parent[i].resize(tmp);
		root = 0;
	}
	void add_edge(int a, int b) {
		G[a].push_back(b);
		G[b].push_back(a);
	}
	void dfs(int id, int fr, int d) {
		parent[id][0] = fr;
		depth[id] = d;
		rep(j, G[id].size()) {
			int to = G[id][j];
			if (to == fr)continue;
			dfs(to, id, d + 1);
		}
	}
	void complete(int r = 0) {
		root = r;
		dfs(root, -1, 0);
		rep(j, tmp - 1)rep(i, n) {
			if (parent[i][j] < 0)parent[i][j + 1] = -1;
			else parent[i][j + 1] = parent[parent[i][j]][j];
		}
	}
	int lca(int u, int v) {
		if (depth[u] > depth[v])swap(u, v);
		for (int k = 0; k < tmp; k++) {
			if ((depth[v] - depth[u]) >> k & 1) {
				v = parent[v][k];
			}
		}
		if (u == v)return u;
		for (int k = tmp - 1; k >= 0; k--) {
			if (parent[u][k] != parent[v][k]) {
				u = parent[u][k];
				v = parent[v][k];
			}
		}
		return parent[u][0];
	}
	int dep(int x) {
		return depth[x];
	}
	int dist(int x, int y) {
		int l = lca(x, y);
		return depth[x] + depth[y] - 2 * depth[l];
	}
};

ll dist[10][100010+5];
struct edge {
	int to, cost;
};
void solve() {
	int n, k; cin >> n >> k;
	vector<vector<edge>> G(n+k);
	vector<vector<edge>> g(n);
	lcagraph lc(n);
	rep(i, n - 1) {
		int a, b, c; cin >> a >> b >> c; a--; b--;
		c *= 2;
		G[a].push_back({ b,c });
		G[b].push_back({ a,c });
		g[a].push_back({ b,c });
		g[b].push_back({ a,c });
		lc.add_edge(a, b);
	}
	rep(i, k) {
		int m, p; cin >> m >> p;
		rep(j, m) {
			int x; cin >> x; x--;
			G[i + n].push_back({ x,p });
			G[x].push_back({ i + n,p });
		}
	}
	rep(i, k) {
		rep(j, n + k)dist[i][j] = INF;
		dist[i][i + n] = 0;
		priority_queue<LP, vector<LP>, greater<LP>>q;
		q.push({ 0,i+n });
		while (!q.empty()) {
			LP p = q.top(); q.pop();
			int id = p.second;
			if (dist[i][id] < p.first)continue;
			for (edge e : G[id]) {
				ll nd = e.cost + p.first;
				if (nd < dist[i][e.to]) {
					dist[i][e.to] = nd;
					q.push({ nd,e.to });
				}
			}
		}
	}
	lc.complete();
	vector<ll> depth(n);
	function<void(int, int)>dfs = [&](int id, int fr) {
		for (edge  e: g[id])if (e.to != fr) {
			depth[e.to] = depth[id] + e.cost;
			dfs(e.to, id);
		}
	}; dfs(0, -1);
	auto calc_dist = [&](int u, int v) {
		int l = lc.lca(u, v);
		return depth[u] + depth[v] - 2 * depth[l];
	};
	auto query = [&](int u, int v) {
		ll res = calc_dist(u, v);
		vector<ll> sdist(k, INF);
		priority_queue<LP, vector<LP>, greater<LP>> q;
		rep(i, k) {
			sdist[i] = dist[i][u];
			q.push({ sdist[i],i });
		}
		while (!q.empty()) {
			LP p = q.top(); q.pop();
			int id = p.second;
			if (sdist[id] < p.first)continue;
			rep(j, k) {
				ll nd = p.first + dist[id][j + n];
				if (sdist[j] > nd) {
					sdist[j] = nd;
					q.push({ nd,sdist[j] });
				}
			}
		}
		rep(i, k) {
			res = min(res, sdist[i] + dist[i][v]);
		}
		return res;
	};
	int q; cin >> q;
	rep(i, q) {
		int u, v; cin >> u >> v; u--; v--;
		ll ans = query(u, v);
		cout << ans/2 << "\n";
	}
	//cout << dist[0][0] << " " << dist[0][4] << "\n";
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init_f();
	//init();
	//expr();
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}
0