oj.uz

Submission #667924

# Submission time Handle Problem Language Result Execution time Memory
667924 2022-12-02T11:37:02 Z bashkort Amusement Park (JOI17_amusement_park) C++17
78 / 100
 24 ms 5464 KB 
#include "Joi.h"
#include <bits/stdc++.h>

using namespace std;

void Joi(int N, int M, int A[], int B[], long long X, int T) {
    struct DSU {
        vector<int> p;
        DSU() = default;
        DSU(int n) : p(n) {
            iota(p.begin(), p.end(), 0);
        }

        int leader(int x) {
            while (x != p[x]) x = p[x] = p[p[x]];
            return x;
        }

        bool unite(int x, int y) {
            x = leader(x), y = leader(y);
            if (p[y] == x) {
                return false;
            } else {
                return p[y] = x, true;
            }
        }
    };

    vector<int> tin(N), par(N, -1);
    vector<vector<int>> g(N), adj(N);
    DSU d(N);
    for (int i = 0; i < M; ++i) {
        if (d.unite(A[i], B[i])) {
            g[A[i]].push_back(B[i]);
            g[B[i]].push_back(A[i]);
        }
    }

    int timer = 0;
    function<void(int)> dfs = [&](int v) {
        tin[v] = timer++;
        sort(g[v].begin(), g[v].end());
        for (int to : g[v]) {
            if (to != par[v]) {
                par[to] = v;
                adj[v].push_back(to);
                dfs(to);
            }
        }
    };
    dfs(228 % N);

    for (int i = 0; i < N; ++i) {
        MessageBoard(i, X >> (tin[i] % 60) & 1);
    }
}

#include "Ioi.h"
#include <bits/stdc++.h>

using namespace std;
using ll = long long;


