| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 284815 | BeanZ | 공장들 (JOI14_factories) | C++14 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
const int N = 1e6 + 5;
const int mod = 1e9 + 7;
const int lg = 20;
vector<pair<ll, ll>> node[N];
vector<ll> E[N];
set<ll> adj[N];
ll dp[N][21], dep[N], dis[N][21], sz[N], par[N], ans[N], a[N];
void dfs(ll u, ll p){
for (int i = 1; i <= lg; i++) dp[u][i] = dp[dp[u][i - 1]][i - 1];
for (int i = 1; i <= lg; i++) dis[u][i] = dis[dp[u][i - 1]][i - 1] + dis[u][i - 1];
for (auto j : node[u]){
if (j.first == p) continue;
dp[j.first][0] = u;
dis[j.first][0] = j.second;
dep[j.first] = dep[u] + 1;
dfs(j.first, u);
}
}
ll findnewCT(ll u, ll p, ll S){
for (auto j : adj[u]){
if (j == p) continue;
if ((sz[j] * 2) >= S) return findnewCT(j, u, S);
}
return u;
}
void initsz(ll u, ll p){
sz[u] = 1;
for (auto j : adj[u]){
if (j == p) continue;
initsz(j, u);
sz[u] += sz[j];
}
}
ll findCT(ll u, ll S){
initsz(u, u);
u = findnewCT(u, u, S);
for (auto j : adj[u]){
adj[j].erase(u);
if (sz[j] > sz[u]){
ll x = findCT(j, S - sz[u]);
E[u].push_back(x);
par[x] = u;
} else {
ll x = findCT(j, sz[j]);
E[u].push_back(x);
par[x] = u;
}
}
return u;
}
ll LCA(ll u, ll v){
if (dep[u] > dep[v]) swap(u, v);
ll dist = dep[v] - dep[u];
for (int i = lg; i >= 0; i--){
if (dist & (1 << i)) v = dp[v][i];
}
if (u == v) return u;
for (int i = lg; i >= 0; i--){
if (dp[u][i] != dp[v][i]){
u = dp[u][i];
v = dp[v][i];
}
}
return dp[u][0];
}
ll cal(ll u, ll lca){
ll dist = dep[u] - dep[lca];
ll res = 0;
for (int i = lg; i >= 0; i--){
if (dist & (1 << i)){
res += dis[u][i];
u = dp[u][i];
}
}
return res;
}
ll dist(ll u, ll v){
ll lca = LCA(u, v);
return cal(u, lca) + cal(v, lca);
}
vector<ll> recover;
void upd(ll u, ll root){
recover.push_back(u);
if (u == 0) return;
ans[u] = min(ans[u], dist(root, u));
upd(par[u], root);
}
ll get(ll u, ll root){
if (u == 0) return 1e16;
return min(ans[u] + dist(u, root), get(par[u], root));
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
if (fopen("VietCT.INP", "r")){
freopen("VietCT.INP", "r", stdin);
freopen("VietCT.OUT", "w", stdout);
}
ll n, q;
cin >> n >> q;
for (int i = 1; i < n; i++){
ll u, v, c;
cin >> u >> v >> c;
u++;
v++;
node[u].push_back({v, c});
node[u].push_back({v, c});
adj[u].insert(v);
adj[v].insert(u);
}
dfs(1, 1);
ll root = findCT(1, n);
for (int i = 1; i <= n; i++) ans[i] = 1e16;
while (q--){
recover.clear();
ll m, k;
cin >> m >> k;
for (int i = 1; i <= m; i++) cin >> a[i], a[i]++;
for (int i = 1; i <= k; i++){
ll u;
cin >> u;
u++;
upd(u, u);
}
ll res = 1e16;
for (int i = 1; i <= m; i++){
res = min(res, get(a[i], a[i]));
}
cout << res << endl;
for (auto j : recover) ans[j] = 1e16;
}
}
/*
6 2
0 1 4
1 2 4
2 3 5
3 4 1000
4 5 1
1 1
0
5
2 2
0 3
4 5
*/