結果

問題 No.1442 I-wate Shortest Path Problem
ユーザー leaf_1415leaf_1415
提出日時 2021-03-26 23:02:26
言語 C++11
(gcc 11.4.0)
結果
AC  
実行時間 324 ms / 3,000 ms
コード長 6,324 bytes
コンパイル時間 1,003 ms
コンパイル使用メモリ 96,676 KB
実行使用メモリ 31,368 KB
最終ジャッジ日時 2024-05-06 16:59:45
合計ジャッジ時間 6,738 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 3 ms
5,888 KB
testcase_01 AC 3 ms
5,760 KB
testcase_02 AC 8 ms
6,272 KB
testcase_03 AC 37 ms
6,272 KB
testcase_04 AC 7 ms
6,144 KB
testcase_05 AC 6 ms
6,016 KB
testcase_06 AC 39 ms
6,272 KB
testcase_07 AC 6 ms
6,016 KB
testcase_08 AC 36 ms
6,016 KB
testcase_09 AC 11 ms
6,784 KB
testcase_10 AC 41 ms
6,528 KB
testcase_11 AC 37 ms
6,400 KB
testcase_12 AC 206 ms
23,840 KB
testcase_13 AC 98 ms
18,816 KB
testcase_14 AC 154 ms
20,332 KB
testcase_15 AC 141 ms
20,792 KB
testcase_16 AC 212 ms
23,152 KB
testcase_17 AC 307 ms
27,664 KB
testcase_18 AC 310 ms
27,692 KB
testcase_19 AC 223 ms
23,636 KB
testcase_20 AC 311 ms
27,516 KB
testcase_21 AC 324 ms
27,208 KB
testcase_22 AC 123 ms
27,008 KB
testcase_23 AC 231 ms
31,368 KB
testcase_24 AC 82 ms
18,324 KB
testcase_25 AC 190 ms
26,280 KB
testcase_26 AC 98 ms
22,164 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#include <complex>
#define rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)
#define reps(x, s) for(llint (x) = 0; (x) < (llint)(s).size(); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define sz(x) ((ll)(x).size())
#define ceil(x, y) (((x)+(y)-1) / (y))
#define all(x) (x).begin(),(x).end()
#define outl(...) dump_func(__VA_ARGS__)
#define inf 1e18

using namespace std;

typedef long long llint;
typedef long long ll;
typedef pair<ll, ll> P;

struct edge{
	ll to, cost;
	edge(){}
	edge(ll a, ll b){ to = a, cost = b;}
};

const ll mod = 1000000007;
const ll mod2 = 998244353;

struct mint{
	ll x = 0;
	mint(ll y = 0){x = y; if(x < 0 || x >= mod) x = (x%mod+mod)%mod;}
	mint(const mint &ope) {x = ope.x;}
	
	mint operator-(){return mint(-x);}
	mint operator+(const mint &ope){return mint(x) += ope;}
	mint operator-(const mint &ope){return mint(x) -= ope;}
	mint operator*(const mint &ope){return mint(x) *= ope;}
	mint operator/(const mint &ope){return mint(x) /= ope;}
	mint& operator+=(const mint &ope){
		x += ope.x;
		if(x >= mod) x -= mod;
		return *this;
	}
	mint& operator-=(const mint &ope){
		x += mod - ope.x;
		if(x >= mod) x -= mod;
		return *this;
	}
	mint& operator*=(const mint &ope){
		x *= ope.x, x %= mod;
		return *this;
	}
	mint& operator/=(const mint &ope){
		ll n = mod-2; mint mul = ope;
		while(n){
			if(n & 1) *this *= mul;
			mul *= mul;
			n >>= 1;
		}
		return *this;
	}
	mint inverse(){return mint(1) / *this;}
	bool operator ==(const mint &ope){return x == ope.x;}
	bool operator !=(const mint &ope){return x != ope.x;}
};
mint modpow(mint a, ll n){
	if(n == 0) return mint(1);
	if(n % 2) return a * modpow(a, n-1);
	else return modpow(a*a, n/2);
}
istream& operator >>(istream &is, mint &ope){
	ll t; is >> t, ope.x = t;
	return is;
}
ostream& operator <<(ostream &os, mint &ope){return os << ope.x;}
ostream& operator <<(ostream &os, const mint &ope){return os << ope.x;}

bool exceed(ll x, ll y, ll m){return x >= m / y + 1;}
void mark(){ cout << "*" << endl; }
void yes(){ cout << "Yes" << endl; }
void no(){ cout << "No" << endl; }
ll gcd(ll a, ll b){if(b == 0) return a; return gcd(b, a%b);}


