Submission #1190348

#	Time	Username	Problem	Language	Result	Execution time	Memory
1190348		boclobanchat	공장들 (JOI14_factories)	C++20	18 / 100	1914 ms	424544 KiB

factories

#include"factories.h"
#include<bits/stdc++.h>
using namespace std;
#define ii pair<int,int>
#define fi first
#define se second
const int MAXN=1e6+5;
const int sqr=2024;
const long long INF=1e18;
int dt[MAXN],L[MAXN],R[MAXN],tdfs=0,nn;
long long dis[MAXN],dp[MAXN][2],ans;
vector<ii> ds[MAXN];
ii sp[MAXN*2][21];
int getlog(long long n) { return 63-__builtin_clzll(n); }
void dfs(int i,int pre)
{
	L[i]=R[i]=++tdfs,sp[tdfs][0]={dt[i],i};
	for(auto v:ds[i]) if(v.fi!=pre)
	{
		dis[v.fi]=dis[i]+v.se,dt[v.fi]=dt[i]+1;
		dfs(v.fi,i);
		R[i]=++tdfs,sp[tdfs][0]={dt[i],i};
	}
}
int lca(int a,int b)
{
	int l=min(L[a],L[b]),r=max(R[a],R[b]),lg=getlog(r-l+1);
	return min(sp[l][lg],sp[r-(1<<lg)+1][lg]).se;
}
long long dist(int a,int b) { return dis[a]+dis[b]-dis[lca(a,b)]*2; }
void dfsus(int i,int pre)
{
	ans=min(ans,dp[i][0]+dp[i][1]);
	for(auto v:ds[i]) if(v.fi!=pre)
	{
		dfsus(v.fi,i);
		dp[i][0]=min(dp[i][0],dp[v.fi][0]+v.se);
		dp[i][1]=min(dp[i][1],dp[v.fi][1]+v.se);
	}
}
void Init(int n,int A[],int B[],int D[])
{
	nn=n;
	for(int i=0;i<n-1;i++) ds[A[i]].push_back({B[i],D[i]}),ds[B[i]].push_back({A[i],D[i]});
	dfs(0,0);
	for(int j=1;(1<<j)<=tdfs;j++) for(int i=1;i<=tdfs-(1<<j)+1;i++) sp[i][j]=min(sp[i][j-1],sp[i+(1<<(j-1))][j-1]);
}
long long Query(int s,int X[],int t,int Y[])
{
	ans=INF;
	if(s+t<=sqr) for(int i=0;i<s;i++) for(int j=0;j<t;j++) ans=min(ans,dist(X[i],Y[j]));
	else
	{
		for(int i=0;i<nn;i++) dp[i][0]=dp[i][1]=INF;
		for(int i=0;i<s;i++) dp[X[i]][0]=0;
		for(int i=0;i<t;i++) dp[Y[i]][1]=0;
		dfs(0,0);
	}
	return ans;
}

• Subtask 1: 0 / 15
• Subtask 2: 18 / 18
• Subtask 3: 0 / 67