oj.uz

Submission #982455

# Submission time Handle Problem Language Result Execution time Memory
982455 2024-05-14T09:23:00 Z Amaarsaa Factories (JOI14_factories) C++14
0 / 100
 15 ms 45660 KB 
#include "factories.h"
#include <bits/stdc++.h>
#define ff first
#define ss second
#define ll long long
using namespace std;
#define M 500005
 
pair<int, ll> d[M];
 
bool act[M];
vector<pair<int, ll> > cen[M], adj[M];
 
void dfs3(int root, int v, int p = -1, ll d = 0){
	cen[v].push_back({root, d});
	for(auto& x : adj[v]){
		int u = x.ff;
		if(!act[u] && p != u)
			dfs3(root, u, v, d + x.ss);
	}
}
 
int q = M;
int sz[M];
 
void dfs1(int v, int p = -1){
	sz[v] = 1;
	for(auto& x : adj[v]){
		int u = x.ff;
		if(!act[u] && p != u){
			dfs1(u, v);
			sz[v] += sz[u];
		}
	}
}
 
int dfs2(int v, int p, int s){
	for(auto& x : adj[v]){
		int u = x.ff;
		if(!act[u] && p != u)
			if(sz[u] > s)
				return dfs2(u, v, s);
	}
	return v;
}
 
void decomp(int v){
	dfs1(v);
	v = dfs2(v, -1, sz[v] / 2);
	dfs3(v, v);
	act[v] = 1;
	for(auto& x : adj[v])
		if(!act[x.ff])
			decomp(x.ff);
}
 
void Init(int N, int A[], int B[], int D[]) {
	for(int i = 0; i < N; i++)
		d[i] = {q, 0};
	
	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]});
	}
 
	decomp(0);
}
 
long long Query(int S, int X[], int T, int Y[]) {
	--q;
	ll res = 0x3f3f3f3f3f3f3f3f;
	for(int i = 0; i < S; i++){
		for(auto& x : cen[X[i]]){
			d[x.ff] = {q, x.ss};
		}
	}
	for(int i = 0; i < T; i++)
		for(auto& x : cen[Y[i]])
			if(d[x.ff].ff == q)
				res = min(res, d[x.ff].ss + x.ss);
	return res;
}

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 15 ms 45660 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 45660 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Incorrect 15 ms 45660 KB Output isn't correct
2 Halted 0 ms 0 KB -