oj.uz

답안 #26429

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
26429 2017-06-30T08:22:41 Z chpipis 공장들 (JOI14_factories) C++11
15 / 100
 6000 ms 110964 KB 
#include "factories.h"
#include <bits/stdc++.h>

using namespace std;

#define pb push_back
#define mp make_pair
#define fi first
#define se second

typedef long long ll;

const int MAXN = 5e5 + 5;
const int LOGN = 20;

const ll INF = 1e17;

vector<pair<int, int> > gr[MAXN];
int par[MAXN][LOGN], lvl[MAXN];
ll dist[MAXN];

bool mark[MAXN];
int sz[MAXN], cpar[MAXN], root;
ll ans[MAXN];

void init(int u) {
    for (int j = 1; j < LOGN; j++)
        if (par[u][j - 1] != -1)
            par[u][j] = par[par[u][j - 1]][j - 1];
    for (auto v : gr[u])
        if (v.fi != par[u][0]) {
            dist[v.fi] = dist[u] + v.se;
            par[v.fi][0] = u;
            lvl[v.fi] = lvl[u] + 1;
            init(v.fi);
        }
}

void dfs(int u, int p) {
    sz[u] = 1;
    for (auto v : gr[u])
        if (v.fi != p && !mark[v.fi]) {
            dfs(v.fi, u);
            sz[u] += sz[v.fi];
        }
}

int decompose(int u, int p, const int n) {
    int mx = -1, big = -1;
    for (auto v : gr[u])
        if (v.fi != p && !mark[v.fi] && sz[v.fi] > mx)
            mx = sz[v.fi], big = v.fi;
    //printf("i am at %d and big child is %d\n", u, big);
    if (2 * mx <= n) {
        mark[u] = true;
        //printf("START OF VISIT OF %d\n", u);
        for (auto v : gr[u])
            if (!mark[v.fi]) {
                dfs(v.fi, u);
                int cent = decompose(v.fi, u, sz[v.fi]);
                cpar[cent] = u;
            }
        //printf("END OF VISIT OF %d\n", u);
        return u;
    } else {
        return decompose(big, u, n);
    }
}

void Init(int N, int A[], int B[], int D[]) {
    for (int i = 0; i < N - 1; i++) {
        gr[A[i]].pb(mp(B[i], D[i]));
        gr[B[i]].pb(mp(A[i], D[i]));
    }
    memset(par, -1, sizeof par);
    init(0);
    memset(cpar, -1, sizeof cpar);
    dfs(0, -1);
    root = decompose(0, -1, sz[0]);
    fill(ans, ans + MAXN, INF);
    /*printf("centroid is %d\n", root);
    for (int u = 0; u < N; u++)
        printf("cpar[%d] = %d\n", u, cpar[u]);*/
}

int LCA(int u, int v) {
    if (lvl[u] > lvl[v]) swap(u, v);
    for (int j = LOGN - 1; j >= 0; j--)
        if (lvl[u] + (1 << j) <= lvl[v])
            v = par[v][j];
    if (u == v) return u;
    for (int j = LOGN - 1; j >= 0; j--)
        if (par[u][j] != -1 && par[u][j] != par[v][j])
            u = par[u][j], v = par[v][j];
    return par[u][0];
}

ll far(int u, int v) {
    int l = LCA(u, v);
    return dist[u] + dist[v] - dist[l] * 2LL;
}

ll Query(int S, int X[], int T, int Y[]) {
    for (int i = 0; i < S; i++) {
        int u = X[i];
        while (u != -1) {
            ans[u] = min(ans[u], far(u, X[i]));
            u = cpar[u];
        }
    }
    ll res = INF;
    for (int i = 0; i < T; i++) {
        int u = Y[i];
        while (u != -1) {
            res = min(res, far(u, Y[i]) + ans[u]);
            u = cpar[u];
        }
    }
    for (int i = 0; i < S; i++) {
        int u = X[i];
        while (u != -1) {
            ans[u] = INF;
            u = cpar[u];
        }
    }
    return res;
}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 89232 KB Output is correct
2 Correct 1043 ms 89496 KB Output is correct
3 Correct 2116 ms 89496 KB Output is correct
4 Correct 2119 ms 89496 KB Output is correct
5 Correct 2589 ms 89516 KB Output is correct
6 Correct 456 ms 89532 KB Output is correct
7 Correct 2176 ms 89496 KB Output is correct
8 Correct 2346 ms 89496 KB Output is correct
9 Correct 2679 ms 89520 KB Output is correct
10 Correct 419 ms 89532 KB Output is correct
11 Correct 2296 ms 89496 KB Output is correct

Subtask #2
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 89232 KB Output is correct
2 Correct 4109 ms 107976 KB Output is correct
3 Execution timed out 6000 ms 110964 KB Execution timed out
4 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 6000 ms 107976 KB Execution timed out
2 Halted 0 ms 0 KB -