template<typename T>
ostream& operator << (ostream& os, vector<T>& vec) {
	for(int i = 0; i < vec.size(); i++) {
		os << vec[i] << (i + 1 == vec.size() ? "" : " ");
	}
	return os;
}
template<typename T>
ostream& operator << (ostream& os, deque<T>& deq) {
	for(int i = 0; i < deq.size(); i++) {
		os << deq[i] << (i + 1 == deq.size() ? "" : " ");
	}
	return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, pair<T, U>& pair_var) {
	os << "(" << pair_var.first << ", " << pair_var.second << ")";
	return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, const pair<T, U>& pair_var) {
	os << "(" << pair_var.first << ", " << pair_var.second << ")";
	return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, map<T, U>& map_var) {
	for(typename map<T, U>::iterator itr = map_var.begin(); itr != map_var.end(); itr++) {
		os << "(" << itr->first << ", " << itr->second << ")";
		itr++;
		if(itr != map_var.end()) os << ",";
		itr--;
	}
	return os;
}
template<typename T>
ostream& operator << (ostream& os, set<T>& set_var) {
	for(typename set<T>::iterator itr = set_var.begin(); itr != set_var.end(); itr++) {
		os << *itr;
		++itr;
		if(itr != set_var.end()) os << " ";
		itr--;
	}
	return os;
}
template<typename T>
void outa(T a[], ll s, ll t)
{
	for(ll i = s; i <= t; i++){ cout << a[i]; if(i < t) cout << " ";}
	cout << endl;
}
void dump_func() {cout << endl;}
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&... tail) {
	cout << head;
	if(sizeof...(Tail) > 0) cout << " ";
	dump_func(std::move(tail)...);
}


ll n, k, Q;
vector<edge> G[100005];
ll p[15];
vector<ll> vec[15];
ll dist[15][100005];
ll g[15][15];

void dijkstra(vector<edge> G[], ll id, llint dist[])
{
	for(int i = 1; i <= n; i++) dist[i] = inf;
	priority_queue< P, vector<P>, greater<P> > Q;
	
	for(auto v : vec[id]){
		Q.push( make_pair(0, v) );
		dist[v] = 0;
	}
	
	llint v, d;
	while(Q.size()){
		d = Q.top().first;
		v = Q.top().second;
		Q.pop();
		if(dist[v] < d) continue;
		for(int i = 0; i < G[v].size(); i++){
			if(dist[G[v][i].to] > d + G[v][i].cost){
				dist[G[v][i].to] = d + G[v][i].cost;
				Q.push( make_pair(dist[G[v][i].to], G[v][i].to) );
			}
		}
	}
}


const int VNUM = 200005, LOG_VNUM = 18;
int Prev[VNUM][LOG_VNUM];
int depth[VNUM];
ll length[VNUM];

void predfs(int v, int p, int d, ll l)
{
	depth[v] = d, Prev[v][0] = p, length[v] = l;
	for(int i = 0; i < G[v].size(); i++){
		if(G[v][i].to == p) continue;
		predfs(G[v][i].to, v, d+1, G[v][i].cost + l);
	}
}

int getLCA(int u, int v){
	int x = u, y = v;
	if(depth[y] > depth[x]) swap(x, y);
	
	for(int i = LOG_VNUM-1; i >= 0; i--){
		if(depth[x] - (1<<i) >= depth[y]) x = Prev[x][i];
	}
	if(x == y) return x;
	for(int i = LOG_VNUM-1; i >= 0; i--){
		if(Prev[x][i] != Prev[y][i]){
			x = Prev[x][i];
			y = Prev[y][i];
		}
	}
	x = Prev[x][0];
	return x;
}

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n >> k;
	ll u, v, w;
	rep(i, 1, n-1){
		cin >> u >> v >> w;
		G[u].push_back(edge(v, w));
		G[v].push_back(edge(u, w));
	}
	
	ll m, x;
	rep(i, 1, k){
		cin >> m >> p[i];
		rep(j, 1, m){
			cin >> x;
			vec[i].push_back(x);
		}
	}
	
	rep(i, 1, k) dijkstra(G, i, dist[i]);
	rep(i, 1, k) rep(j, 1, k){
		g[i][j] = inf;
		for(auto v : vec[j]) chmin(g[i][j], dist[i][v]);
		g[i][j] += p[j];
		if(i == j) g[i][j] = 0;
	}
	rep(z, 1, k) rep(i, 1, k) rep(j, 1, k) chmin(g[i][j], g[i][z] + g[z][j]);
	
	predfs(1, 0, 0, 0);
	for(int i = 1; i < LOG_VNUM; i++){
		for(int j = 1; j <= n; j++){
			Prev[j][i] = Prev[Prev[j][i-1]][i-1];
		}
	}
	
	cin >> Q;
	rep(q, 1, Q){
		cin >> u >> v;
		
		ll ans = length[u] + length[v] - 2 * length[getLCA(u, v)];
		rep(i, 1, k) rep(j, 1, k){
			chmin(ans, dist[i][u] + p[i] + g[i][j] + dist[j][v]);
		}
		cout << ans << "\n";
	}
	flush(cout);
	
	return 0;
}
0