oj.uz

Submission #422460

# Submission time Handle Problem Language Result Execution time Memory
422460 2021-06-10T07:00:20 Z tengiz05 Factories (JOI14_factories) C++17
33 / 100
 8000 ms 273704 KB 
#include "factories.h"
#include <bits/stdc++.h>
using i64 = long long;
constexpr int N = 500000, K = 20, M = 2 * N + 1;
std::vector<std::pair<int, int>> e[N], e2[N];
i64 st[K + 1][M];
int lg[M + 1], n, P[N], timer;
i64 D[N];
i64 pos[M];
int order[N], timeStamp;
int par[N];
int dpar[N];
void dfs(int u, int p, i64 d = 0){
    order[timeStamp++] = u;
    par[u] = p;
    P[u] = timer;
    pos[timer++] = d;
    D[u] = d;
    for (auto [v, w] : e[u]) {
        if (v != p) {
            e2[u].emplace_back(v, w);
            dpar[v] = w;
            dfs(v, u, d + w);
            pos[timer++] = d;
        }
    }
}
inline i64 dist(int u, int v) {
    int L = P[u], R = P[v];
    if (L > R) std::swap(L, R);
    int j = lg[R - L + 1];
    return D[u] + D[v] - 2 * std::min(st[j][L], st[j][R - (1 << j) + 1]);
}
void Init(int n, int A[], int B[], int D[]) {
    lg[1] = 0;
    for (int i = 2; i <= M; i++)
        lg[i] = lg[i / 2] + 1;
    ::n = n;
    for (int i = 0; i < n - 1; i++) {
        e[A[i]].emplace_back(B[i], D[i]);
        e[B[i]].emplace_back(A[i], D[i]);
    }
    dfs(0, 0);
    for (int i = 0; i < M; i++)
        st[0][i] = pos[i];
    for (int j = 1; j <= K; j++)
        for (int i = 0; i + (1 << j) <= M; i++)
            st[j][i] = std::min(st[j-1][i], st[j - 1][i + (1 << (j - 1))]);
}
i64 dp[N];
i64 Query(int S, int X[], int T, int Y[]) {
    if (S + T <= 1000) {
        i64 ans = 1e16;
        for (int i = 0; i < S; i++) {
            for (int j = 0; j < T; j++) {
                ans = std::min(ans, dist(X[i], Y[j]));
            }
        }
        return ans;
    }
    memset(dp, 0x3f, sizeof dp);
    for (int i = 0; i < S; i++) {
        dp[X[i]] = 0;
    }
    for (int i = n - 1; i >= 0; i--) {
        int u = order[i];
        dp[par[u]] = std::min(dp[par[u]], dp[u] + dpar[u]);
    }
    for (int i = 0; i < n; i++) {
        int u = order[i];
        dp[u] = std::min(dp[u], dp[par[u]] + dpar[u]);
    }
    i64 ans =  1e16;
    for (int i = 0; i < T; i++) {
        ans = std::min(ans, dp[Y[i]]);
    }
    return ans;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 130 ms 176408 KB Output is correct
2 Correct 869 ms 188536 KB Output is correct
3 Correct 2236 ms 184684 KB Output is correct
4 Correct 510 ms 188572 KB Output is correct
5 Correct 793 ms 188944 KB Output is correct
6 Correct 844 ms 188560 KB Output is correct
7 Correct 2192 ms 184784 KB Output is correct
8 Correct 485 ms 188668 KB Output is correct
9 Correct 800 ms 188952 KB Output is correct
10 Correct 792 ms 188612 KB Output is correct
11 Correct 2223 ms 184808 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 176220 KB Output is correct
2 Correct 1066 ms 236448 KB Output is correct
3 Correct 1174 ms 240020 KB Output is correct
4 Correct 915 ms 231844 KB Output is correct
5 Correct 1132 ms 273704 KB Output is correct
6 Correct 1109 ms 241332 KB Output is correct
7 Correct 1016 ms 196964 KB Output is correct
8 Correct 774 ms 196376 KB Output is correct
9 Correct 683 ms 202176 KB Output is correct
10 Correct 789 ms 198132 KB Output is correct

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 130 ms 176408 KB Output is correct
2 Correct 869 ms 188536 KB Output is correct
3 Correct 2236 ms 184684 KB Output is correct
4 Correct 510 ms 188572 KB Output is correct
5 Correct 793 ms 188944 KB Output is correct
6 Correct 844 ms 188560 KB Output is correct
7 Correct 2192 ms 184784 KB Output is correct
8 Correct 485 ms 188668 KB Output is correct
9 Correct 800 ms 188952 KB Output is correct
10 Correct 792 ms 188612 KB Output is correct
11 Correct 2223 ms 184808 KB Output is correct
12 Correct 94 ms 176220 KB Output is correct
13 Correct 1066 ms 236448 KB Output is correct
14 Correct 1174 ms 240020 KB Output is correct
15 Correct 915 ms 231844 KB Output is correct
16 Correct 1132 ms 273704 KB Output is correct
17 Correct 1109 ms 241332 KB Output is correct
18 Correct 1016 ms 196964 KB Output is correct
19 Correct 774 ms 196376 KB Output is correct
20 Correct 683 ms 202176 KB Output is correct
21 Correct 789 ms 198132 KB Output is correct
22 Correct 2025 ms 241952 KB Output is correct
23 Correct 1735 ms 244316 KB Output is correct
24 Correct 2005 ms 245600 KB Output is correct
25 Correct 1765 ms 249204 KB Output is correct
26 Execution timed out 8058 ms 245828 KB Time limit exceeded
27 Halted 0 ms 0 KB -