long long Ioi(int N, int M, int A[], int B[], int P, int V, int T) {
    struct DSU {
        vector<int> p;
        DSU() = default;
        DSU(int n) : p(n) {
            iota(p.begin(), p.end(), 0);
        }

        int leader(int x) {
            while (x != p[x]) x = p[x] = p[p[x]];
            return x;
        }

        bool unite(int x, int y) {
            x = leader(x), y = leader(y);
            if (p[y] == x) {
                return false;
            } else {
                return p[y] = x, true;
            }
        }
    };

    vector<int> tin(N), par(N, -1);
    vector<vector<int>> g(N), adj(N);
    DSU d(N);
    for (int i = 0; i < M; ++i) {
        if (d.unite(A[i], B[i])) {
            g[A[i]].push_back(B[i]);
            g[B[i]].push_back(A[i]);
        }
    }

    int timer = 0;
    function<void(int)> dfs = [&](int v) {
        tin[v] = timer++;
        sort(g[v].begin(), g[v].end());
        for (int to : g[v]) {
            if (to != par[v]) {
                par[to] = v;
                adj[v].push_back(to);
                dfs(to);
            }
        }
    };
    dfs(228 % N);
    int LOG = 60;
    vector<bool> used(N);
    vector<int> ans(LOG, -1);
    ans[tin[P] % LOG] = V;
    vector<int> last(N, -1);
    int x = P;
    while (find(ans.begin(), ans.end(), -1) != ans.end()) {
        used[x] = true;
        auto it = upper_bound(adj[x].begin(), adj[x].end(), last[x]);
        if (it == adj[x].end()) {
            it = adj[x].begin();
        }
        if (adj[x].empty() || used[*it]) {
            last[par[x]] = x;
            x = par[x];
            assert(x != -1);
            ans[tin[x] % LOG] = Move(x);
        } else {
            last[x] = *it;
            x = *it;
            ans[tin[x] % LOG] = Move(x);
        }
    }

    ll X = 0;
    for (int i = 0; i < LOG; ++i) {
        assert(ans[i] != -1);
        X += ans[i] * (1LL << i);
    }

    return X;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 516 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 2 ms 772 KB Output is correct
4 Correct 2 ms 516 KB Output is correct
5 Correct 1 ms 508 KB Output is correct
6 Correct 0 ms 776 KB Output is correct
7 Correct 1 ms 780 KB Output is correct
8 Correct 2 ms 780 KB Output is correct
9 Correct 2 ms 780 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 3 ms 816 KB Output is correct
12 Correct 1 ms 512 KB Output is correct
13 Correct 2 ms 784 KB Output is correct
14 Correct 1 ms 780 KB Output is correct
15 Correct 2 ms 772 KB Output is correct
16 Correct 2 ms 780 KB Output is correct
17 Correct 1 ms 780 KB Output is correct
18 Correct 2 ms 780 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 3920 KB Output is correct
2 Correct 20 ms 3932 KB Output is correct
3 Correct 24 ms 3948 KB Output is correct
4 Correct 15 ms 3472 KB Output is correct
5 Correct 14 ms 5208 KB Output is correct
6 Correct 16 ms 3920 KB Output is correct
7 Correct 14 ms 4060 KB Output is correct
8 Correct 16 ms 4100 KB Output is correct
9 Correct 16 ms 3904 KB Output is correct
10 Correct 13 ms 3280 KB Output is correct
11 Correct 13 ms 3260 KB Output is correct
12 Correct 13 ms 3252 KB Output is correct
13 Correct 14 ms 3108 KB Output is correct
14 Correct 14 ms 3180 KB Output is correct
15 Correct 15 ms 3516 KB Output is correct
16 Correct 14 ms 3540 KB Output is correct
17 Correct 14 ms 3320 KB Output is correct
18 Correct 15 ms 3384 KB Output is correct
19 Correct 15 ms 3412 KB Output is correct
20 Correct 11 ms 4304 KB Output is correct
21 Correct 12 ms 4172 KB Output is correct
22 Correct 15 ms 4144 KB Output is correct
23 Correct 16 ms 4056 KB Output is correct
24 Correct 14 ms 4028 KB Output is correct
25 Correct 13 ms 4056 KB Output is correct
26 Correct 16 ms 3940 KB Output is correct
27 Correct 16 ms 4304 KB Output is correct
28 Correct 15 ms 4212 KB Output is correct
29 Correct 13 ms 3656 KB Output is correct
30 Correct 14 ms 3656 KB Output is correct
31 Correct 1 ms 512 KB Output is correct
32 Correct 1 ms 648 KB Output is correct
33 Correct 2 ms 772 KB Output is correct
34 Correct 1 ms 524 KB Output is correct
35 Correct 0 ms 512 KB Output is correct
36 Correct 0 ms 512 KB Output is correct
37 Correct 0 ms 512 KB Output is correct
38 Correct 0 ms 516 KB Output is correct
39 Correct 1 ms 512 KB Output is correct
40 Correct 0 ms 520 KB Output is correct
41 Correct 1 ms 512 KB Output is correct
42 Correct 1 ms 512 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 520 KB Output is correct
3 Correct 0 ms 524 KB Output is correct
4 Correct 4 ms 1308 KB Output is correct
5 Correct 2 ms 1308 KB Output is correct
6 Correct 2 ms 1308 KB Output is correct
7 Correct 2 ms 1380 KB Output is correct
8 Correct 2 ms 1316 KB Output is correct
9 Correct 12 ms 5464 KB Output is correct
10 Correct 12 ms 5464 KB Output is correct
11 Correct 15 ms 5404 KB Output is correct
12 Correct 0 ms 520 KB Output is correct
13 Correct 1 ms 528 KB Output is correct
14 Correct 1 ms 528 KB Output is correct
15 Correct 0 ms 512 KB Output is correct

Subtask #4
50.0 / 55.0

# Verdict Execution time Memory Grader output
1 Partially correct 20 ms 3940 KB Partially correct
2 Correct 22 ms 4040 KB Output is correct
3 Partially correct 20 ms 3912 KB Partially correct
4 Correct 14 ms 3408 KB Output is correct
5 Correct 20 ms 4564 KB Output is correct
6 Correct 15 ms 4044 KB Output is correct
7 Correct 15 ms 4188 KB Output is correct
8 Correct 14 ms 3940 KB Output is correct
9 Correct 15 ms 4184 KB Output is correct
10 Correct 12 ms 3296 KB Output is correct
11 Correct 13 ms 3284 KB Output is correct
12 Correct 16 ms 3212 KB Output is correct
13 Correct 12 ms 3140 KB Output is correct
14 Correct 15 ms 3188 KB Output is correct
15 Correct 14 ms 3544 KB Output is correct
16 Correct 15 ms 3520 KB Output is correct
17 Correct 14 ms 3408 KB Output is correct
18 Correct 14 ms 3492 KB Output is correct
19 Partially correct 17 ms 3424 KB Partially correct
20 Correct 11 ms 4284 KB Output is correct
21 Correct 12 ms 4308 KB Output is correct
22 Correct 14 ms 4056 KB Output is correct
23 Correct 15 ms 3932 KB Output is correct
24 Correct 16 ms 4112 KB Output is correct
25 Correct 15 ms 4028 KB Output is correct
26 Correct 15 ms 3820 KB Output is correct
27 Correct 14 ms 4048 KB Output is correct
28 Correct 15 ms 4052 KB Output is correct
29 Correct 13 ms 3780 KB Output is correct
30 Correct 14 ms 3932 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 3948 KB Output is correct
2 Correct 20 ms 3800 KB Output is correct
3 Incorrect 23 ms 3792 KB Output isn't correct
4 Halted 0 ms 0 KB -