oj.uz

Submission #536048

# Submission time Handle Problem Language Result Execution time Memory
536048 2022-03-12T08:05:40 Z KoD Simurgh (IOI17_simurgh) C++17
70 / 100
 669 ms 4172 KB 
#include <bits/stdc++.h>
#include "simurgh.h"
using namespace std;

template <class F> struct rec_lambda : private F {
    explicit rec_lambda(F&& f) : F(forward<F>(f)) {}
    template <class... Args> decltype(auto) operator()(Args&&... args) const {
        return F::operator()(*this, forward<Args>(args)...);
    }
};

vector<int> find_roads(int N, vector<int> U, vector<int> V) {
    const int M = U.size();
    vector<vector<int>> graph(N);
    for (int i = 0; i < M; ++i) {
        graph[U[i]].push_back(i);
        graph[V[i]].push_back(i);
    }
    const auto dst = [&](const int u, const int e) {
        return U[e] ^ V[e] ^ u;
    };
    vector<int> depth(N), pedge(N);
    vector<char> is_tree(M);
    depth[0] = 1;
    rec_lambda([&](auto&& dfs, const int u) -> void {
        for (const int e : graph[u]) {
            const int v = dst(u, e);
            if (depth[v] == 0) {
                depth[v] = depth[u] + 1;
                pedge[v] = e;
                is_tree[e] = true;
                dfs(v);
            }
        }
    })(0);
    for (int i = 0; i < M; ++i) {
        if (depth[U[i]] > depth[V[i]]) swap(U[i], V[i]);
    }
    vector<int> ask_list;
    ask_list.reserve(N - 1);
    int asked = 0;
    const auto ask_tree = [&] {
        asked += 1;
        ask_list.clear();
        for (int i = 0; i < M; ++i) {
            if (is_tree[i]) ask_list.push_back(i);
        }
        return count_common_roads(ask_list);
    }; 
    const auto ask_swapped = [&](const int e, const int f) {
        is_tree[e] = true;
        is_tree[f] = false;
        const int ret = ask_tree();
        is_tree[e] = false;
        is_tree[f] = true;
        return ret;
    };
    const int base = ask_tree();
    vector<int> type(M, -1);
    for (int e = 0; e < M; ++e) {
        if (is_tree[e]) continue;
        vector<int> done, tbd;
        for (int u = V[e]; u != U[e]; u = dst(u, pedge[u])) {
            const int f = pedge[u];
            (type[f] >= 0 ? done : tbd).push_back(f); 
        }
        const int m = tbd.size();
        if (m == 0) continue;
        vector<int> dif(m);
        for (int i = 0; i < m; ++i) {
            dif[i] = ask_swapped(e, tbd[i]) - base;
        }
        if (done.empty()) {
            for (const int x : dif) {
                if (x == 1) type[e] = 1;
                if (x == -1) type[e] = 0;
            }
            if (type[e] == -1) type[e] = 0;
        } else {
            const int f = done.front();
            type[e] = type[f] + ask_swapped(e, f) - base;
        }
        for (int i = 0; i < m; ++i) {
            type[tbd[i]] = type[e] - dif[i];
        }
    }
    assert(asked <= 2 * N);
    for (int i = 0; i < M; ++i) {
        if (is_tree[i] and type[i] == -1) type[i] = 1;
    }
    vector<char> used(N);
    const auto count = [&](vector<int> list) {
        if (list.empty()) return 0;
        ask_list.clear();
        for (const int e : list) {
            ask_list.push_back(e);
            used[V[e]] = true;
        }
        int subt = 0;
        for (int u = 1; u < N; ++u) {
            if (!used[u]) {
                const int e = pedge[u];
                subt += type[e];
                ask_list.push_back(e); 
            }
        }
        for (const int e : list) {
            used[V[e]] = false;
        }
        return count_common_roads(ask_list) - subt;
    };
    for (int pivot = 0; pivot < N; ++pivot) {
        vector<int> list;
        for (const int e : graph[pivot]) {
            if (type[e] == -1 and U[e] == pivot) list.push_back(e);
        }
        rec_lambda([&](auto&& dfs, const int l, const int r) -> void {
            if (count(vector<int>(list.begin() + l, list.begin() + r)) == 0) return;
            if (l + 1 == r) {
                type[list[l]] = 1;
            } else {
                const int m = (l + r) / 2;
                dfs(l, m);
                dfs(m, r);
            }
        })(0, list.size());
        for (const int e : list) {
            if (type[e] == -1) type[e] = 0;
        }
    }
    vector<int> ret;
    ret.reserve(N - 1);
    for (int i = 0; i < M; ++i) {
        if (type[i] == 1) ret.push_back(i);
    }
    return ret;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB correct
2 Correct 0 ms 212 KB correct
3 Correct 0 ms 212 KB correct
4 Correct 1 ms 212 KB correct
5 Correct 0 ms 212 KB correct
6 Correct 0 ms 212 KB correct
7 Correct 0 ms 212 KB correct
8 Correct 1 ms 212 KB correct
9 Correct 1 ms 288 KB correct
10 Correct 1 ms 212 KB correct
11 Correct 0 ms 212 KB correct
12 Correct 0 ms 212 KB correct
13 Correct 1 ms 212 KB correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB correct
2 Correct 0 ms 212 KB correct
3 Correct 0 ms 212 KB correct
4 Correct 1 ms 212 KB correct
5 Correct 0 ms 212 KB correct
6 Correct 0 ms 212 KB correct
7 Correct 0 ms 212 KB correct
8 Correct 1 ms 212 KB correct
9 Correct 1 ms 288 KB correct
10 Correct 1 ms 212 KB correct
11 Correct 0 ms 212 KB correct
12 Correct 0 ms 212 KB correct
13 Correct 1 ms 212 KB correct
14 Correct 2 ms 340 KB correct
15 Correct 2 ms 344 KB correct
16 Correct 2 ms 340 KB correct
17 Correct 2 ms 212 KB correct
18 Correct 1 ms 212 KB correct
19 Correct 2 ms 212 KB correct
20 Correct 2 ms 212 KB correct
21 Correct 2 ms 212 KB correct
22 Correct 2 ms 212 KB correct
23 Correct 1 ms 212 KB correct
24 Correct 1 ms 212 KB correct
25 Correct 1 ms 212 KB correct
26 Correct 1 ms 212 KB correct
27 Correct 1 ms 212 KB correct
28 Correct 1 ms 212 KB correct
29 Correct 1 ms 212 KB correct
30 Correct 1 ms 212 KB correct
31 Correct 1 ms 212 KB correct
32 Correct 1 ms 212 KB correct
33 Correct 1 ms 212 KB correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB correct
2 Correct 0 ms 212 KB correct
3 Correct 0 ms 212 KB correct
4 Correct 1 ms 212 KB correct
5 Correct 0 ms 212 KB correct
6 Correct 0 ms 212 KB correct
7 Correct 0 ms 212 KB correct
8 Correct 1 ms 212 KB correct
9 Correct 1 ms 288 KB correct
10 Correct 1 ms 212 KB correct
11 Correct 0 ms 212 KB correct
12 Correct 0 ms 212 KB correct
13 Correct 1 ms 212 KB correct
14 Correct 2 ms 340 KB correct
15 Correct 2 ms 344 KB correct
16 Correct 2 ms 340 KB correct
17 Correct 2 ms 212 KB correct
18 Correct 1 ms 212 KB correct
19 Correct 2 ms 212 KB correct
20 Correct 2 ms 212 KB correct
21 Correct 2 ms 212 KB correct
22 Correct 2 ms 212 KB correct
23 Correct 1 ms 212 KB correct
24 Correct 1 ms 212 KB correct
25 Correct 1 ms 212 KB correct
26 Correct 1 ms 212 KB correct
27 Correct 1 ms 212 KB correct
28 Correct 1 ms 212 KB correct
29 Correct 1 ms 212 KB correct
30 Correct 1 ms 212 KB correct
31 Correct 1 ms 212 KB correct
32 Correct 1 ms 212 KB correct
33 Correct 1 ms 212 KB correct
34 Correct 86 ms 1180 KB correct
35 Correct 83 ms 1176 KB correct
36 Correct 64 ms 984 KB correct
37 Correct 10 ms 360 KB correct
38 Correct 92 ms 1184 KB correct
39 Correct 71 ms 1092 KB correct
40 Correct 57 ms 984 KB correct
41 Correct 87 ms 1376 KB correct
42 Correct 85 ms 1192 KB correct
43 Correct 38 ms 972 KB correct
44 Correct 28 ms 596 KB correct
45 Correct 30 ms 752 KB correct
46 Correct 23 ms 660 KB correct
47 Correct 11 ms 496 KB correct
48 Correct 3 ms 212 KB correct
49 Correct 5 ms 340 KB correct
50 Correct 12 ms 504 KB correct
51 Correct 34 ms 752 KB correct
52 Correct 29 ms 692 KB correct
53 Correct 26 ms 640 KB correct
54 Correct 35 ms 852 KB correct
55 Correct 37 ms 756 KB correct
56 Correct 37 ms 724 KB correct
57 Correct 37 ms 724 KB correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB correct
2 Correct 1 ms 212 KB correct
3 Correct 359 ms 2900 KB correct
4 Correct 663 ms 4056 KB correct
5 Correct 669 ms 4096 KB correct
6 Correct 573 ms 4068 KB correct
7 Correct 613 ms 4068 KB correct
8 Correct 623 ms 4092 KB correct
9 Correct 646 ms 4052 KB correct
10 Correct 624 ms 4172 KB correct
11 Correct 655 ms 4060 KB correct
12 Correct 663 ms 4056 KB correct
13 Correct 0 ms 212 KB correct
14 Correct 629 ms 4052 KB correct
15 Correct 622 ms 4100 KB correct

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB correct
2 Correct 0 ms 212 KB correct
3 Correct 0 ms 212 KB correct
4 Correct 1 ms 212 KB correct
5 Correct 0 ms 212 KB correct
6 Correct 0 ms 212 KB correct
7 Correct 0 ms 212 KB correct
8 Correct 1 ms 212 KB correct
9 Correct 1 ms 288 KB correct
10 Correct 1 ms 212 KB correct
11 Correct 0 ms 212 KB correct
12 Correct 0 ms 212 KB correct
13 Correct 1 ms 212 KB correct
14 Correct 2 ms 340 KB correct
15 Correct 2 ms 344 KB correct
16 Correct 2 ms 340 KB correct
17 Correct 2 ms 212 KB correct
18 Correct 1 ms 212 KB correct
19 Correct 2 ms 212 KB correct
20 Correct 2 ms 212 KB correct
21 Correct 2 ms 212 KB correct
22 Correct 2 ms 212 KB correct
23 Correct 1 ms 212 KB correct
24 Correct 1 ms 212 KB correct
25 Correct 1 ms 212 KB correct
26 Correct 1 ms 212 KB correct
27 Correct 1 ms 212 KB correct
28 Correct 1 ms 212 KB correct
29 Correct 1 ms 212 KB correct
30 Correct 1 ms 212 KB correct
31 Correct 1 ms 212 KB correct
32 Correct 1 ms 212 KB correct
33 Correct 1 ms 212 KB correct
34 Correct 86 ms 1180 KB correct
35 Correct 83 ms 1176 KB correct
36 Correct 64 ms 984 KB correct
37 Correct 10 ms 360 KB correct
38 Correct 92 ms 1184 KB correct
39 Correct 71 ms 1092 KB correct
40 Correct 57 ms 984 KB correct
41 Correct 87 ms 1376 KB correct
42 Correct 85 ms 1192 KB correct
43 Correct 38 ms 972 KB correct
44 Correct 28 ms 596 KB correct
45 Correct 30 ms 752 KB correct
46 Correct 23 ms 660 KB correct
47 Correct 11 ms 496 KB correct
48 Correct 3 ms 212 KB correct
49 Correct 5 ms 340 KB correct
50 Correct 12 ms 504 KB correct
51 Correct 34 ms 752 KB correct
52 Correct 29 ms 692 KB correct
53 Correct 26 ms 640 KB correct
54 Correct 35 ms 852 KB correct
55 Correct 37 ms 756 KB correct
56 Correct 37 ms 724 KB correct
57 Correct 37 ms 724 KB correct
58 Correct 0 ms 212 KB correct
59 Correct 1 ms 212 KB correct
60 Correct 359 ms 2900 KB correct
61 Correct 663 ms 4056 KB correct
62 Correct 669 ms 4096 KB correct
63 Correct 573 ms 4068 KB correct
64 Correct 613 ms 4068 KB correct
65 Correct 623 ms 4092 KB correct
66 Correct 646 ms 4052 KB correct
67 Correct 624 ms 4172 KB correct
68 Correct 655 ms 4060 KB correct
69 Correct 663 ms 4056 KB correct
70 Correct 0 ms 212 KB correct
71 Correct 629 ms 4052 KB correct
72 Correct 622 ms 4100 KB correct
73 Correct 0 ms 212 KB correct
74 Incorrect 641 ms 3980 KB WA in grader: NO
75 Halted 0 ms 0 KB -