제출 #372922

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
372922		BartolM	공장들 (JOI14_factories)	C++17	0 / 100	8074 ms	63384 KiB

factories

#include "factories.h"
#include <bits/stdc++.h>

using namespace std;

#define X first
#define Y second
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <int, pii> pip;
typedef pair <pii, int> ppi;
typedef pair <ll, ll> pll;

const int INF=0x3f3f3f3f;
const ll MAX=(ll)INF*INF;
const int MAXN=5e5+5;
const int LOG=20;

int n;
ll dist[MAXN];
int par[LOG][MAXN], dep[MAXN];
vector <pii> ls[MAXN];
ll da[MAXN], db[MAXN];

void dfs(int node, int rod, ll d) {
    par[0][node]=rod;
    dist[node]=d;
    dep[node]=dep[rod]+1;
//    printf("node: %d, dist: %lld, dep: %d, par: %d\n", node, dist[node], dep[node], rod);
    for (pii sus:ls[node]) if (sus.X!=rod) dfs(sus.X, node, d+sus.Y);
}

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

long long Query(int S, int x[], int T, int y[]) {
    for (int i=0; i<n; ++i) da[i]=db[i]=MAX;
    for (int i=0; i<S; ++i) {
        int node=x[i];
        da[node]=0;
        while (node) {
            node=par[0][node];
            da[node]=min(da[node], dist[x[i]]-dist[node]);
        }
    }
    for (int i=0; i<T; ++i) {
        int node=y[i];
        db[node]=0;
        while (node) {
            node=par[0][node];
            db[node]=min(db[node], dist[y[i]]-dist[node]);
        }
    }
    ll sol=MAX;
    for (int i=0; i<n; ++i) sol=min(sol, da[i]+db[i]);
    return sol;
}

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