| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 76414 | nxteru | Factories (JOI14_factories) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstring>
#include <string>
#include <math.h>
using namespace std;
typedef long long ll;
typedef double D;
typedef pair<int,ll> P;
#define M 1000000007
#define F first
#define S second
#define PB push_back
#define INF 100000000000000000
int n,q,k,par[500005][20],dp[500005],pre[500005],pro[500005],vs[1000005],id[500005],seg[1<<21],qx[500005],qy[500005];
ll x[500005],y[500005],ans,dps[1000005];
vector<P>g[500005];
vector<P>G[500005];
vector<int>cm;
vector<int>z;
void dfs(int v,int p,int d,ll da){
dps[k]=da;
vs[k]=v;
pre[v]=k++;
par[v][0]=p;
dp[v]=d;
for(int i=0;i<g[v].size();i++){
if(g[v][i].F!=p)dfs(g[v][i].F,v,d+1,da+g[v][i].S);
}
dps[k]=da;
vs[k]=v;
pro[v]=k++;
}
int rmin(int a,int b){
if(dps[a]>dps[b])return b;
return a;
}
void up(int a,int b){
a+=(1<<20)-1;
seg[a]=b;
while(a>0){
a=(a-1)/2;
seg[a]=rmin(seg[a*2+1],seg[a*2+2]);
}
}
int que(int a,int b,int l,int r,int o){
if(r<a||b<l)return n*2;
if(a<=l&&r<=b)return seg[o];
return rmin(que(a,b,l,(l+r-1)/2,o*2+1),que(a,b,(l+r+1)/2,r,o*2+2));
}
int lca(int v,int u){
if(dp[v]>dp[u])swap(v,u);
for(int i=0;i<20;i++){
if((dp[u]-dp[v])>>i&1)u=par[u][i];
}
if(u==v)return v;
for(int i=19;i>=0;i--){
if(par[v][i]!=par[u][i]){
v=par[v][i];
u=par[u][i];
}
}
return par[v][0];
}
void s_dfs(int v,int p,int lm,int rm){
if(p!=-1){
G[id[p]].PB(P(id[v],dps[pre[v]]-dps[pre[p]]));
G[id[v]].PB(P(id[p],dps[pre[v]]-dps[pre[p]]));
}
if(pre[v]+1<=pro[v]-1){
int w=que(pre[v]+1,pro[v]-1,0,(1<<20)-1,0);
if(w!=2*n)s_dfs(vs[w],v,pre[v],pro[v]);
}
if(lm+1<=pre[v]-1){
int w=que(lm+1,pre[v]-1,0,(1<<20)-1,0);
if(w!=2*n)s_dfs(vs[w],p,lm,pre[v]);
}
if(pro[v]+1<=rm-1){
int w=que(pro[v]+1,rm-1,0,(1<<20)-1,0);
if(w!=2*n)s_dfs(vs[w],p,pro[v],rm);
}
}
void a_dfs(int v,int p){
for(int i=0;i<G[v].size();i++){
int u=G[v][i].F;
ll c=G[v][i].S;
if(u!=p){
a_dfs(u,v);
x[v]=min(x[v],x[u]+c);
y[v]=min(y[v],y[u]+c);
}
}
ans=min(ans,x[v]+y[v]);
}
int main(void){
scanf("%d%d",&n,&q);
for(int i=0;i<n;i++)id[i]=-1;
for(int i=0;i<1<<21;i++)seg[i]=n*2;
for(int i=0;i<n-1;i++){
int a,b;
ll c;
scanf("%d%d%lld",&a,&b,&c);
g[a].PB(P(b,c));
g[b].PB(P(a,c));
}
dfs(0,-1,0,0);
dps[n*2]=INF;
for(int i=0;i<19;i++){
for(int v=0;v<n;v++){
if(par[v][i]==-1)par[v][i+1]=-1;
else par[v][i+1]=par[par[v][i]][i];
}
}
while(q){
k=0;
cm.clear();
z.clear();
int s,t;
scanf("%d%d",&s,&t);
for(int i=0;i<s;i++){
scanf("%d",&qx[i]);
if(id[qx[i]]==-1){
cm.PB(pre[qx[i]]);
up(pre[qx[i]],pre[qx[i]]);
up(pro[qx[i]],pro[qx[i]]);
id[qx[i]]=k++;
}
}
for(int i=0;i<t;i++){
scanf("%d",&qy[i]);
if(id[qy[i]]==-1){
cm.PB(pre[qy[i]]);
up(pre[qy[i]],pre[qy[i]]);
up(pro[qy[i]],pro[qy[i]]);
id[qy[i]]=k++;
}
}
sort(cm.begin(),cm.end());
for(int i=1;i<cm.size();i++){
int a=lca(vs[cm[i]],vs[cm[i-1]]);
if(id[a]==-1){
id[a]=k++;
up(pre[a],pre[a]);
up(pro[a],pro[a]);
}
z.PB(a);
}
int r=que(pre[0],pro[0],0,(1<<20)-1,0);
s_dfs(vs[r],-1,pre[r],pro[r]);
ans=INF;
for(int i=0;i<k;i++){
x[i]=INF;
y[i]=INF;
}
for(int i=0;i<s;i++)x[id[qx[i]]]=0;
for(int i=0;i<t;i++)y[id[qy[i]]]=0;
a_dfs(id[vs[r]],-1);
printf("%lld\n",ans);
for(int i=0;i<z.size();i++){
up(pre[z[i]],n*2);
up(pro[z[i]],n*2);
id[z[i]]=-1;
}
for(int i=0;i<s;i++){
up(pre[qx[i]],n*2);
up(pro[qx[i]],n*2);
id[qx[i]]=-1;
}
for(int i=0;i<t;i++){
up(pre[qy[i]],n*2);
up(pro[qy[i]],n*2);
id[qy[i]]=-1;
}
for(int i=0;i<k;i++)G[i].clear();
q--;
}
}