답안 #577912

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
577912 2022-06-15T12:38:24 Z Jomnoi 자매 도시 (APIO20_swap) C++17
100 / 100
408 ms 43292 KB
#include <bits/stdc++.h>
#include "swap.h"
using namespace std;

const int MAX_N = 2e5 + 5;
const int INF = 1e9 + 7;

int N, M;
int parent[MAX_N];
int degree[MAX_N];
int min_weight[MAX_N];
vector <int> graph[MAX_N];
int depth[MAX_N], par[MAX_N][20];

int find_parent(int u) {
    if(u == parent[u]) {
        return u;
    }
    return parent[u] = find_parent(parent[u]);
}

void merge(int u, int v, int w) {
    bool valid = (degree[u] > 1 or degree[v] > 1);
    degree[u]++, degree[v]++;

    u = find_parent(u), v = find_parent(v);
    if(u == v) {
        min_weight[u] = min(min_weight[u], w);
        return;
    }

    N++;
    parent[v] = parent[u] = N;
    graph[N].push_back(u);
    graph[N].push_back(v);
    if(valid == true or min_weight[u] != INF or min_weight[v] != INF) {
        min_weight[N] = w;
    }
}

void dfs(int u) {
    for(int i = 1; i < 20; i++) {
        par[u][i] = par[par[u][i - 1]][i - 1];
    }
    for(auto v : graph[u]) {
        par[v][0] = u;
        depth[v] = depth[u] + 1;
        min_weight[v] = min(min_weight[v], min_weight[u]);
        dfs(v);
    }
}

int find_lca(int u, int v) {
    if(depth[u] < depth[v]) {
        swap(u, v);
    }
    for(int i = 19; i >= 0; i--) {
        if(depth[par[u][i]] >= depth[v]) {
            u = par[u][i];
        }
    }
    for(int i = 19; i >= 0; i--) {
        if(par[u][i] != par[v][i]) {
            u = par[u][i], v = par[v][i];
        }
    }
    return (u == v ? u : par[u][0]);
}

void init(int n, int m, vector <int> U, vector <int> V, vector <int> W) {
    N = n, M = m;

    vector <tuple <int, int, int>> edges;
    for(int i = 0; i < m; i++) {
        edges.emplace_back(W[i], U[i] + 1, V[i] + 1);
    }

    sort(edges.begin(), edges.end());

    fill(min_weight, min_weight + MAX_N, INF);
    iota(parent, parent + MAX_N, 0);
    for(auto [w, u, v] : edges) {
        merge(u, v, w);
    }

    depth[0] = -1;
    dfs(N);

    for(int i = 1; i <= N; i++) {
        if(min_weight[i] == INF) {
            min_weight[i] = -1;
        }
    }
}

