oj.uz

답안 #735628

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
735628 2023-05-04T12:10:53 Z Jeff12345121 공장들 (JOI14_factories) C++14
0 / 100
 8000 ms 165208 KB 
#include <bits/stdc++.h>
#include "factories.h"
using namespace std;

typedef long long ll;
vector<vector<pair<int,int>>> g;
int n;
const int nmax = 500005,LOG = 20;
int lift[LOG][nmax],depth[nmax];
long long dis[LOG][nmax];
void find_parents(int node) {
    for (auto k : g[node]) {
        if (k.first == lift[0][node]) {
            continue;
        }

        lift[0][k.first] = node;
        dis[0][k.first] = k.second;
        depth[k.first] = depth[node] + 1;
        find_parents(k.first);
    }
}
void get_lift() {
    find_parents(1);

    for (int lvl = 1; lvl < LOG; lvl++) {
        for (int i = 1; i <= n; i++) {
            lift[lvl][i] = lift[lvl - 1][lift[lvl - 1][i]];
            dis[lvl][i] = dis[lvl-1][lift[lvl-1][i]] + dis[lvl-1][i];
        }
    }
}
void Init(int N, int A[], int B[], int D[]) {
    n = N;
    g.resize(n + 1);
    for (int i = 1; i < n; i++) {
        A[i - 1]++;
        B[i - 1]++;
        g[A[i - 1]].push_back({B[i - 1] , D[i - 1]});
        g[B[i - 1]].push_back({A[i - 1], D[i - 1]});
    }

    get_lift();

    return;
}

const ll inf = (1LL << 60);

ll get_dis(int u, int v) {
    if (u == v) {
        return 0LL;
    }

    if (depth[u] < depth[v]) {
        swap(u,v);
    }

    ll cost = 0;
    for (int lvl = LOG - 1; lvl >= 0 && depth[u] > depth[v]; lvl--) {
        if (depth[lift[lvl][u]] >= depth[v]) {
            cost += dis[lvl][u];
            u = lift[lvl][u];
        }
    }

    if (u == v) {
        return cost;
    }

    for (int lvl = LOG - 1; lvl >= 0; lvl--) {
        if (lift[lvl][u] != lift[lvl][v]) {
            cost += dis[lvl][u];
            u = lift[lvl][u];
            cost += dis[lvl][v];
            v = lift[lvl][v];
        }
    }

    cost += dis[0][u];
    cost += dis[0][v];
    return cost;
}
long long Query(int S, int X[], int T, int Y[]) {
    ll sol = inf;
    for (int i = 0; i < S;i++) {
        X[i]++;
    }
    for (int i = 0; i < T;i++){
        Y[i]++;
    }

    for (int i = 1; i <= S; i++) {
        for (int j = 1; j <= T; j++) {
            sol = min(sol , get_dis(X[i - 1] , Y[j - 1]));
        }
    }
    return sol;
}

Subtask #1
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 109 ms 1060 KB Output is correct
2 Execution timed out 8015 ms 10084 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 852 KB Output is correct
2 Correct 2516 ms 162868 KB Output is correct
3 Execution timed out 8015 ms 165208 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 109 ms 1060 KB Output is correct
2 Execution timed out 8015 ms 10084 KB Time limit exceeded
3 Halted 0 ms 0 KB -