Submission #1263893

#	Time	Username	Problem	Language	Result	Execution time	Memory
1263893		wedonttalkanymore	Factories (JOI14_factories)	C++20	0 / 100	1416 ms	420912 KiB

factories

//#include "factories.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

//#define int long long
#define pii pair<ll, ll>
#define fi first
#define se second
#define MAX_N          500000
#define MAX_Q          100000
#define MAX_SUM_ST    1000000
#define MAX_VALUE  1000000000

const ll MAXN = 5e5 + 5, inf = 1e9, mod = 1e9 + 7, block = 320, lim = 20;

static int N, Q;
static int A[MAX_N], B[MAX_N], D[MAX_N];
static int S[MAX_N];
static int T[MAX_N];
static int X[MAX_SUM_ST];
static int Y[MAX_SUM_ST];

static int Qx[MAX_N];
static int Qy[MAX_N];

int in[2 * MAXN], out[2 * MAXN], timedfs, h[MAXN], lg[MAXN];
pii st[2 * MAXN][lim + 1];
int n;
vector <pii> adj[MAXN], mini_adj[MAXN];
int dist[MAXN];

void predfs(int u, int par) {
	in[u] = out[u] = ++timedfs;
	st[timedfs][0] = make_pair(h[u], u);
	for (auto [v, w] : adj[u]) {
		if (v == par) continue;
		dist[v] = dist[u] + w;
		h[v] = h[u] + 1;
		predfs(v, u);
		st[++timedfs][0] = make_pair(h[u], u);
	}
	out[u] = timedfs;
}
void build() {
	predfs(0, -1);
	for (int i = 2; i <= timedfs; i++) lg[i] = lg[i / 2] + 1;
	for (int i = 1; i <= lim; i++) {
		for (int j = 1; j + (1 << i) - 1 <= timedfs; j++) {
			st[j][i] = min(st[j][i - 1], st[j + (1 << (i - 1))][i - 1]);
		}
	}
}

int lca(int u, int v) {
	int l = in[u], r = in[v];
	if (l > r) swap(l, r);
	int k = lg[r - l + 1];
	return min(st[l][k], st[r - (1 << k) + 1][k]).se;
}
int distance(int u, int v) {
	return dist[u] + dist[v] - 2 * dist[lca(u, v)];
}

bool cmp(int a, int b) {
	return in[a] < in[b];
}

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

bool check(int x, int y) {
	return in[x] <= in[y] && out[y] <= out[x];
}

int length[MAXN];
int minn = inf;
vector <int> comp;
vector <int> val1, val2;
int ownX[MAXN], ownY[MAXN];

void dijk(int id) {
	for (int i = 0; i < comp.size(); i++) length[comp[i]] = inf;
	priority_queue <pii, vector <pii>, greater <pii> > q;
	if (!id) {
		for (int i = 0; i < val1.size(); i++) {
			length[val1[i]] = 0;
			q.push({0, val1[i]});
		}
	}
	else {
		for (int i = 0; i < val2.size(); i++) {
			length[val2[i]] = 0;
			q.push({0, val2[i]});
		}
	}
	while(q.size()) {
		auto [c, u] = q.top();
		q.pop();
		for (auto [v, w] : mini_adj[u]) {
			if (length[v] > length[u] + w) {
				length[v] = length[u] + w;
				if ((!id && ownY[v]) || (id && ownX[v])) minn = min(minn, length[v]);
				q.push({length[v], v});
			}
		}
	}
}

void reset() {
	comp.clear();
	val1.clear();
	val2.clear();
	minn = inf;
}

