oj.uz

Submission #397885

# Submission time Handle Problem Language Result Execution time Memory
397885 2021-05-03T10:47:06 Z yuto1115 Swapping Cities (APIO20_swap) C++17
100 / 100
 1186 ms 59948 KB 
#include "swap.h"
#include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < ll(n); i++)
#define rep2(i, s, n) for(ll i = ll(s); i < ll(n); i++)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define pb push_back
#define eb emplace_back
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vp = vector<P>;
using vvp = vector<vp>;
using vb = vector<bool>;
using vvb = vector<vb>;

template<class T>
bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

const int inf = 1001001001;

class unionfind {
    int n;
public:
    vi par, rank;
    
    unionfind(int n) : n(n), par(n, -1), rank(n, 0) {}
    
    int root(int x) {
        if (par[x] < 0) return x;
        return par[x] = root(par[x]);
    }
    
    bool same(int x, int y) {
        return root(x) == root(y);
    }
    
    bool merge(int x, int y) {
        x = root(x), y = root(y);
        if (x == y) return false;
        if (rank[x] == rank[y]) rank[x]++;
        par[x] += par[y];
        par[y] = x;
        return true;
    }
};

namespace {
    struct node {
        int mx;
        bool is_path;
        int x, y;
        
        node(int mx, bool is_path = false, int x = 0, int y = 0)
            : mx(mx), is_path(is_path), x(x), y(y) {}
    };
    
    vector<node> nodes;
    vvi G;
    int sz;
    vvi par;
    vi dep;
    
    int lca(int u, int v) {
        if (dep[u] > dep[v]) swap(u, v);
        if (dep[u] < dep[v]) {
            int dis = dep[v] - dep[u];
            rep(k, 30) if (dis >> k & 1) v = par[k][v];
        }
        assert(dep[u] == dep[v]);
        if (u == v) return u;
        for (int k = 29; k >= 0; k--) {
            if (par[k][u] == par[k][v]) continue;
            u = par[k][u];
            v = par[k][v];
        }
        assert(u != v and par[0][u] == par[0][v]);
        return par[0][u];
    }
}

void dfs(int u, int p, int d) {
    par[0][u] = p;
    dep[u] = d;
    for (int v : G[u]) {
        if (v == p) continue;
        dfs(v, u, d + 1);
    }
}

void init(int n, int m, vi u, vi v, vi w) {
    vi ord(m);
    iota(all(ord), 0);
    sort(all(ord), [&](int i, int j) { return w[i] < w[j]; });
    unionfind uf(n);
    map<int, int> mp;
    rep(i, n) {
        nodes.eb(0, true, i, i);
        mp[i] = i;
    }
    G.resize(n + m + 10);
    for (int i : ord) {
        int a = u[i], b = v[i];
        if (uf.same(a, b)) {
            int r = uf.root(a);
            int now = mp[r];
            if (!nodes[now].is_path) continue;
            int nx = nodes.size();
            G[now].pb(nx);
            G[nx].pb(now);
            nodes.eb(w[i]);
            mp[r] = nx;
        } else {
            int ra = uf.root(a), rb = uf.root(b);
            if (uf.rank[ra] < uf.rank[rb]) {
                swap(a, b);
                swap(ra, rb);
            }
            uf.merge(ra, rb);
            int na = mp[ra], nb = mp[rb];
            int nx = nodes.size();
            G[na].pb(nx);
            G[nb].pb(nx);
            G[nx].pb(na);
            G[nx].pb(nb);
            if (!nodes[na].is_path or !nodes[nb].is_path) {
                nodes.eb(w[i]);
            } else {
                int nx_x = -1, nx_y = -1;
                if (nodes[na].x == a) nx_x = nodes[na].y;
                else if (nodes[na].y == a) nx_x = nodes[na].x;
                if (nodes[nb].x == b) nx_y = nodes[nb].y;
                else if (nodes[nb].y == b) nx_y = nodes[nb].x;
                if (nx_x == -1 or nx_y == -1) {
                    nodes.eb(w[i]);
                } else {
                    nodes.eb(w[i], true, nx_x, nx_y);
                }
            }
            mp.erase(rb);
            mp[ra] = nx;
        }
    }
    assert(mp.size() == 1);
    sz = nodes.size();
    par.resize(30);
    rep(k, 30) par[k].resize(sz);
    dep.resize(sz);
    dfs(sz - 1, -1, 0);
    rep(k, 29) rep(i, sz) {
            if (par[k][i] < 0) par[k + 1][i] = -1;
            else par[k + 1][i] = par[k][par[k][i]];
        }
}

