oj.uz

Submission #330143

# Submission time Handle Problem Language Result Execution time Memory
330143 2020-11-24T03:41:34 Z Falcon Railway (BOI17_railway) C++17
100 / 100
 121 ms 33228 KB 
#pragma GCC optimize("O2")

#include <bits/stdc++.h>

#ifdef DEBUG
#include "debug.hpp"
#endif

using namespace std;

#define all(c)              (c).begin(), (c).end()
#define rall(c)             (c).rbegin(), (c).rend()
#define traverse(c, it)     for(auto it = (c).begin(); it != (c).end(); ++it)
#define rep(i, N)           for(int i = 0; i < (N); ++i)
#define rrep(i, N)          for(int i = (N) - 1; i >= 0; --i)
#define rep1(i, N)          for(int i = 1; i <= (N); ++i)
#define rep2(i, s, e)       for(int i = (s); i <= (e); ++i)
#define rep3(i, s, e, d)    for(int i = (s); (d) >= 0 ? i <= (e) : i >= (e); i += (d))

#ifdef DEBUG
#define debug(x...)         { \
                            ++dbg::depth; \
                            string dbg_vals = dbg::to_string(x); \
                            --dbg::depth; \
                            dbg::fprint(__func__, __LINE__, #x, dbg_vals); \
                            }

#define light_debug(x)      { \
                            dbg::light = true; \
                            dbg::dout << __func__ << ":" << __LINE__; \
                            dbg::dout << "  " << #x << " = " << x << endl; \
                            dbg::light = false; \
                            }
#else
#define debug(x...)         42
#define light_debug(x)      42
#endif


using ll = long long;

template<typename T>
inline T& ckmin(T& a, T b) { return a = a > b ? b : a; }

template<typename T>
inline T& ckmax(T& a, T b) { return a = a < b ? b : a; }

template<class Fun>
class y_combinator_result {
    Fun fun_;
public:
    template<class T>
    explicit y_combinator_result(T &&fun): fun_(std::forward<T>(fun)) {}

    template<class ...Args>
    decltype(auto) operator()(Args &&...args) {
        return fun_(std::ref(*this), std::forward<Args>(args)...);
    }
};

template<class Fun>
decltype(auto) y_combinator(Fun &&fun) {
    return y_combinator_result<std::decay_t<Fun>>(std::forward<Fun>(fun));
}


int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    
    #ifdef DEBUG
    freopen("debug", "w", stderr);
    #endif

    int n, m, k; cin >> n >> m >> k;
    vector<vector<int>> adj(n); vector<int> edges(n - 1);
    rep(i, n - 1) {
        int u, v; cin >> u >> v; --u, --v;
        edges[i] = u ^ v;
        adj[u].push_back(i), adj[v].push_back(i);
    }

    vector<int> in(n), inv;
    vector<vector<int>> rmq;
    int t{}, h{};
    {
        vector<int> tour; tour.reserve(2 * n);
        y_combinator([&](auto dfs, int u, int p) -> void {
            in[u] = t++;
            tour.push_back(in[u]);
            for(int e : adj[u]) {
                if(int v = edges[e] ^ u; v != p)
                    dfs(v, u), tour.push_back(in[u]), ++t;
            }
        })(0, -1);
        debug(tour, t);

        inv.resize(t); fill(all(inv), -1); rep(i, n) inv[in[i]] = i;
        debug(in, inv);

        h = __lg(t) + 1;
        rmq = vector<vector<int>>(h, vector<int>(t));
        rep(i, t) rmq[0][i] = tour[i];
        rep(j, h - 1)
            rep(i, t) {
                rmq[j + 1][i] = rmq[j][i];
                if(i + (1 << j) < t)
                    ckmin(rmq[j + 1][i], rmq[j][i + (1 << j)]);
            }
        debug(rmq);
    }

    auto lca = [&](int u, int v) {
        u = in[u], v = in[v];
        if(u > v) swap(u, v);
        int p = __lg(v - u + 1);
        return inv[min(rmq[p][u], rmq[p][v + 1 - (1 << p)])];
    };

    vector<int> up(n);
    rep(_, m) {
        int s; cin >> s;
        vector<int> v(s); rep(i, s) cin >> v[i], --v[i];
        sort(all(v), [&](int i, int j) { return in[i] < in[j]; });
        v.push_back(v[0]);
        rep(i, s) ++up[v[i]];
        rep(i, s) --up[lca(v[i], v[i + 1])];
    }
    debug(up);

    vector<int> k_edges;
    y_combinator([&](auto dfs, int u, int p) -> int {
        int s{up[u]};
        for(int e : adj[u])
            if(e != p) s += dfs(edges[e] ^ u, e);
        if(s >= k) k_edges.push_back(p);
        return s;
    })(0, -1);

    cout << k_edges.size() << '\n';
    sort(all(k_edges));
    for(int& e : k_edges) cout << e + 1 << ' ';
    cout << '\n';
    

    #ifdef DEBUG
    dbg::dout << "\nExecution time: " << clock() * 1000 / CLOCKS_PER_SEC  << "ms" << endl;
    #endif

    return 0;
}

