oj.uz

답안 #667932

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
667932 2022-12-02T11:46:04 Z bashkort Amusement Park (JOI17_amusement_park) C++17
77 / 100
 26 ms 5608 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;
            }
        }
    };

    mt19937 rnd(228);
    vector<pair<int, int>> edges(M);
    for (int i = 0; i < M; ++i) {
        edges[i] = {A[i], B[i]};
    }
    shuffle(edges.begin(), edges.end(), rnd);
    vector<int> tin(N), par(N, -1);
    vector<vector<int>> g(N), adj(N);
    DSU d(N);
    for (int i = 0; i < M; ++i) {
        auto [a, b] = edges[i];
        if (d.unite(a, b)) {
            g[a].push_back(b);
            g[b].push_back(a);
        }
    }

    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;
            }
        }
    };

    mt19937 rnd(228);
    vector<pair<int, int>> edges(M);
    for (int i = 0; i < M; ++i) {
        edges[i] = {A[i], B[i]};
    }
    shuffle(edges.begin(), edges.end(), rnd);
    vector<int> tin(N), par(N, -1);
    vector<vector<int>> g(N), adj(N);
    DSU d(N);
    for (int i = 0; i < M; ++i) {
        auto [a, b] = edges[i];
        if (d.unite(a, b)) {
            g[a].push_back(b);
            g[b].push_back(a);
        }
    }

    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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 520 KB Output is correct
3 Correct 2 ms 780 KB Output is correct
4 Correct 1 ms 640 KB Output is correct
5 Correct 0 ms 512 KB Output is correct
6 Correct 1 ms 644 KB Output is correct
7 Correct 1 ms 828 KB Output is correct
8 Correct 2 ms 772 KB Output is correct
9 Correct 1 ms 780 KB Output is correct
10 Correct 0 ms 516 KB Output is correct
11 Correct 4 ms 944 KB Output is correct
12 Correct 0 ms 512 KB Output is correct
13 Correct 2 ms 776 KB Output is correct
14 Correct 2 ms 780 KB Output is correct
15 Correct 1 ms 772 KB Output is correct
16 Correct 1 ms 780 KB Output is correct
17 Correct 1 ms 780 KB Output is correct
18 Correct 1 ms 772 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 4164 KB Output is correct
2 Correct 23 ms 4196 KB Output is correct
3 Correct 23 ms 4116 KB Output is correct
4 Correct 15 ms 3540 KB Output is correct
5 Correct 16 ms 5352 KB Output is correct
6 Correct 16 ms 4180 KB Output is correct
7 Correct 18 ms 4072 KB Output is correct
8 Correct 15 ms 4316 KB Output is correct
9 Correct 18 ms 4144 KB Output is correct
10 Correct 13 ms 3544 KB Output is correct
11 Correct 14 ms 3540 KB Output is correct
12 Correct 13 ms 3256 KB Output is correct
13 Correct 13 ms 3272 KB Output is correct
14 Correct 15 ms 3424 KB Output is correct
15 Correct 15 ms 3784 KB Output is correct
16 Correct 15 ms 3804 KB Output is correct
17 Correct 15 ms 3652 KB Output is correct
18 Correct 15 ms 3524 KB Output is correct
19 Correct 15 ms 3648 KB Output is correct
20 Correct 13 ms 4404 KB Output is correct
21 Correct 13 ms 4432 KB Output is correct
22 Correct 15 ms 4308 KB Output is correct
23 Correct 15 ms 4164 KB Output is correct
24 Correct 16 ms 4076 KB Output is correct
25 Correct 15 ms 4316 KB Output is correct
26 Correct 15 ms 4104 KB Output is correct
27 Correct 16 ms 4440 KB Output is correct
28 Correct 15 ms 4308 KB Output is correct
29 Correct 14 ms 3784 KB Output is correct
30 Correct 15 ms 3792 KB Output is correct
31 Correct 0 ms 512 KB Output is correct
32 Correct 0 ms 776 KB Output is correct
33 Correct 2 ms 780 KB Output is correct
34 Correct 2 ms 512 KB Output is correct
35 Correct 0 ms 520 KB Output is correct
36 Correct 0 ms 648 KB Output is correct
37 Correct 0 ms 512 KB Output is correct
38 Correct 0 ms 512 KB Output is correct
39 Correct 2 ms 512 KB Output is correct
40 Correct 1 ms 520 KB Output is correct
41 Correct 0 ms 512 KB Output is correct
42 Correct 0 ms 512 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 516 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 520 KB Output is correct
4 Correct 3 ms 1372 KB Output is correct
5 Correct 3 ms 1316 KB Output is correct
6 Correct 2 ms 1316 KB Output is correct
7 Correct 2 ms 1288 KB Output is correct
8 Correct 2 ms 1316 KB Output is correct
9 Correct 14 ms 5608 KB Output is correct
10 Correct 13 ms 5588 KB Output is correct
11 Correct 13 ms 5604 KB Output is correct
12 Correct 1 ms 520 KB Output is correct
13 Correct 1 ms 648 KB Output is correct
14 Correct 1 ms 576 KB Output is correct
15 Correct 1 ms 512 KB Output is correct

Subtask #4
49.0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 4192 KB Output is correct
2 Partially correct 23 ms 4236 KB Partially correct
3 Correct 23 ms 4184 KB Output is correct
4 Correct 15 ms 3516 KB Output is correct
5 Correct 16 ms 4692 KB Output is correct
6 Correct 15 ms 4308 KB Output is correct
7 Correct 15 ms 4308 KB Output is correct
8 Correct 17 ms 3980 KB Output is correct
9 Correct 15 ms 4272 KB Output is correct
10 Correct 15 ms 3536 KB Output is correct
11 Correct 13 ms 3544 KB Output is correct
12 Correct 13 ms 3276 KB Output is correct
13 Correct 13 ms 3268 KB Output is correct
14 Correct 14 ms 3412 KB Output is correct
15 Correct 16 ms 3784 KB Output is correct
16 Correct 16 ms 3764 KB Output is correct
17 Correct 15 ms 3620 KB Output is correct
18 Correct 15 ms 3536 KB Output is correct
19 Partially correct 15 ms 3548 KB Partially correct
20 Correct 13 ms 4376 KB Output is correct
21 Correct 13 ms 4316 KB Output is correct
22 Correct 16 ms 4180 KB Output is correct
23 Correct 15 ms 4056 KB Output is correct
24 Correct 15 ms 4312 KB Output is correct
25 Correct 15 ms 4100 KB Output is correct
26 Correct 15 ms 4068 KB Output is correct
27 Correct 15 ms 4316 KB Output is correct
28 Correct 15 ms 4164 KB Output is correct
29 Correct 14 ms 3844 KB Output is correct
30 Correct 15 ms 3944 KB Output is correct

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 4160 KB Output is correct
2 Correct 23 ms 4164 KB Output is correct
3 Correct 24 ms 4312 KB Output is correct
4 Incorrect 15 ms 3748 KB Output isn't correct
5 Halted 0 ms 0 KB -