int getMinimumFuelCapacity(int x, int y) {
    int l = lca(x, y);
    if (!nodes[l].is_path) return nodes[l].mx;
    if (nodes[sz - 1].is_path) return -1;
    for (int k = 29; k >= 0; k--) {
        if (par[k][l] < 0) continue;
        if (!nodes[par[k][l]].is_path) continue;
        l = par[k][l];
    }
    assert(nodes[l].is_path);
    l = par[0][l];
    assert(!nodes[l].is_path);
    return nodes[l].mx;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 2 ms 716 KB Output is correct
6 Correct 2 ms 588 KB Output is correct
7 Correct 2 ms 736 KB Output is correct
8 Correct 2 ms 716 KB Output is correct
9 Correct 251 ms 35984 KB Output is correct
10 Correct 309 ms 43976 KB Output is correct
11 Correct 298 ms 43228 KB Output is correct
12 Correct 325 ms 45868 KB Output is correct
13 Correct 249 ms 48160 KB Output is correct
14 Correct 306 ms 36268 KB Output is correct
15 Correct 991 ms 46232 KB Output is correct
16 Correct 934 ms 44920 KB Output is correct
17 Correct 982 ms 47612 KB Output is correct
18 Correct 973 ms 49964 KB Output is correct
19 Correct 210 ms 12552 KB Output is correct
20 Correct 993 ms 46684 KB Output is correct
21 Correct 984 ms 45344 KB Output is correct
22 Correct 999 ms 48064 KB Output is correct
23 Correct 993 ms 50464 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1046 ms 49964 KB Output is correct
4 Correct 1024 ms 52052 KB Output is correct
5 Correct 1052 ms 50656 KB Output is correct
6 Correct 1016 ms 51808 KB Output is correct
7 Correct 1051 ms 51240 KB Output is correct
8 Correct 962 ms 49472 KB Output is correct
9 Correct 998 ms 50984 KB Output is correct
10 Correct 1012 ms 49996 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 2 ms 716 KB Output is correct
6 Correct 2 ms 588 KB Output is correct
7 Correct 2 ms 736 KB Output is correct
8 Correct 2 ms 716 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 2 ms 716 KB Output is correct
11 Correct 2 ms 716 KB Output is correct
12 Correct 2 ms 716 KB Output is correct
13 Correct 2 ms 588 KB Output is correct
14 Correct 2 ms 588 KB Output is correct
15 Correct 2 ms 716 KB Output is correct
16 Correct 2 ms 692 KB Output is correct
17 Correct 2 ms 716 KB Output is correct
18 Correct 2 ms 716 KB Output is correct
19 Correct 2 ms 588 KB Output is correct
20 Correct 2 ms 696 KB Output is correct
21 Correct 2 ms 716 KB Output is correct
22 Correct 2 ms 432 KB Output is correct
23 Correct 2 ms 588 KB Output is correct
24 Correct 3 ms 820 KB Output is correct
25 Correct 3 ms 844 KB Output is correct
26 Correct 3 ms 820 KB Output is correct
27 Correct 2 ms 716 KB Output is correct
28 Correct 3 ms 820 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 2 ms 716 KB Output is correct
7 Correct 2 ms 588 KB Output is correct
8 Correct 2 ms 736 KB Output is correct
9 Correct 2 ms 716 KB Output is correct
10 Correct 251 ms 35984 KB Output is correct
11 Correct 309 ms 43976 KB Output is correct
12 Correct 298 ms 43228 KB Output is correct
13 Correct 325 ms 45868 KB Output is correct
14 Correct 249 ms 48160 KB Output is correct
15 Correct 2 ms 716 KB Output is correct
16 Correct 2 ms 716 KB Output is correct
17 Correct 2 ms 716 KB Output is correct
18 Correct 2 ms 588 KB Output is correct
19 Correct 2 ms 588 KB Output is correct
20 Correct 2 ms 716 KB Output is correct
21 Correct 2 ms 692 KB Output is correct
22 Correct 2 ms 716 KB Output is correct
23 Correct 2 ms 716 KB Output is correct
24 Correct 2 ms 588 KB Output is correct
25 Correct 2 ms 696 KB Output is correct
26 Correct 2 ms 716 KB Output is correct
27 Correct 2 ms 432 KB Output is correct
28 Correct 2 ms 588 KB Output is correct
29 Correct 3 ms 820 KB Output is correct
30 Correct 3 ms 844 KB Output is correct
31 Correct 3 ms 820 KB Output is correct
32 Correct 2 ms 716 KB Output is correct
33 Correct 3 ms 820 KB Output is correct
34 Correct 27 ms 6332 KB Output is correct
35 Correct 300 ms 45588 KB Output is correct
36 Correct 309 ms 45592 KB Output is correct
37 Correct 306 ms 45460 KB Output is correct
38 Correct 291 ms 44860 KB Output is correct
39 Correct 299 ms 44676 KB Output is correct
40 Correct 263 ms 40912 KB Output is correct
41 Correct 306 ms 45844 KB Output is correct
42 Correct 302 ms 45612 KB Output is correct
43 Correct 236 ms 48540 KB Output is correct
44 Correct 309 ms 45748 KB Output is correct
45 Correct 256 ms 41260 KB Output is correct
46 Correct 305 ms 45484 KB Output is correct
47 Correct 296 ms 45384 KB Output is correct
48 Correct 281 ms 46440 KB Output is correct
49 Correct 77 ms 10976 KB Output is correct
50 Correct 68 ms 11584 KB Output is correct
51 Correct 206 ms 34412 KB Output is correct
52 Correct 337 ms 49156 KB Output is correct
53 Correct 411 ms 56184 KB Output is correct
54 Correct 368 ms 51112 KB Output is correct
55 Correct 236 ms 48272 KB Output is correct
56 Correct 341 ms 50988 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 2 ms 716 KB Output is correct
6 Correct 2 ms 588 KB Output is correct
7 Correct 2 ms 736 KB Output is correct
8 Correct 2 ms 716 KB Output is correct
9 Correct 251 ms 35984 KB Output is correct
10 Correct 309 ms 43976 KB Output is correct
11 Correct 298 ms 43228 KB Output is correct
12 Correct 325 ms 45868 KB Output is correct
13 Correct 249 ms 48160 KB Output is correct
14 Correct 306 ms 36268 KB Output is correct
15 Correct 991 ms 46232 KB Output is correct
16 Correct 934 ms 44920 KB Output is correct
17 Correct 982 ms 47612 KB Output is correct
18 Correct 973 ms 49964 KB Output is correct
19 Correct 1046 ms 49964 KB Output is correct
20 Correct 1024 ms 52052 KB Output is correct
21 Correct 1052 ms 50656 KB Output is correct
22 Correct 1016 ms 51808 KB Output is correct
23 Correct 1051 ms 51240 KB Output is correct
24 Correct 962 ms 49472 KB Output is correct
25 Correct 998 ms 50984 KB Output is correct
26 Correct 1012 ms 49996 KB Output is correct
27 Correct 2 ms 716 KB Output is correct
28 Correct 2 ms 716 KB Output is correct
29 Correct 2 ms 716 KB Output is correct
30 Correct 2 ms 588 KB Output is correct
31 Correct 2 ms 588 KB Output is correct
32 Correct 2 ms 716 KB Output is correct
33 Correct 2 ms 692 KB Output is correct
34 Correct 2 ms 716 KB Output is correct
35 Correct 2 ms 716 KB Output is correct
36 Correct 27 ms 6332 KB Output is correct
37 Correct 300 ms 45588 KB Output is correct
38 Correct 309 ms 45592 KB Output is correct
39 Correct 306 ms 45460 KB Output is correct
40 Correct 291 ms 44860 KB Output is correct
41 Correct 299 ms 44676 KB Output is correct
42 Correct 263 ms 40912 KB Output is correct
43 Correct 306 ms 45844 KB Output is correct
44 Correct 302 ms 45612 KB Output is correct
45 Correct 236 ms 48540 KB Output is correct
46 Correct 309 ms 45748 KB Output is correct
47 Correct 44 ms 6420 KB Output is correct
48 Correct 1020 ms 49428 KB Output is correct
49 Correct 966 ms 49376 KB Output is correct
50 Correct 931 ms 49196 KB Output is correct
51 Correct 913 ms 49196 KB Output is correct
52 Correct 864 ms 46508 KB Output is correct
53 Correct 649 ms 35484 KB Output is correct
54 Correct 1025 ms 50132 KB Output is correct
55 Correct 1036 ms 49388 KB Output is correct
56 Correct 1028 ms 51884 KB Output is correct
57 Correct 902 ms 50192 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 2 ms 716 KB Output is correct
7 Correct 2 ms 588 KB Output is correct
8 Correct 2 ms 736 KB Output is correct
9 Correct 2 ms 716 KB Output is correct
10 Correct 251 ms 35984 KB Output is correct
11 Correct 309 ms 43976 KB Output is correct
12 Correct 298 ms 43228 KB Output is correct
13 Correct 325 ms 45868 KB Output is correct
14 Correct 249 ms 48160 KB Output is correct
15 Correct 306 ms 36268 KB Output is correct
16 Correct 991 ms 46232 KB Output is correct
17 Correct 934 ms 44920 KB Output is correct
18 Correct 982 ms 47612 KB Output is correct
19 Correct 973 ms 49964 KB Output is correct
20 Correct 1046 ms 49964 KB Output is correct
21 Correct 1024 ms 52052 KB Output is correct
22 Correct 1052 ms 50656 KB Output is correct
23 Correct 1016 ms 51808 KB Output is correct
24 Correct 1051 ms 51240 KB Output is correct
25 Correct 962 ms 49472 KB Output is correct
26 Correct 998 ms 50984 KB Output is correct
27 Correct 1012 ms 49996 KB Output is correct
28 Correct 2 ms 716 KB Output is correct
29 Correct 2 ms 716 KB Output is correct
30 Correct 2 ms 716 KB Output is correct
31 Correct 2 ms 588 KB Output is correct
32 Correct 2 ms 588 KB Output is correct
33 Correct 2 ms 716 KB Output is correct
34 Correct 2 ms 692 KB Output is correct
35 Correct 2 ms 716 KB Output is correct
36 Correct 2 ms 716 KB Output is correct
37 Correct 27 ms 6332 KB Output is correct
38 Correct 300 ms 45588 KB Output is correct
39 Correct 309 ms 45592 KB Output is correct
40 Correct 306 ms 45460 KB Output is correct
41 Correct 291 ms 44860 KB Output is correct
42 Correct 299 ms 44676 KB Output is correct
43 Correct 263 ms 40912 KB Output is correct
44 Correct 306 ms 45844 KB Output is correct
45 Correct 302 ms 45612 KB Output is correct
46 Correct 236 ms 48540 KB Output is correct
47 Correct 309 ms 45748 KB Output is correct
48 Correct 44 ms 6420 KB Output is correct
49 Correct 1020 ms 49428 KB Output is correct
50 Correct 966 ms 49376 KB Output is correct
51 Correct 931 ms 49196 KB Output is correct
52 Correct 913 ms 49196 KB Output is correct
53 Correct 864 ms 46508 KB Output is correct
54 Correct 649 ms 35484 KB Output is correct
55 Correct 1025 ms 50132 KB Output is correct
56 Correct 1036 ms 49388 KB Output is correct
57 Correct 1028 ms 51884 KB Output is correct
58 Correct 902 ms 50192 KB Output is correct
59 Correct 210 ms 12552 KB Output is correct
60 Correct 993 ms 46684 KB Output is correct
61 Correct 984 ms 45344 KB Output is correct
62 Correct 999 ms 48064 KB Output is correct
63 Correct 993 ms 50464 KB Output is correct
64 Correct 2 ms 588 KB Output is correct
65 Correct 2 ms 696 KB Output is correct
66 Correct 2 ms 716 KB Output is correct
67 Correct 2 ms 432 KB Output is correct
68 Correct 2 ms 588 KB Output is correct
69 Correct 3 ms 820 KB Output is correct
70 Correct 3 ms 844 KB Output is correct
71 Correct 3 ms 820 KB Output is correct
72 Correct 2 ms 716 KB Output is correct
73 Correct 3 ms 820 KB Output is correct
74 Correct 256 ms 41260 KB Output is correct
75 Correct 305 ms 45484 KB Output is correct
76 Correct 296 ms 45384 KB Output is correct
77 Correct 281 ms 46440 KB Output is correct
78 Correct 77 ms 10976 KB Output is correct
79 Correct 68 ms 11584 KB Output is correct
80 Correct 206 ms 34412 KB Output is correct
81 Correct 337 ms 49156 KB Output is correct
82 Correct 411 ms 56184 KB Output is correct
83 Correct 368 ms 51112 KB Output is correct
84 Correct 236 ms 48272 KB Output is correct
85 Correct 341 ms 50988 KB Output is correct
86 Correct 168 ms 17140 KB Output is correct
87 Correct 938 ms 49508 KB Output is correct
88 Correct 942 ms 49452 KB Output is correct
89 Correct 1034 ms 47576 KB Output is correct
90 Correct 242 ms 15804 KB Output is correct
91 Correct 293 ms 19028 KB Output is correct
92 Correct 819 ms 38760 KB Output is correct
93 Correct 1004 ms 54084 KB Output is correct
94 Correct 1186 ms 59948 KB Output is correct
95 Correct 1097 ms 56628 KB Output is correct
96 Correct 999 ms 52012 KB Output is correct
97 Correct 1099 ms 53548 KB Output is correct