| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1185985 | g4yuhg | 공장들 (JOI14_factories) | C++17 | 0 ms | 0 KiB |
#include<bits/stdc++.h>
typedef long long ll;
#define fi first
#define se second
#define pii pair<ll,ll>
#define N 500005
#define endl '\n'
#define inf 1e9
using namespace std;
ll n, m, del[N], child[N], high[N], ne[N], d[N];
vector<pii> adj[N];
vector<pii> par[N];
void cnt_child(ll u, ll parent) {
child[u] = 1;
for (auto v : adj[u]) {
if (v.fi == parent || del[v.fi]) continue;
cnt_child(v.fi, u);
child[u] += child[v.fi];
}
}
ll centroid(ll u, ll parent, ll n) {
for (auto v : adj[u]) {
if (v.fi == parent || del[v.fi]) continue;
if (child[v.fi] > n / 2) {
return centroid(v.fi, u, n);
}
}
return u;
}
void dfs(ll u, ll parent, ll r) {
par[u].push_back({r, d[u]});
for (auto v : adj[u]) {
if (v.fi == parent || del[v.fi]) continue;
high[v.fi] = high[u] + 1;
d[v.fi] = d[u] + v.se;
dfs(v.fi, u, r);
}
}
void solve(ll u) {
cnt_child(u, u);
ll x = centroid(u, u, child[u]);
high[x] = 0;
d[x] = 0;
dfs(x, x, x);
del[x] = 1;
for (auto v : adj[x]) {
if (del[v.fi]) continue;
solve(v.fi);
}
}
signed main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n >> m;
for (int i = 1; i <= n - 1; i ++) {
ll u, v, w;
cin >> u >> v >> w;
adj[u].push_back({v, w});
adj[v].push_back({u, w});
}
solve(0);
for (int i = 0; i < n; i ++) {
ne[i] = inf;
}
for (int i = 1; i <= m; i ++) {
ll s, t;
cin >> s >> t;
for (int j = 1; j <= s; j ++) {
ll u;
cin >> u;
high[j] = u;
for (auto p : par[u]) {
ne[p.fi] = min(ne[p.fi], p.se);
}
}
ll res = inf;
for (int j = 1; j <= t; j ++) {
ll u; cin >> u;
for (auto p : par[u]) {
res = min(res, p.se + ne[p.fi]);
}
}
cout << res << endl;
for (int j = 1; j <= s; j ++) {
ll u = high[j];
for (auto p : par[u]) {
ne[p.fi] = inf;
}
}
}
return 0;
}