제출 #715945

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
715945		BackNoob	공장들 (JOI14_factories)	C++14	100 / 100	4552 ms	224372 KiB

factories

#include "factories.h"
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define endl '\n'
#define MASK(i) (1LL << (i))
#define ull unsigned long long
#define ld long double
#define pb push_back
#define all(x) (x).begin() , (x).end()
#define BIT(x , i) ((x >> (i)) & 1)
#define TASK "task"
#define sz(s) (int) (s).size()
 
using namespace std;
const int mxN = 5e5 + 227;
const int inf = 1e9 + 277;
const int mod = 1e9 + 7;
const ll infll = 1e18 + 7;
const int base = 307;
const int LOG = 20;
 
template <typename T1, typename T2> bool minimize(T1 &a, T2 b) {
    if (a > b) {a = b; return true;} return false;
}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b) {
    if (a < b) {a = b; return true;} return false;
}

int par[mxN];
int sub[mxN];
ll best[mxN];
bool removed[mxN];
vector<pair<int, int>> adj[mxN];
vector<ll> dist[mxN];


int find_sz(int u, int p)
{
    sub[u] = 1;
    for(auto it : adj[u]) {
        int v = it.fi;
        if(v == p || removed[v] == true) continue;
        sub[u] += find_sz(v, u);
    }
    return sub[u];
}

int find_cen(int u, int p, int n)
{
    for(auto it : adj[u]) {
        int v = it.fi;
        if(v == p || removed[v] == true) continue;
        if(sub[v] * 2 > n) return find_cen(v, u, n);
    }
    return u;
}

void dfs(int u, int p, int root, ll cur = 0)
{
    if(u != root) dist[u].pb(cur);
    for(auto it : adj[u]) {
        int v = it.fi;
        int c = it.se;
        if(v == p || removed[v] == true) continue;
        dfs(v, u, root, cur + c);
    }
}

void init_cen(int u, int p)
{
    int n = find_sz(u, -1);
    int cen = find_cen(u, -1, n);

    dfs(cen, -1, cen);

    par[cen] = p;
    removed[cen] = true;
    for(auto it : adj[cen]) {
        int v = it.fi;
        if(removed[v] == true) continue;
        init_cen(v, cen);
    }
}

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

    init_cen(0, -1);
    memset(best, 0x3f, sizeof(best));
}

void add(int u, int val)
{
    int x = u;
    if(val > 0) best[x] = 0;
    else best[x] = infll;
    int p = sz(dist[u]) - 1;
    while(par[x] != -1) {
        x = par[x];
        if(val > 0) minimize(best[x], dist[u][p]);
        else best[x] = infll;
        --p;
    }
}

ll getans(int u)
{
    ll res = infll;
    int x = u;
    int p = sz(dist[u]) - 1;
    minimize(res, best[x]);
    while(par[x] != -1) {
        x = par[x];
        minimize(res, best[x] + dist[u][p]);
        --p;
    }
    return res;
}

long long Query(int S, int X[], int T, int Y[]) {
    ll res = infll;
    for(int i = 0; i < S; i++) {
        add(X[i], 1);
    }

    for(int i = 0; i < T; i++) {
        minimize(res, getans(Y[i]));
    }

    for(int i = 0; i < S; i++) {
        add(X[i], -1);
    }
    return res;
}

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