oj.uz

답안 #1036865

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1036865 2024-07-27T18:08:19 Z TrendBattles 공장들 (JOI14_factories) C++14
100 / 100
 3324 ms 194232 KB 
#include "factories.h"
#include <bits/stdc++.h>
using namespace std;
using lli = long long;

const int MAX_N = 1 << 19;
vector <int> graph[MAX_N];
struct Edge {
    int u, v, w;
    Edge(int _u = 0, int _v = 0, int _w = 0):
        u(_u), v(_v), w(_w) {}

    int get_other(int x) const {
        return x ^ u ^ v;
    }
};
Edge edge[MAX_N];


lli pref_w[MAX_N];
int in[MAX_N], depth[MAX_N];
int timeDFS = 0;
int mn_depth[__lg(MAX_N) + 1][MAX_N << 1];
void DFS(int u) {
    in[u] = ++timeDFS;

    mn_depth[0][in[u]] = u;
    for (int id : graph[u]) {
        int v = edge[id].get_other(u);
        if (in[v]) continue;

        depth[v] = depth[u] + 1;
        pref_w[v] = pref_w[u] + edge[id].w;
        DFS(v);

        mn_depth[0][++timeDFS] = u;
    }
}

int Find_LCA(int u, int v) {
    if (in[u] > in[v]) swap(u, v);
    int k = __lg(in[v] - in[u] + 1);

    int& x = mn_depth[k][in[u]]; int& y = mn_depth[k][in[v] - (1 << k) + 1];
    return depth[x] < depth[y] ? x : y;
}
lli Path_Len(int u, int v) {
    return pref_w[u] + pref_w[v] - 2 * pref_w[Find_LCA(u, v)];
}

int removed[MAX_N], cen_parent[MAX_N], sub_sz[MAX_N];

int Find_Centroid(int s, int sz) {
    int last = s, parent = 0;
    while (true) {
        for (int id : graph[s]) {
            int v = edge[id].get_other(s);
            if (v == parent or removed[v]) continue;

            if (sub_sz[v] * 2 > sz) {
                last = v; break;
            }
        }
        if (last == s) break;
        parent = s; s = last;
    }
    return last;
}
int get_size(int u, int parent) {
    sub_sz[u] = 1;
    for (int id : graph[u]) {
        int v = edge[id].get_other(u);
        if (v == parent or removed[v]) continue;
        
        sub_sz[u] += get_size(v, u);
    }
    return sub_sz[u];
}
int Build_Centroid(int s) {
    int cen_node = Find_Centroid(s, get_size(s, 0));
    removed[cen_node] = true;

    for (int id : graph[cen_node]) {
        int v = edge[id].get_other(cen_node);
        if (removed[v]) continue;

        int x = Build_Centroid(v);
        cen_parent[x] = cen_node;
    }   

    return cen_node;
}

lli min_path[MAX_N];
const lli inf = 0x3f3f3f3f3f3f3f3f;
void Init(int N, int A[], int B[], int D[]) {
    for (int i = 0; i < N - 1; ++i) {
        A[i] += 1; B[i] += 1;
        edge[i] = Edge(A[i], B[i], D[i]);

        graph[A[i]].push_back(i);
        graph[B[i]].push_back(i);
    }

    DFS(1);
    for (int i = 1; i <= __lg(N) + 1; ++i) {
        for (int u = 1; u + (1 << i) <= timeDFS + 1; ++u) {
            int& x = mn_depth[i - 1][u]; int& y = mn_depth[i - 1][u + (1 << (i - 1))];
            mn_depth[i][u] = depth[x] < depth[y] ? x : y;
        }
    }
    
    Build_Centroid(1);

    memset(min_path, 0x3f, sizeof min_path);
}

void minimise(lli& x, lli y) {
    if (x > y) x = y;
}
void Update(int pos) {
    int c = pos;
    while (c) {
        minimise(min_path[c], Path_Len(c, pos));
        c = cen_parent[c];
    }
}

