oj.uz

답안 #965031

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
965031 2024-04-18T03:37:36 Z Pannda 자매 도시 (APIO20_swap) C++17
17 / 100
 2000 ms 524536 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 = 400;
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());
        dsus.back().stk.clear();
        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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 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 600 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 141 ms 261420 KB Output is correct
10 Correct 185 ms 385564 KB Output is correct
11 Correct 209 ms 373796 KB Output is correct
12 Correct 197 ms 416076 KB Output is correct
13 Correct 194 ms 416052 KB Output is correct
14 Correct 142 ms 260548 KB Output is correct
15 Correct 238 ms 393892 KB Output is correct
16 Correct 231 ms 372740 KB Output is correct
17 Correct 261 ms 419000 KB Output is correct
18 Correct 248 ms 419020 KB Output is correct
19 Execution timed out 2041 ms 16780 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Execution timed out 2036 ms 379976 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 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 600 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 432 KB Output is correct
10 Correct 1 ms 704 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 600 KB Output is correct
13 Correct 1 ms 704 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 2 ms 604 KB Output is correct
18 Correct 1 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 2 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 604 KB Output is correct
25 Correct 2 ms 860 KB Output is correct
26 Correct 1 ms 860 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 2 ms 752 KB Output is correct

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 432 KB Output is correct
2 Correct 0 ms 348 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 600 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 141 ms 261420 KB Output is correct
11 Correct 185 ms 385564 KB Output is correct
12 Correct 209 ms 373796 KB Output is correct
13 Correct 197 ms 416076 KB Output is correct
14 Correct 194 ms 416052 KB Output is correct
15 Correct 1 ms 704 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 600 KB Output is correct
18 Correct 1 ms 704 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 2 ms 604 KB Output is correct
23 Correct 1 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 2 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 604 KB Output is correct
30 Correct 2 ms 860 KB Output is correct
31 Correct 1 ms 860 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 2 ms 752 KB Output is correct
34 Correct 12 ms 11104 KB Output is correct
35 Correct 203 ms 415872 KB Output is correct
36 Correct 212 ms 416084 KB Output is correct
37 Correct 198 ms 416080 KB Output is correct
38 Correct 209 ms 406952 KB Output is correct
39 Correct 222 ms 401244 KB Output is correct
40 Correct 172 ms 338292 KB Output is correct
41 Correct 208 ms 416080 KB Output is correct
42 Correct 195 ms 415876 KB Output is correct
43 Correct 207 ms 415848 KB Output is correct
44 Correct 203 ms 415960 KB Output is correct
45 Correct 298 ms 479248 KB Output is correct
46 Correct 223 ms 416552 KB Output is correct
47 Correct 205 ms 418128 KB Output is correct
48 Correct 270 ms 448264 KB Output is correct
49 Correct 82 ms 24216 KB Output is correct
50 Correct 66 ms 49496 KB Output is correct
51 Correct 224 ms 346860 KB Output is correct
52 Runtime error 336 ms 524536 KB Execution killed with signal 9
53 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 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 600 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 141 ms 261420 KB Output is correct
10 Correct 185 ms 385564 KB Output is correct
11 Correct 209 ms 373796 KB Output is correct
12 Correct 197 ms 416076 KB Output is correct
13 Correct 194 ms 416052 KB Output is correct
14 Correct 142 ms 260548 KB Output is correct
15 Correct 238 ms 393892 KB Output is correct
16 Correct 231 ms 372740 KB Output is correct
17 Correct 261 ms 419000 KB Output is correct
18 Correct 248 ms 419020 KB Output is correct
19 Execution timed out 2036 ms 379976 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 432 KB Output is correct
2 Correct 0 ms 348 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 600 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 141 ms 261420 KB Output is correct
11 Correct 185 ms 385564 KB Output is correct
12 Correct 209 ms 373796 KB Output is correct
13 Correct 197 ms 416076 KB Output is correct
14 Correct 194 ms 416052 KB Output is correct
15 Correct 142 ms 260548 KB Output is correct
16 Correct 238 ms 393892 KB Output is correct
17 Correct 231 ms 372740 KB Output is correct
18 Correct 261 ms 419000 KB Output is correct
19 Correct 248 ms 419020 KB Output is correct
20 Execution timed out 2036 ms 379976 KB Time limit exceeded
21 Halted 0 ms 0 KB -