int getMinimumFuelCapacity(int X, int Y) {
    return min_weight[find_lca(X + 1, Y + 1)];
}
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 6484 KB Output is correct
2 Correct 3 ms 6484 KB Output is correct
3 Correct 4 ms 6484 KB Output is correct
4 Correct 4 ms 6612 KB Output is correct
5 Correct 4 ms 6740 KB Output is correct
6 Correct 5 ms 6740 KB Output is correct
7 Correct 5 ms 6740 KB Output is correct
8 Correct 4 ms 6820 KB Output is correct
9 Correct 88 ms 26604 KB Output is correct
10 Correct 117 ms 31200 KB Output is correct
11 Correct 111 ms 30728 KB Output is correct
12 Correct 116 ms 32136 KB Output is correct
13 Correct 102 ms 36024 KB Output is correct
14 Correct 108 ms 26860 KB Output is correct
15 Correct 258 ms 35076 KB Output is correct
16 Correct 252 ms 34368 KB Output is correct
17 Correct 283 ms 36012 KB Output is correct
18 Correct 408 ms 40028 KB Output is correct
19 Correct 107 ms 15532 KB Output is correct
20 Correct 297 ms 35400 KB Output is correct
21 Correct 268 ms 34816 KB Output is correct
22 Correct 278 ms 36444 KB Output is correct
23 Correct 354 ms 40288 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 6484 KB Output is correct
2 Correct 3 ms 6484 KB Output is correct
3 Correct 291 ms 42044 KB Output is correct
4 Correct 323 ms 43292 KB Output is correct
5 Correct 327 ms 42704 KB Output is correct
6 Correct 293 ms 43120 KB Output is correct
7 Correct 312 ms 42984 KB Output is correct
8 Correct 296 ms 41636 KB Output is correct
9 Correct 323 ms 42732 KB Output is correct
10 Correct 303 ms 41416 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 6484 KB Output is correct
2 Correct 3 ms 6484 KB Output is correct
3 Correct 4 ms 6484 KB Output is correct
4 Correct 4 ms 6612 KB Output is correct
5 Correct 4 ms 6740 KB Output is correct
6 Correct 5 ms 6740 KB Output is correct
7 Correct 5 ms 6740 KB Output is correct
8 Correct 4 ms 6820 KB Output is correct
9 Correct 4 ms 6484 KB Output is correct
10 Correct 6 ms 6816 KB Output is correct
11 Correct 5 ms 6740 KB Output is correct
12 Correct 6 ms 6824 KB Output is correct
13 Correct 7 ms 6740 KB Output is correct
14 Correct 5 ms 6688 KB Output is correct
15 Correct 5 ms 6740 KB Output is correct
16 Correct 4 ms 6820 KB Output is correct
17 Correct 4 ms 6868 KB Output is correct
18 Correct 5 ms 6740 KB Output is correct
19 Correct 5 ms 6688 KB Output is correct
20 Correct 5 ms 6828 KB Output is correct
21 Correct 4 ms 6740 KB Output is correct
22 Correct 4 ms 6740 KB Output is correct
23 Correct 5 ms 6692 KB Output is correct
24 Correct 5 ms 6868 KB Output is correct
25 Correct 5 ms 6868 KB Output is correct
26 Correct 6 ms 6820 KB Output is correct
27 Correct 4 ms 6868 KB Output is correct
28 Correct 6 ms 6868 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 6484 KB Output is correct
2 Correct 3 ms 6484 KB Output is correct
3 Correct 3 ms 6484 KB Output is correct
4 Correct 4 ms 6484 KB Output is correct
5 Correct 4 ms 6612 KB Output is correct
6 Correct 4 ms 6740 KB Output is correct
7 Correct 5 ms 6740 KB Output is correct
8 Correct 5 ms 6740 KB Output is correct
9 Correct 4 ms 6820 KB Output is correct
10 Correct 88 ms 26604 KB Output is correct
11 Correct 117 ms 31200 KB Output is correct
12 Correct 111 ms 30728 KB Output is correct
13 Correct 116 ms 32136 KB Output is correct
14 Correct 102 ms 36024 KB Output is correct
15 Correct 6 ms 6816 KB Output is correct
16 Correct 5 ms 6740 KB Output is correct
17 Correct 6 ms 6824 KB Output is correct
18 Correct 7 ms 6740 KB Output is correct
19 Correct 5 ms 6688 KB Output is correct
20 Correct 5 ms 6740 KB Output is correct
21 Correct 4 ms 6820 KB Output is correct
22 Correct 4 ms 6868 KB Output is correct
23 Correct 5 ms 6740 KB Output is correct
24 Correct 5 ms 6688 KB Output is correct
25 Correct 5 ms 6828 KB Output is correct
26 Correct 4 ms 6740 KB Output is correct
27 Correct 4 ms 6740 KB Output is correct
28 Correct 5 ms 6692 KB Output is correct
29 Correct 5 ms 6868 KB Output is correct
30 Correct 5 ms 6868 KB Output is correct
31 Correct 6 ms 6820 KB Output is correct
32 Correct 4 ms 6868 KB Output is correct
33 Correct 6 ms 6868 KB Output is correct
34 Correct 19 ms 9956 KB Output is correct
35 Correct 138 ms 31764 KB Output is correct
36 Correct 126 ms 31876 KB Output is correct
37 Correct 119 ms 31808 KB Output is correct
38 Correct 114 ms 31476 KB Output is correct
39 Correct 115 ms 31276 KB Output is correct
40 Correct 104 ms 29292 KB Output is correct
41 Correct 150 ms 32040 KB Output is correct
42 Correct 124 ms 31784 KB Output is correct
43 Correct 105 ms 36988 KB Output is correct
44 Correct 120 ms 32196 KB Output is correct
45 Correct 131 ms 32532 KB Output is correct
46 Correct 126 ms 31936 KB Output is correct
47 Correct 145 ms 31892 KB Output is correct
48 Correct 132 ms 33868 KB Output is correct
49 Correct 65 ms 15176 KB Output is correct
50 Correct 51 ms 14728 KB Output is correct
51 Correct 102 ms 28120 KB Output is correct
52 Correct 159 ms 35540 KB Output is correct
53 Correct 180 ms 37408 KB Output is correct
54 Correct 184 ms 37408 KB Output is correct
55 Correct 131 ms 36484 KB Output is correct
56 Correct 163 ms 38496 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 6484 KB Output is correct
2 Correct 3 ms 6484 KB Output is correct
3 Correct 4 ms 6484 KB Output is correct
4 Correct 4 ms 6612 KB Output is correct
5 Correct 4 ms 6740 KB Output is correct
6 Correct 5 ms 6740 KB Output is correct
7 Correct 5 ms 6740 KB Output is correct
8 Correct 4 ms 6820 KB Output is correct
9 Correct 88 ms 26604 KB Output is correct
10 Correct 117 ms 31200 KB Output is correct
11 Correct 111 ms 30728 KB Output is correct
12 Correct 116 ms 32136 KB Output is correct
13 Correct 102 ms 36024 KB Output is correct
14 Correct 108 ms 26860 KB Output is correct
15 Correct 258 ms 35076 KB Output is correct
16 Correct 252 ms 34368 KB Output is correct
17 Correct 283 ms 36012 KB Output is correct
18 Correct 408 ms 40028 KB Output is correct
19 Correct 291 ms 42044 KB Output is correct
20 Correct 323 ms 43292 KB Output is correct
21 Correct 327 ms 42704 KB Output is correct
22 Correct 293 ms 43120 KB Output is correct
23 Correct 312 ms 42984 KB Output is correct
24 Correct 296 ms 41636 KB Output is correct
25 Correct 323 ms 42732 KB Output is correct
26 Correct 303 ms 41416 KB Output is correct
27 Correct 6 ms 6816 KB Output is correct
28 Correct 5 ms 6740 KB Output is correct
29 Correct 6 ms 6824 KB Output is correct
30 Correct 7 ms 6740 KB Output is correct
31 Correct 5 ms 6688 KB Output is correct
32 Correct 5 ms 6740 KB Output is correct
33 Correct 4 ms 6820 KB Output is correct
34 Correct 4 ms 6868 KB Output is correct
35 Correct 5 ms 6740 KB Output is correct
36 Correct 19 ms 9956 KB Output is correct
37 Correct 138 ms 31764 KB Output is correct
38 Correct 126 ms 31876 KB Output is correct
39 Correct 119 ms 31808 KB Output is correct
40 Correct 114 ms 31476 KB Output is correct
41 Correct 115 ms 31276 KB Output is correct
42 Correct 104 ms 29292 KB Output is correct
43 Correct 150 ms 32040 KB Output is correct
44 Correct 124 ms 31784 KB Output is correct
45 Correct 105 ms 36988 KB Output is correct
46 Correct 120 ms 32196 KB Output is correct
47 Correct 28 ms 10104 KB Output is correct
48 Correct 346 ms 35716 KB Output is correct
49 Correct 264 ms 35732 KB Output is correct
50 Correct 288 ms 35596 KB Output is correct
51 Correct 268 ms 35480 KB Output is correct
52 Correct 245 ms 33988 KB Output is correct
53 Correct 251 ms 28676 KB Output is correct
54 Correct 289 ms 36472 KB Output is correct
55 Correct 300 ms 35748 KB Output is correct
56 Correct 404 ms 39708 KB Output is correct
57 Correct 256 ms 36488 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 6484 KB Output is correct
2 Correct 3 ms 6484 KB Output is correct
3 Correct 3 ms 6484 KB Output is correct
4 Correct 4 ms 6484 KB Output is correct
5 Correct 4 ms 6612 KB Output is correct
6 Correct 4 ms 6740 KB Output is correct
7 Correct 5 ms 6740 KB Output is correct
8 Correct 5 ms 6740 KB Output is correct
9 Correct 4 ms 6820 KB Output is correct
10 Correct 88 ms 26604 KB Output is correct
11 Correct 117 ms 31200 KB Output is correct
12 Correct 111 ms 30728 KB Output is correct
13 Correct 116 ms 32136 KB Output is correct
14 Correct 102 ms 36024 KB Output is correct
15 Correct 108 ms 26860 KB Output is correct
16 Correct 258 ms 35076 KB Output is correct
17 Correct 252 ms 34368 KB Output is correct
18 Correct 283 ms 36012 KB Output is correct
19 Correct 408 ms 40028 KB Output is correct
20 Correct 291 ms 42044 KB Output is correct
21 Correct 323 ms 43292 KB Output is correct
22 Correct 327 ms 42704 KB Output is correct
23 Correct 293 ms 43120 KB Output is correct
24 Correct 312 ms 42984 KB Output is correct
25 Correct 296 ms 41636 KB Output is correct
26 Correct 323 ms 42732 KB Output is correct
27 Correct 303 ms 41416 KB Output is correct
28 Correct 6 ms 6816 KB Output is correct
29 Correct 5 ms 6740 KB Output is correct
30 Correct 6 ms 6824 KB Output is correct
31 Correct 7 ms 6740 KB Output is correct
32 Correct 5 ms 6688 KB Output is correct
33 Correct 5 ms 6740 KB Output is correct
34 Correct 4 ms 6820 KB Output is correct
35 Correct 4 ms 6868 KB Output is correct
36 Correct 5 ms 6740 KB Output is correct
37 Correct 19 ms 9956 KB Output is correct
38 Correct 138 ms 31764 KB Output is correct
39 Correct 126 ms 31876 KB Output is correct
40 Correct 119 ms 31808 KB Output is correct
41 Correct 114 ms 31476 KB Output is correct
42 Correct 115 ms 31276 KB Output is correct
43 Correct 104 ms 29292 KB Output is correct
44 Correct 150 ms 32040 KB Output is correct
45 Correct 124 ms 31784 KB Output is correct
46 Correct 105 ms 36988 KB Output is correct
47 Correct 120 ms 32196 KB Output is correct
48 Correct 28 ms 10104 KB Output is correct
49 Correct 346 ms 35716 KB Output is correct
50 Correct 264 ms 35732 KB Output is correct
51 Correct 288 ms 35596 KB Output is correct
52 Correct 268 ms 35480 KB Output is correct
53 Correct 245 ms 33988 KB Output is correct
54 Correct 251 ms 28676 KB Output is correct
55 Correct 289 ms 36472 KB Output is correct
56 Correct 300 ms 35748 KB Output is correct
57 Correct 404 ms 39708 KB Output is correct
58 Correct 256 ms 36488 KB Output is correct
59 Correct 107 ms 15532 KB Output is correct
60 Correct 297 ms 35400 KB Output is correct
61 Correct 268 ms 34816 KB Output is correct
62 Correct 278 ms 36444 KB Output is correct
63 Correct 354 ms 40288 KB Output is correct
64 Correct 5 ms 6688 KB Output is correct
65 Correct 5 ms 6828 KB Output is correct
66 Correct 4 ms 6740 KB Output is correct
67 Correct 4 ms 6740 KB Output is correct
68 Correct 5 ms 6692 KB Output is correct
69 Correct 5 ms 6868 KB Output is correct
70 Correct 5 ms 6868 KB Output is correct
71 Correct 6 ms 6820 KB Output is correct
72 Correct 4 ms 6868 KB Output is correct
73 Correct 6 ms 6868 KB Output is correct
74 Correct 131 ms 32532 KB Output is correct
75 Correct 126 ms 31936 KB Output is correct
76 Correct 145 ms 31892 KB Output is correct
77 Correct 132 ms 33868 KB Output is correct
78 Correct 65 ms 15176 KB Output is correct
79 Correct 51 ms 14728 KB Output is correct
80 Correct 102 ms 28120 KB Output is correct
81 Correct 159 ms 35540 KB Output is correct
82 Correct 180 ms 37408 KB Output is correct
83 Correct 184 ms 37408 KB Output is correct
84 Correct 131 ms 36484 KB Output is correct
85 Correct 163 ms 38496 KB Output is correct
86 Correct 84 ms 17168 KB Output is correct
87 Correct 329 ms 35688 KB Output is correct
88 Correct 256 ms 35740 KB Output is correct
89 Correct 294 ms 36208 KB Output is correct
90 Correct 175 ms 19224 KB Output is correct
91 Correct 191 ms 20716 KB Output is correct
92 Correct 260 ms 31680 KB Output is correct
93 Correct 349 ms 39344 KB Output is correct
94 Correct 313 ms 41092 KB Output is correct
95 Correct 329 ms 41396 KB Output is correct
96 Correct 370 ms 39980 KB Output is correct
97 Correct 325 ms 40084 KB Output is correct