lli Ask(int pos) {
    lli ans = inf;

    int c = pos;
    while (c) {
        minimise(ans, min_path[c] + Path_Len(c, pos));
        c = cen_parent[c];
    }
    return ans;
}
void Clean(int pos) {
    int c = pos;
    while (c) {
        min_path[c] = inf;
        c = cen_parent[c];
    }
}
lli Query(int S, int X[], int T, int Y[]) {
    for (int i = 0; i < S; ++i) {
        X[i] += 1;
        Update(X[i]);
    }

    lli mn = inf;
    for (int i = 0; i < T; ++i) {
        Y[i] += 1;
        minimise(mn, Ask(Y[i]));
    }

    for (int i = 0; i < S; ++i) {
        Clean(X[i]);
    }
    return mn;
}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 23644 KB Output is correct
2 Correct 322 ms 41412 KB Output is correct
3 Correct 393 ms 41324 KB Output is correct
4 Correct 386 ms 41468 KB Output is correct
5 Correct 466 ms 41760 KB Output is correct
6 Correct 171 ms 41300 KB Output is correct
7 Correct 401 ms 41300 KB Output is correct
8 Correct 410 ms 41464 KB Output is correct
9 Correct 446 ms 41764 KB Output is correct
10 Correct 170 ms 41468 KB Output is correct
11 Correct 370 ms 41444 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 23132 KB Output is correct
2 Correct 1462 ms 158540 KB Output is correct
3 Correct 2117 ms 160340 KB Output is correct
4 Correct 449 ms 159308 KB Output is correct
5 Correct 2631 ms 191780 KB Output is correct
6 Correct 1833 ms 162288 KB Output is correct
7 Correct 792 ms 66984 KB Output is correct
8 Correct 260 ms 67788 KB Output is correct
9 Correct 967 ms 72020 KB Output is correct
10 Correct 835 ms 68436 KB Output is correct

Subtask #3
67.0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 23644 KB Output is correct
2 Correct 322 ms 41412 KB Output is correct
3 Correct 393 ms 41324 KB Output is correct
4 Correct 386 ms 41468 KB Output is correct
5 Correct 466 ms 41760 KB Output is correct
6 Correct 171 ms 41300 KB Output is correct
7 Correct 401 ms 41300 KB Output is correct
8 Correct 410 ms 41464 KB Output is correct
9 Correct 446 ms 41764 KB Output is correct
10 Correct 170 ms 41468 KB Output is correct
11 Correct 370 ms 41444 KB Output is correct
12 Correct 13 ms 23132 KB Output is correct
13 Correct 1462 ms 158540 KB Output is correct
14 Correct 2117 ms 160340 KB Output is correct
15 Correct 449 ms 159308 KB Output is correct
16 Correct 2631 ms 191780 KB Output is correct
17 Correct 1833 ms 162288 KB Output is correct
18 Correct 792 ms 66984 KB Output is correct
19 Correct 260 ms 67788 KB Output is correct
20 Correct 967 ms 72020 KB Output is correct
21 Correct 835 ms 68436 KB Output is correct
22 Correct 1612 ms 165716 KB Output is correct
23 Correct 1701 ms 168276 KB Output is correct
24 Correct 2447 ms 168216 KB Output is correct
25 Correct 2469 ms 172200 KB Output is correct
26 Correct 2469 ms 168532 KB Output is correct
27 Correct 3324 ms 194232 KB Output is correct
28 Correct 521 ms 169920 KB Output is correct
29 Correct 2465 ms 168020 KB Output is correct
30 Correct 2600 ms 167508 KB Output is correct
31 Correct 2641 ms 168128 KB Output is correct
32 Correct 1063 ms 72824 KB Output is correct
33 Correct 278 ms 68300 KB Output is correct
34 Correct 617 ms 65012 KB Output is correct
35 Correct 621 ms 64852 KB Output is correct
36 Correct 810 ms 65360 KB Output is correct
37 Correct 788 ms 65364 KB Output is correct