long long Query(int S, int X[], int T, int Y[]) {
	reset();
	for (int i = 0; i < S; i++) {
		comp.push_back(X[i]);
		val1.push_back(X[i]);
		ownX[X[i]]++;
	}
	for (int i = 0; i < T; i++) {
		comp.push_back(Y[i]);
		val2.push_back(Y[i]);
		ownY[Y[i]]++;
	}
	sort(comp.begin(), comp.end(), cmp);
	int sz = comp.size();
	for (int i = 0; i < sz - 1; i++) {
		comp.push_back(lca(comp[i], comp[i + 1]));
	}
	sort(comp.begin(), comp.end(), cmp);
	comp.erase(unique(comp.begin(), comp.end()), comp.end());
	sz = comp.size();
	stack <int> st;
	st.push(comp[0]);
	for (int i = 1; i < sz; i++) {
		while(!st.empty() && !check(st.top(), comp[i])) st.pop();
		if (st.size()) {
			mini_adj[st.top()].emplace_back(comp[i], distance(comp[i], st.top()));
			mini_adj[comp[i]].emplace_back(st.top(), distance(comp[i], st.top()));
		}
		st.push(comp[i]);
	}
	dijk(0);
	dijk(1);
	sz = comp.size();
	for (int i = 0; i < sz; i++) mini_adj[comp[i]].clear();
	for (int i = 0; i < S; i++) {
//		comp.push_back(X[i]);
//		val1.push_back(X[i]);
		ownX[X[i]]--;
	}
	for (int i = 0; i < T; i++) {
//		comp.push_back(Y[i]);
//		val2.push_back(Y[i]);
		ownY[Y[i]]--;
	}
	return minn;
//	return 0;
}
//
//int main() {
//  freopen("sample-in-01.txt","r",stdin);
//
//  int i, j, k;
//  int STop, TTop;
//
//  if (2 != scanf("%d%d", &N, &Q)) {
//    fprintf(stderr, "error: cannot read N and Q.\n");
//    exit(1);
//  }
//  if (!(2 <= N && N <= MAX_N)) {
//    fprintf(stderr, "error: N is out of bounds.\n");
//    exit(1);
//  }
//  if (!(1 <= Q && Q <= MAX_Q)) {
//    fprintf(stderr, "error: Q is out of bounds.\n");
//    exit(1);
//  }
//  for (i = 0; i < N - 1; ++i) {
//    if (1 != scanf("%d", &A[i])) {
//      fprintf(stderr, "error: cannot read A[%d].\n", i);
//      exit(1);
//    }
//    if (!(0 <= A[i] && A[i] <= N - 1)) {
//      fprintf(stderr, "error: A[%d] is out of bounds.\n", i);
//      exit(1);
//    }
//    if (1 != scanf("%d", &B[i])) {
//      fprintf(stderr, "error: cannot read B[%d].\n", i);
//      exit(1);
//    }
//    if (!(0 <= B[i] && B[i] <= N - 1)) {
//      fprintf(stderr, "error: B[%d] is out of bounds.\n", i);
//      exit(1);
//    }
//    if (A[i] == B[i]) {
//      fprintf(stderr, "error: B[%d] is equal to A[%d].\n", i, i);
//      exit(1);
//    }
//    if (1 != scanf("%d", &D[i])) {
//      fprintf(stderr, "error: cannot read D[%d].\n", i);
//      exit(1);
//    }
//    if (!(1 <= D[i] && D[i] <= MAX_VALUE)) {
//      fprintf(stderr, "error: D[%d] is out of bounds.\n", i);
//      exit(1);
//    }
//  }
//
//  STop = 0;
//  TTop = 0;
//
//  for (j = 0; j < Q; ++j) {
//    if (2 != scanf("%d%d", &S[j], &T[j])) {
//      fprintf(stderr, "error: cannot read L[%d] and R[%d].\n", j, j);
//      exit(1);
//    }
//
//    if(STop + S[j] > MAX_SUM_ST) {
//      fprintf(stderr, "error: S[0] + S[1] + ... + S[%d] is out of bounds.\n", j);
//      exit(1);
//    }
//
//    if(TTop + T[j] > MAX_SUM_ST) {
//      fprintf(stderr, "error: T[0] + T[1] + ... + T[%d] is out of bounds.\n", j);
//      exit(1);
//    }
//
//    for (k = 0; k < S[j]; ++k, ++STop) {
//      if (1 != scanf("%d", &X[STop])) {
//        fprintf(stderr, "error: cannot read X[%d][%d].\n", j, k);
//        exit(1);
//      }
//
//      if (!(0 <= X[STop] && X[STop] <= N - 1)) {
//        fprintf(stderr, "error: cannot read X[%d][%d].\n", j, k);
//        exit(1);
//      }
//    }
//
//    for (k = 0; k < T[j]; ++k, ++TTop) {
//      if (1 != scanf("%d", &Y[TTop])) {
//        fprintf(stderr, "error: cannot read Y[%d][%d].\n", j, k);
//        exit(1);
//      }
//
//      if (!(0 <= Y[TTop] && Y[TTop] <= N - 1)) {
//        fprintf(stderr, "error: cannot read Y[%d][%d].\n", j, k);
//        exit(1);
//      }
//    }
//  }
//
//  STop = 0;
//  TTop = 0;
//  Init(N, A, B, D);
//
//  for (j = 0; j < Q; ++j) {
//    for (k = 0; k < S[j]; k++) {
//        Qx[k] = X[STop++];
//    }
//    for (k = 0; k < T[j]; k++) {
//        Qy[k] = Y[TTop++];
//    }
//
//    printf("%lld\n", Query(S[j], Qx, T[j], Qy));
//  }
//
//
//  return 0;
//}

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