| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 807061 | hoangnghiep | Factories (JOI14_factories) | C++14 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include<bits/stdc++.h>
#include "factories.h"
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define f first
#define s second
#define pii pair<int,int>
#define piii pair<int,pair<int,int>>
#define vii vector<vector<int>>
#define vi vector<int>
#define cd complex<double>
#define endl '\n'
//#define multipletest
using namespace std;
const int LIM=5000;
const string name="template";
int n,m;
vector<pii> adj[LIM+5],adj_vt[LIM+5];
int time_dfs=0;
pii euler_tour[1000005],sparse_table[20][LIM+5];
int dist[LIM+5];
int tin[LIM+5],tout[LIM+5],h[LIM+5],up_weight[20][LIM+5],low[20][LIM+5],X[LIM+5],Y[LIM+5],A[LIM+5],B[LIM+5],D[LIM+5];
vector<int> List;
priority_queue<pii,vector<pii>,greater<pii>> pq;
void dfs(int u,int parent,int depth){
h[u] = depth;
tin[u] = time_dfs;
euler_tour[time_dfs++] = {depth,u};
low[0][u] = parent;
for(auto v:adj[u]){
if(v.f==parent) continue;
dfs(v.f,u,depth + 1);
euler_tour[time_dfs++] = {depth,u};
up_weight[0][v.f] = v.s;
}
tout[u] = time_dfs;
}
int lca(int u,int v){
if(tin[u]>tin[v]){
swap(u,v);
}
int bt = 31 - __builtin_clz(tin[v]-tin[u]+1);
pii mn = min(sparse_table[bt][tin[u]],sparse_table[bt][tin[v] - (1<<bt) + 1]);
return mn.s;
}
int lift_weight(int u,int k){
int tmp=0;
int w = 0;
while(k>0){
if(k%2==1){
w+=up_weight[tmp][u];
u=low[tmp][u];
}
k>>=1;
tmp++;
}
return w;
}
bool cmp(int a,int b){
return tin[a]<tin[b];
}
int isSubtree(int u,int v)
{
return tin[u]<=tin[v] && tin[v]<=tout[u];
}
void Init(){
time_dfs=0;
List.clear();
for(int i=0;i<n-1;++i){
A[i]++;
B[i]++;
}
for(int i=0;i<n-1;++i){
adj[A[i]].push_back({B[i],D[i]});
adj[B[i]].push_back({A[i],D[i]});
}
for(int i=1;i<=n;++i){
dist[i]=-1;
}
dfs(1,0,0);
for(int i=0;i<time_dfs;++i){
sparse_table[0][i] = euler_tour[i];
}
//
for(int i=1;i<20;++i){
for(int j=0;j+(1<<i)-1<time_dfs;++j){
sparse_table[i][j] = min(sparse_table[i-1][j],sparse_table[i-1][j + (1<<(i-1))]);
}
}
for(int i=1;i<20;++i){
for(int j=1;j<=n;++j){
low[i][j] =low[i-1][low[i-1][j]];
up_weight[i][j] = up_weight[i-1][j] + up_weight[i-1][low[i-1][j]];
}
}
}
long long Query(int S,int T){
List.clear();
for(int i=0;i<S;++i){
List.push_back(++X[i]);
}
for(int i=0;i<T;++i){
List.push_back(++Y[i]);
}
sort(List.begin(),List.end(),cmp);
for(int i=1;i<S+T;++i){
List.push_back(lca(List[i],List[i-1]));
}
sort(List.begin(),List.end(),cmp);
List.erase(unique(List.begin(),List.end()),List.end());
vector<int> st;
for(int i=0;i<List.size();++i){
int u = List[i];
while(st.size()>=2 && !isSubtree(st.back(),u)){
int x = st[st.size()-2];
int y= st.back();
int LCA = lca(x,y);
int w=lift_weight(x,h[x] - h[LCA]) + lift_weight(y,h[y] - h[LCA]);
adj_vt[x].push_back({y,w});
adj_vt[y].push_back({x,w});
// cout<<x<<" "<<y<<" "<<w<<endl;
st.pop_back();
}
st.push_back(u);
}
while(st.size()>=2){
int x = st[st.size()-2];
int y= st.back();
int LCA = lca(x,y);
int w=lift_weight(x,h[x] - h[LCA]) + lift_weight(y,h[y] - h[LCA]);
adj_vt[x].push_back({y,w});
adj_vt[y].push_back({x,w});
// cout<<x<<" "<<y<<" "<<w<<endl;
st.pop_back();
}
for(int i=0;i<T;++i){
pq.push({0,Y[i]});
}
while(!pq.empty()){
int u = pq.top().s;
int w= pq.top().f;
pq.pop();
if(dist[u]!=-1) continue;
dist[u] = w;
for(auto v:adj_vt[u]){
pq.push({w + v.s,v.f});
}
}
long long ans=LLONG_MAX;
for(int i=0;i<S;++i){
ans = min(ans,(long long)dist[X[i]]);
}
for(auto x:List){
adj_vt[x].clear();
dist[x]=-1;
}
return ans;
}