Compilation message

railway.cpp: In function 'int main()':
railway.cpp:35:29: warning: statement has no effect [-Wunused-value]
   35 | #define debug(x...)         42
      |                             ^~
railway.cpp:96:9: note: in expansion of macro 'debug'
   96 |         debug(tour, t);
      |         ^~~~~
railway.cpp:35:29: warning: statement has no effect [-Wunused-value]
   35 | #define debug(x...)         42
      |                             ^~
railway.cpp:99:9: note: in expansion of macro 'debug'
   99 |         debug(in, inv);
      |         ^~~~~
railway.cpp:35:29: warning: statement has no effect [-Wunused-value]
   35 | #define debug(x...)         42
      |                             ^~
railway.cpp:110:9: note: in expansion of macro 'debug'
  110 |         debug(rmq);
      |         ^~~~~
railway.cpp:35:29: warning: statement has no effect [-Wunused-value]
   35 | #define debug(x...)         42
      |                             ^~
railway.cpp:129:5: note: in expansion of macro 'debug'
  129 |     debug(up);
      |     ^~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 6 ms 2412 KB Output is correct
3 Correct 6 ms 2412 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 6 ms 2924 KB Output is correct
7 Correct 6 ms 2540 KB Output is correct
8 Correct 5 ms 2540 KB Output is correct
9 Correct 5 ms 2540 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 6 ms 2412 KB Output is correct
3 Correct 6 ms 2412 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 6 ms 2924 KB Output is correct
7 Correct 6 ms 2540 KB Output is correct
8 Correct 5 ms 2540 KB Output is correct
9 Correct 5 ms 2540 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 19 ms 2816 KB Output is correct
16 Correct 19 ms 2936 KB Output is correct
17 Correct 20 ms 2924 KB Output is correct
18 Correct 7 ms 2924 KB Output is correct
19 Correct 6 ms 2540 KB Output is correct
20 Correct 19 ms 3052 KB Output is correct
21 Correct 26 ms 2924 KB Output is correct
22 Correct 1 ms 492 KB Output is correct
23 Correct 6 ms 2540 KB Output is correct
24 Correct 6 ms 2676 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 6 ms 2924 KB Output is correct
28 Correct 6 ms 2540 KB Output is correct
29 Correct 6 ms 2540 KB Output is correct
30 Correct 6 ms 2540 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 31052 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 88 ms 30972 KB Output is correct
4 Correct 78 ms 30956 KB Output is correct
5 Correct 86 ms 31052 KB Output is correct
6 Correct 113 ms 31308 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 27076 KB Output is correct
2 Correct 103 ms 23532 KB Output is correct
3 Correct 105 ms 23236 KB Output is correct
4 Correct 111 ms 23148 KB Output is correct
5 Correct 101 ms 23276 KB Output is correct
6 Correct 79 ms 26988 KB Output is correct
7 Correct 80 ms 26988 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 27076 KB Output is correct
2 Correct 103 ms 23532 KB Output is correct
3 Correct 105 ms 23236 KB Output is correct
4 Correct 111 ms 23148 KB Output is correct
5 Correct 101 ms 23276 KB Output is correct
6 Correct 79 ms 26988 KB Output is correct
7 Correct 80 ms 26988 KB Output is correct
8 Correct 88 ms 27116 KB Output is correct
9 Correct 86 ms 28396 KB Output is correct
10 Correct 87 ms 32972 KB Output is correct
11 Correct 85 ms 32844 KB Output is correct
12 Correct 80 ms 24592 KB Output is correct
13 Correct 84 ms 24556 KB Output is correct
14 Correct 92 ms 24556 KB Output is correct
15 Correct 98 ms 24556 KB Output is correct
16 Correct 106 ms 24428 KB Output is correct
17 Correct 100 ms 24556 KB Output is correct
18 Correct 99 ms 24428 KB Output is correct
19 Correct 96 ms 24812 KB Output is correct
20 Correct 83 ms 28524 KB Output is correct
21 Correct 91 ms 28524 KB Output is correct
22 Correct 82 ms 28396 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 6 ms 2412 KB Output is correct
3 Correct 6 ms 2412 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 6 ms 2924 KB Output is correct
7 Correct 6 ms 2540 KB Output is correct
8 Correct 5 ms 2540 KB Output is correct
9 Correct 5 ms 2540 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 19 ms 2816 KB Output is correct
16 Correct 19 ms 2936 KB Output is correct
17 Correct 20 ms 2924 KB Output is correct
18 Correct 7 ms 2924 KB Output is correct
19 Correct 6 ms 2540 KB Output is correct
20 Correct 19 ms 3052 KB Output is correct
21 Correct 26 ms 2924 KB Output is correct
22 Correct 1 ms 492 KB Output is correct
23 Correct 6 ms 2540 KB Output is correct
24 Correct 6 ms 2676 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 6 ms 2924 KB Output is correct
28 Correct 6 ms 2540 KB Output is correct
29 Correct 6 ms 2540 KB Output is correct
30 Correct 6 ms 2540 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 94 ms 31052 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 88 ms 30972 KB Output is correct
39 Correct 78 ms 30956 KB Output is correct
40 Correct 86 ms 31052 KB Output is correct
41 Correct 113 ms 31308 KB Output is correct
42 Correct 83 ms 27076 KB Output is correct
43 Correct 103 ms 23532 KB Output is correct
44 Correct 105 ms 23236 KB Output is correct
45 Correct 111 ms 23148 KB Output is correct
46 Correct 101 ms 23276 KB Output is correct
47 Correct 79 ms 26988 KB Output is correct
48 Correct 80 ms 26988 KB Output is correct
49 Correct 88 ms 27116 KB Output is correct
50 Correct 86 ms 28396 KB Output is correct
51 Correct 87 ms 32972 KB Output is correct
52 Correct 85 ms 32844 KB Output is correct
53 Correct 80 ms 24592 KB Output is correct
54 Correct 84 ms 24556 KB Output is correct
55 Correct 92 ms 24556 KB Output is correct
56 Correct 98 ms 24556 KB Output is correct
57 Correct 106 ms 24428 KB Output is correct
58 Correct 100 ms 24556 KB Output is correct
59 Correct 99 ms 24428 KB Output is correct
60 Correct 96 ms 24812 KB Output is correct
61 Correct 83 ms 28524 KB Output is correct
62 Correct 91 ms 28524 KB Output is correct
63 Correct 82 ms 28396 KB Output is correct
64 Correct 83 ms 28396 KB Output is correct
65 Correct 101 ms 24428 KB Output is correct
66 Correct 121 ms 24428 KB Output is correct
67 Correct 112 ms 24488 KB Output is correct
68 Correct 79 ms 24556 KB Output is correct
69 Correct 67 ms 24556 KB Output is correct
70 Correct 89 ms 28396 KB Output is correct
71 Correct 84 ms 28396 KB Output is correct
72 Correct 1 ms 364 KB Output is correct
73 Correct 6 ms 2540 KB Output is correct
74 Correct 6 ms 2540 KB Output is correct
75 Correct 1 ms 364 KB Output is correct
76 Correct 1 ms 364 KB Output is correct
77 Correct 8 ms 2924 KB Output is correct
78 Correct 8 ms 2684 KB Output is correct
79 Correct 6 ms 2540 KB Output is correct
80 Correct 6 ms 2540 KB Output is correct
81 Correct 1 ms 364 KB Output is correct
82 Correct 1 ms 364 KB Output is correct
83 Correct 1 ms 364 KB Output is correct
84 Correct 1 ms 384 KB Output is correct
85 Correct 1 ms 364 KB Output is correct
86 Correct 20 ms 2796 KB Output is correct
87 Correct 20 ms 2944 KB Output is correct
88 Correct 21 ms 2924 KB Output is correct
89 Correct 7 ms 2924 KB Output is correct
90 Correct 8 ms 2540 KB Output is correct
91 Correct 18 ms 3052 KB Output is correct
92 Correct 24 ms 2924 KB Output is correct
93 Correct 1 ms 364 KB Output is correct
94 Correct 93 ms 32972 KB Output is correct
95 Correct 84 ms 32288 KB Output is correct
96 Correct 81 ms 32364 KB Output is correct
97 Correct 94 ms 32844 KB Output is correct
98 Correct 97 ms 33228 KB Output is correct
99 Correct 99 ms 24428 KB Output is correct
100 Correct 111 ms 24556 KB Output is correct
101 Correct 100 ms 24428 KB Output is correct
102 Correct 96 ms 24836 KB Output is correct
103 Correct 90 ms 28396 KB Output is correct
104 Correct 83 ms 28396 KB Output is correct
105 Correct 81 ms 28396 KB Output is correct
106 Correct 101 ms 28524 KB Output is correct
107 Correct 85 ms 28396 KB Output is correct
108 Correct 101 ms 32976 KB Output is correct
109 Correct 97 ms 32972 KB Output is correct
110 Correct 73 ms 24684 KB Output is correct
111 Correct 74 ms 24556 KB Output is correct
112 Correct 93 ms 24428 KB Output is correct
113 Correct 96 ms 24556 KB Output is correct