oj.uz

Submission #965022

# Submission time Handle Problem Language Result Execution time Memory
965022 2024-04-18T03:13:16 Z Pannda Swapping Cities (APIO20_swap) C++17
37 / 100
 2000 ms 516236 KB 
#include "swap.h"

#include <bits/stdc++.h>
using namespace std;

struct DSU {
    vector<int> f;
    vector<int> siz;
    vector<int> deg;
    vector<int> ok;
    vector<vector<pair<int*, int>>> stk;

    DSU(int n) : f(n), siz(n, 1), deg(n, 0), ok(n, false) { iota(f.begin(), f.end(), 0); }

    int leader(int u) {
        while (u != f[u]) u = f[u];
        return u;
    }

    bool unionize(int u0, int v0) {
        stk.emplace_back();
        int u = leader(u0);
        int v = leader(v0);
        if (u == v) {
            stk.back().push_back({&ok[u], ok[u]}); ok[u] = true;
            return false;
        }
        if (siz[u] > siz[v]) swap(u, v);
        stk.back().push_back({&siz[v], siz[v]}); siz[v] += siz[u];
        stk.back().push_back({&deg[u0], deg[u0]}); deg[u0]++;
        stk.back().push_back({&deg[v0], deg[v0]}); deg[v0]++;
        stk.back().push_back({&ok[v], ok[v]}); if (deg[u0] >= 3 || deg[v0] >= 3) ok[v] = true; ok[v] = ok[v] | ok[u];
        stk.back().push_back({&f[u], f[u]}); f[u] = v;
        return true;
    }

    bool same(int u, int v) {
        return leader(u) == leader(v);
    }

    bool isOk(int u) {
        return ok[leader(u)];
    }

    void rollback() {
        for (auto [ptr, val] : stk.back()) {
            *ptr = val;
        }
        stk.pop_back();
    }
};
int n, m;
vector<array<int, 3>> edges;
const int B = 5000;
vector<DSU> dsus;
int b;

void init(int N, int M, vector<int> U, vector<int> V, vector<int> W) {
    n = N;
    m = M;
    edges.resize(m);
    for (int i = 0; i < m; i++) {
        edges[i] = {U[i], V[i], W[i]};
    }
    sort(edges.begin(), edges.end(), [&](array<int, 3> e0, array<int, 3> e1) { return e0[2] < e1[2]; });

    dsus.emplace_back(n);
    for (b = 0; B * b < m; b++) {
        dsus.push_back(dsus.back());
        for (int i = B * b; i < min(m, B * b + B); i++) {
            dsus.back().unionize(edges[i][0], edges[i][1]);
        }
    }
    b++;
}

int getMinimumFuelCapacity(int X, int Y) {
    if (!dsus.back().same(X, Y) || !dsus.back().isOk(X)) return -1;
    for (int b0 = 0; ; b0++) {
        if (dsus[b0 + 1].same(X, Y) && dsus[b0 + 1].isOk(X)) {
            int cnt = 0;
            int res;
            for (int i = B * b0; ; i++) {
                dsus[b0].unionize(edges[i][0], edges[i][1]);
                cnt++;
                if (dsus[b0].same(X, Y) && dsus[b0].isOk(X)) {
                    res = edges[i][2];
                    break;
                }
            }
            while (cnt--) dsus[b0].rollback();
            return res;
        }
    }
}

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 2 ms 628 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 111 ms 109472 KB Output is correct
10 Correct 168 ms 171860 KB Output is correct
11 Correct 148 ms 155296 KB Output is correct
12 Correct 173 ms 173144 KB Output is correct
13 Correct 161 ms 173212 KB Output is correct
14 Correct 108 ms 113296 KB Output is correct
15 Correct 213 ms 172636 KB Output is correct
16 Correct 195 ms 157712 KB Output is correct
17 Correct 208 ms 172656 KB Output is correct
18 Correct 195 ms 173232 KB Output is correct
19 Execution timed out 2061 ms 10236 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Execution timed out 2041 ms 158760 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 2 ms 628 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 600 KB Output is correct
13 Correct 2 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 2 ms 600 KB Output is correct
16 Correct 2 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 2 ms 860 KB Output is correct
25 Correct 2 ms 792 KB Output is correct
26 Correct 2 ms 860 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 2 ms 860 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 2 ms 628 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 111 ms 109472 KB Output is correct
11 Correct 168 ms 171860 KB Output is correct
12 Correct 148 ms 155296 KB Output is correct
13 Correct 173 ms 173144 KB Output is correct
14 Correct 161 ms 173212 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 600 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 2 ms 600 KB Output is correct
21 Correct 2 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 2 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 2 ms 860 KB Output is correct
30 Correct 2 ms 792 KB Output is correct
31 Correct 2 ms 860 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 2 ms 860 KB Output is correct
34 Correct 9 ms 6020 KB Output is correct
35 Correct 163 ms 174928 KB Output is correct
36 Correct 171 ms 173408 KB Output is correct
37 Correct 167 ms 172220 KB Output is correct
38 Correct 169 ms 170680 KB Output is correct
39 Correct 161 ms 171696 KB Output is correct
40 Correct 149 ms 140280 KB Output is correct
41 Correct 175 ms 174152 KB Output is correct
42 Correct 162 ms 170896 KB Output is correct
43 Correct 164 ms 172760 KB Output is correct
44 Correct 174 ms 173396 KB Output is correct
45 Correct 290 ms 308076 KB Output is correct
46 Correct 155 ms 173152 KB Output is correct
47 Correct 168 ms 189308 KB Output is correct
48 Correct 199 ms 216036 KB Output is correct
49 Correct 180 ms 177088 KB Output is correct
50 Correct 142 ms 124704 KB Output is correct
51 Correct 226 ms 224840 KB Output is correct
52 Correct 345 ms 391168 KB Output is correct
53 Correct 401 ms 424200 KB Output is correct
54 Correct 477 ms 516236 KB Output is correct
55 Correct 163 ms 187308 KB Output is correct
56 Correct 370 ms 419216 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 2 ms 628 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 111 ms 109472 KB Output is correct
10 Correct 168 ms 171860 KB Output is correct
11 Correct 148 ms 155296 KB Output is correct
12 Correct 173 ms 173144 KB Output is correct
13 Correct 161 ms 173212 KB Output is correct
14 Correct 108 ms 113296 KB Output is correct
15 Correct 213 ms 172636 KB Output is correct
16 Correct 195 ms 157712 KB Output is correct
17 Correct 208 ms 172656 KB Output is correct
18 Correct 195 ms 173232 KB Output is correct
19 Execution timed out 2041 ms 158760 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 2 ms 628 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 111 ms 109472 KB Output is correct
11 Correct 168 ms 171860 KB Output is correct
12 Correct 148 ms 155296 KB Output is correct
13 Correct 173 ms 173144 KB Output is correct
14 Correct 161 ms 173212 KB Output is correct
15 Correct 108 ms 113296 KB Output is correct
16 Correct 213 ms 172636 KB Output is correct
17 Correct 195 ms 157712 KB Output is correct
18 Correct 208 ms 172656 KB Output is correct
19 Correct 195 ms 173232 KB Output is correct
20 Execution timed out 2041 ms 158760 KB Time limit exceeded
21 Halted 0 ms 0 KB -