oj.uz

Submission #937572

# Submission time Handle Problem Language Result Execution time Memory
937572 2024-03-04T08:59:13 Z ByeWorld Factories (JOI14_factories) C++14
0 / 100
 177 ms 29376 KB 
#include "factories.h"
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define ll long long
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)>>1)
#define ld long double
using namespace std;
typedef pair<ll,ll> pii;
const ll INF = 1e18+10;
const int MAXN = 5e5+10;
const int MAXK = 1010;
const int LOG = 20;

int n, q;
vector <pii> adj[MAXN];
ll dep[MAXN], up[MAXN], anc[MAXN][LOG+5];
int x[MAXN], y[MAXN];

void dfs(int nw, int par){
	anc[nw][0] = par;
	for(auto nx : adj[nw]){
		if(nx.fi == par) continue;
		up[nx.fi] = up[nw]+nx.se;
		dep[nx.fi] = dep[nw]+1;
		dfs(nx.fi, nw);
	}
}

int LCA(int x, int y){
	if(dep[x] > dep[y]) swap(x, y); //gerakin y
	for(int i=LOG-1; i>=0; i--){
		if(dep[anc[y][i]] >= dep[x]) y = anc[y][i]; // dibawah ato sama dengan
	}
	if(x == y) return x;
	for(int i=LOG-1; i>=0; i--){
		if(anc[y][i] != anc[x][i]){
			x = anc[x][i];
			y = anc[y][i];
		}
	}
	return anc[x][0];
}
ll DIST(int x, int y){
	int lca = LCA(x, y);
	return up[x]+up[y]-2*up[lca];
}

void Init(int N, int A[], int B[], int D[]) {
	n = N;
	for(int i=0; i<n-1; i++){
		A[i]++; B[i]++;
		adj[A[i]].pb({B[i], D[i]}); adj[A[i]].pb({B[i], D[i]});
	}
}

long long Query(int S, int X[], int T, int Y[]) {
	int s = S, t = T;
	ll mn = INF;
	for(int i=0; i<s; i++){
		for(int j=0; j<t; j++){
			mn = min(mn, DIST(X[i], Y[j]));
		}
	}
	return mn;
}

Subtask #1
0 / 15.0

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

Subtask #2
0 / 18.0

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

Subtask #3
0 / 67.0

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