Submission #656975

#	Time	Username	Problem	Language	Result	Execution time	Memory
656975		anhduc2701	Factories (JOI14_factories)	C++17	100 / 100	3627 ms	166108 KiB

factories

#include<bits/stdc++.h>
#include "factories.h"
using namespace std;
typedef long long ll;
const ll INF=1e18;
const int maxn=1e6+5;
const int mod=1e9+7;
const int mo=998244353;
using pi=pair<ll,ll>;
using vi=vector<ll>;
using pii=pair<pair<ll,ll>,ll>;
#define all(x) x.begin(), x.end()
#define len(x) ll(x.size())
#define eb emplace_back
#define PI 3.14159265359
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int n;
vector<pair<int,int>>G[500005];
int sz[500005];
int pa[500005];
int de[500005];
long long dis[500005][22];
long long ans[500005];
int killed[500005];
int dfsz(int u, int p) {
    sz[u] = 1;
    for(auto v : G[u]) if(v.first != p && killed[v.first]==0) {
      sz[u] += dfsz(v.first, u);
    }
    return sz[u];
}
int centroid(int u, int p, int n) {
    for(auto v : G[u]) if(v.first != p && killed[v.first]==0) {
        if(sz[v.first] > n / 2) return centroid(v.first, u, n);
    }
    return u;
  }
void dfs2(int u, int p, int d) {
  
    for(auto v : G[u]) if(v.first != p && killed[v.first]==0) {
    	dis[v.first][d]=dis[u][d]+v.second;
        dfs2(v.first,u,d);
    }
}
void build(int u, int p,int d) {
    int n1 = dfsz(u, p);
    int c = centroid(u, p, n1);
    
    pa[c] = p;
    killed[c]=1;
    dis[c][d]=0;
    de[c]=d;
    dfs2(c, -1, d);
    for(auto v : G[c]) {
       	if(killed[v.first]==0){
        	build(v.first, c,d+1);
    	}
    }
}
void upd(int u){
    int v=u;
    int d=de[u];
    int cc=u;
    while(d>=1){
        ans[cc]=min(ans[cc],dis[u][d]);

    	cc=pa[cc];
    	d--;
    }
}
void upd1(int u){
    int v=u;
    int d=de[u];
    int cc=u;
    while(d>=1){
        ans[cc]=INF;
    	cc=pa[cc];
    	d--;
    }
}
long long query(int u) {
    long long mi = INF;
    int cc=u;
    int d=de[u];
    while(d>=1){
        mi=min(ans[cc]+dis[u][d],mi);
    	cc=pa[cc];
    	d--;   
    }
    return mi;
}
void Init(int N,int A[],int B[],int D[]){
	n=N;
	for(int i=0;i<N-1;i++){
		G[A[i]+1].pb({B[i]+1,D[i]});
		G[B[i]+1].pb({A[i]+1,D[i]});
	}
	build(1,-1,1);
	for(int i=1;i<=n;i++){
        ans[i]=INF;
	}
}
long long Query(int S,int X[],int T,int Y[]){
	for(int i=0;i<S;i++){
		upd(X[i]+1);
	}
	long long an=INF;
	for(int i=0;i<T;i++){
		an=min(an,query(Y[i]+1));
	}
	for(int i=0;i<S;i++){
        upd1(X[i]+1);
	}
	return an;
}
/*
signed main(){

	int q;
	cin>>n>>q;
	for(int i=1;i<=n-1;i++){
		int x,y,d;
		cin>>x>>y>>d;
		x++;
		y++;
		G[x].push_back({y,d});
		G[y].push_back({x,d});
	}
	build(1,-1,1);
	for(int j=1;j<=q;j++){
		int S,T;
		cin>>S>>T;
		for(int i=1;i<=n;i++){
			ans[i]=INF;
		}
		for(int i=0;i<S;i++){
			int x;
			cin>>x;
			upd(x+1);
		}
		long long an=INF;
		for(int i=0;i<T;i++){
			int y;
			cin>>y;
			an=min(an,query(y+1));
			
		}
		cout<<an<<"\n";
	}
}
*/

Compilation message (stderr)

factories.cpp: In function 'void upd(int)':
factories.cpp:67:9: warning: unused variable 'v' [-Wunused-variable]
   67 |     int v=u;
      |         ^
factories.cpp: In function 'void upd1(int)':
factories.cpp:78:9: warning: unused variable 'v' [-Wunused-variable]
   78 |     int v=u;
      |         ^

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