oj.uz

답안 #536046

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
536046 2022-03-12T08:04:16 Z KoD Simurgh (IOI17_simurgh) C++17
70 / 100
 638 ms 5120 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);
    const auto ask_tree = [&] {
        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];
        }
    }
    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;
        }
        assert(ask_list.size() == N - 1);
        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;
}

Compilation message

In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from simurgh.cpp:1:
simurgh.cpp: In lambda function:
simurgh.cpp:107:32: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  107 |         assert(ask_list.size() == N - 1);
      |                ~~~~~~~~~~~~~~~~^~~~~~~~

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB correct
2 Correct 1 ms 300 KB correct
3 Correct 1 ms 304 KB correct
4 Correct 0 ms 212 KB correct
5 Correct 1 ms 280 KB correct
6 Correct 0 ms 304 KB correct
7 Correct 1 ms 212 KB correct
8 Correct 1 ms 212 KB correct
9 Correct 1 ms 212 KB correct
10 Correct 1 ms 304 KB correct
11 Correct 1 ms 212 KB correct
12 Correct 1 ms 212 KB correct
13 Correct 1 ms 212 KB correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB correct
2 Correct 1 ms 300 KB correct
3 Correct 1 ms 304 KB correct
4 Correct 0 ms 212 KB correct
5 Correct 1 ms 280 KB correct
6 Correct 0 ms 304 KB correct
7 Correct 1 ms 212 KB correct
8 Correct 1 ms 212 KB correct
9 Correct 1 ms 212 KB correct
10 Correct 1 ms 304 KB correct
11 Correct 1 ms 212 KB correct
12 Correct 1 ms 212 KB correct
13 Correct 1 ms 212 KB correct
14 Correct 2 ms 304 KB correct
15 Correct 2 ms 340 KB correct
16 Correct 2 ms 300 KB correct
17 Correct 2 ms 308 KB correct
18 Correct 2 ms 212 KB correct
19 Correct 3 ms 384 KB correct
20 Correct 2 ms 340 KB correct
21 Correct 2 ms 340 KB correct
22 Correct 1 ms 340 KB correct
23 Correct 1 ms 304 KB correct
24 Correct 2 ms 304 KB correct
25 Correct 1 ms 212 KB correct
26 Correct 1 ms 312 KB correct
27 Correct 1 ms 212 KB correct
28 Correct 1 ms 212 KB correct
29 Correct 1 ms 256 KB correct
30 Correct 1 ms 304 KB correct
31 Correct 1 ms 212 KB correct
32 Correct 1 ms 212 KB correct
33 Correct 1 ms 304 KB correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB correct
2 Correct 1 ms 300 KB correct
3 Correct 1 ms 304 KB correct
4 Correct 0 ms 212 KB correct
5 Correct 1 ms 280 KB correct
6 Correct 0 ms 304 KB correct
7 Correct 1 ms 212 KB correct
8 Correct 1 ms 212 KB correct
9 Correct 1 ms 212 KB correct
10 Correct 1 ms 304 KB correct
11 Correct 1 ms 212 KB correct
12 Correct 1 ms 212 KB correct
13 Correct 1 ms 212 KB correct
14 Correct 2 ms 304 KB correct
15 Correct 2 ms 340 KB correct
16 Correct 2 ms 300 KB correct
17 Correct 2 ms 308 KB correct
18 Correct 2 ms 212 KB correct
19 Correct 3 ms 384 KB correct
20 Correct 2 ms 340 KB correct
21 Correct 2 ms 340 KB correct
22 Correct 1 ms 340 KB correct
23 Correct 1 ms 304 KB correct
24 Correct 2 ms 304 KB correct
25 Correct 1 ms 212 KB correct
26 Correct 1 ms 312 KB correct
27 Correct 1 ms 212 KB correct
28 Correct 1 ms 212 KB correct
29 Correct 1 ms 256 KB correct
30 Correct 1 ms 304 KB correct
31 Correct 1 ms 212 KB correct
32 Correct 1 ms 212 KB correct
33 Correct 1 ms 304 KB correct
34 Correct 84 ms 1380 KB correct
35 Correct 84 ms 1364 KB correct
36 Correct 63 ms 1120 KB correct
37 Correct 9 ms 376 KB correct
38 Correct 85 ms 1364 KB correct
39 Correct 73 ms 1268 KB correct
40 Correct 58 ms 1092 KB correct
41 Correct 85 ms 1364 KB correct
42 Correct 75 ms 1396 KB correct
43 Correct 34 ms 980 KB correct
44 Correct 26 ms 724 KB correct
45 Correct 30 ms 824 KB correct
46 Correct 23 ms 724 KB correct
47 Correct 11 ms 536 KB correct
48 Correct 2 ms 212 KB correct
49 Correct 5 ms 340 KB correct
50 Correct 13 ms 448 KB correct
51 Correct 32 ms 844 KB correct
52 Correct 26 ms 724 KB correct
53 Correct 24 ms 724 KB correct
54 Correct 36 ms 976 KB correct
55 Correct 38 ms 868 KB correct
56 Correct 38 ms 852 KB correct
57 Correct 37 ms 852 KB correct

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB correct
2 Correct 0 ms 212 KB correct
3 Correct 334 ms 3568 KB correct
4 Correct 616 ms 4988 KB correct
5 Correct 636 ms 5120 KB correct
6 Correct 542 ms 4988 KB correct
7 Correct 591 ms 4940 KB correct
8 Correct 605 ms 5072 KB correct
9 Correct 621 ms 4988 KB correct
10 Correct 638 ms 4996 KB correct
11 Correct 630 ms 4992 KB correct
12 Correct 635 ms 4992 KB correct
13 Correct 0 ms 212 KB correct
14 Correct 595 ms 4984 KB correct
15 Correct 626 ms 4980 KB correct

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB correct
2 Correct 1 ms 300 KB correct
3 Correct 1 ms 304 KB correct
4 Correct 0 ms 212 KB correct
5 Correct 1 ms 280 KB correct
6 Correct 0 ms 304 KB correct
7 Correct 1 ms 212 KB correct
8 Correct 1 ms 212 KB correct
9 Correct 1 ms 212 KB correct
10 Correct 1 ms 304 KB correct
11 Correct 1 ms 212 KB correct
12 Correct 1 ms 212 KB correct
13 Correct 1 ms 212 KB correct
14 Correct 2 ms 304 KB correct
15 Correct 2 ms 340 KB correct
16 Correct 2 ms 300 KB correct
17 Correct 2 ms 308 KB correct
18 Correct 2 ms 212 KB correct
19 Correct 3 ms 384 KB correct
20 Correct 2 ms 340 KB correct
21 Correct 2 ms 340 KB correct
22 Correct 1 ms 340 KB correct
23 Correct 1 ms 304 KB correct
24 Correct 2 ms 304 KB correct
25 Correct 1 ms 212 KB correct
26 Correct 1 ms 312 KB correct
27 Correct 1 ms 212 KB correct
28 Correct 1 ms 212 KB correct
29 Correct 1 ms 256 KB correct
30 Correct 1 ms 304 KB correct
31 Correct 1 ms 212 KB correct
32 Correct 1 ms 212 KB correct
33 Correct 1 ms 304 KB correct
34 Correct 84 ms 1380 KB correct
35 Correct 84 ms 1364 KB correct
36 Correct 63 ms 1120 KB correct
37 Correct 9 ms 376 KB correct
38 Correct 85 ms 1364 KB correct
39 Correct 73 ms 1268 KB correct
40 Correct 58 ms 1092 KB correct
41 Correct 85 ms 1364 KB correct
42 Correct 75 ms 1396 KB correct
43 Correct 34 ms 980 KB correct
44 Correct 26 ms 724 KB correct
45 Correct 30 ms 824 KB correct
46 Correct 23 ms 724 KB correct
47 Correct 11 ms 536 KB correct
48 Correct 2 ms 212 KB correct
49 Correct 5 ms 340 KB correct
50 Correct 13 ms 448 KB correct
51 Correct 32 ms 844 KB correct
52 Correct 26 ms 724 KB correct
53 Correct 24 ms 724 KB correct
54 Correct 36 ms 976 KB correct
55 Correct 38 ms 868 KB correct
56 Correct 38 ms 852 KB correct
57 Correct 37 ms 852 KB correct
58 Correct 0 ms 212 KB correct
59 Correct 0 ms 212 KB correct
60 Correct 334 ms 3568 KB correct
61 Correct 616 ms 4988 KB correct
62 Correct 636 ms 5120 KB correct
63 Correct 542 ms 4988 KB correct
64 Correct 591 ms 4940 KB correct
65 Correct 605 ms 5072 KB correct
66 Correct 621 ms 4988 KB correct
67 Correct 638 ms 4996 KB correct
68 Correct 630 ms 4992 KB correct
69 Correct 635 ms 4992 KB correct
70 Correct 0 ms 212 KB correct
71 Correct 595 ms 4984 KB correct
72 Correct 626 ms 4980 KB correct
73 Correct 0 ms 212 KB correct
74 Incorrect 614 ms 4980 KB WA in grader: NO
75 Halted 0 ms 0 KB -