oj.uz

답안 #889570

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
889570 2023-12-20T02:57:15 Z shiomusubi496 Railway (BOI17_railway) C++17
100 / 100
 129 ms 29320 KB 
#include <bits/stdc++.h>

using namespace std;

#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#define all(v) begin(v), end(v)

using ll = long long;

struct edge {
    int to, id;
    edge(int to_, int id_) : to(to_), id(id_) {}
};

using Graph = vector<vector<edge>>;

class LowestCommonAncestor {
    int n, h;
    Graph G;
    vector<vector<int>> par;
    vector<int> ord, dep;
    int cnt = 0;

    void dfs(int v, int p) {
        par[0][v] = p;
        ord[v] = cnt++;
        for (auto e : G[v]) {
            if (e.to == p) continue;
            dep[e.to] = dep[v] + 1;
            dfs(e.to, v);
        }
    }

public:
    LowestCommonAncestor(Graph G_) : G(G_) {
        n = G.size();
        h = 1;
        while ((1 << h) < n) ++h;
        ++h;
        par.assign(h, vector<int>(n, -1));
        ord.resize(n);
        dep.resize(n); dep[0] = 0;
        cnt = 0;
        dfs(0, -1);
        rep (i, h - 1) rep (j, n) par[i + 1][j] = par[i][j] == -1 ? -1 : par[i][par[i][j]];
    }
    int lca(int a, int b) {
        if (dep[a] < dep[b]) swap(a, b);
        rrep (i, h) {
            if ((dep[a] - dep[b]) >> i & 1) a = par[i][a];
        }
        if (a == b) return a;
        rrep (i, h) {
            if (par[i][a] != par[i][b]) {
                a = par[i][a];
                b = par[i][b];
            }
        }
        return par[0][a];
    }
    int get_ord(int v) const { return ord[v]; }
};

int main() {
    int n, m, k; cin >> n >> m >> k;
    Graph g(n);
    rep (i, n - 1) {
        int a, b; cin >> a >> b;
        g[--a].emplace_back(--b, i);
        g[b].emplace_back(a, i);
    }
    LowestCommonAncestor lca(g);
    vector<int> imos(n);
    rep (i, m) {
        int s; cin >> s;
        vector<int> v(s);
        rep (j, s) cin >> v[j], --v[j];
        sort(all(v), [&](int a, int b) { return lca.get_ord(a) < lca.get_ord(b); });
        rep (j, s) {
            int a = v[j], b = v[(j + 1) % s];
            int c = lca.lca(a, b);
            ++imos[a]; ++imos[b];
            imos[c] -= 2;
        }
    }
    vector<int> ans;
    auto dfs = [&](auto&& self, int v, int p) -> void {
        for (auto e : g[v]) {
            if (e.to == p) continue;
            self(self, e.to, v);
            if (imos[e.to] >= k * 2) ans.push_back(e.id + 1);
            imos[v] += imos[e.to];
        }
    };
    dfs(dfs, 0, -1);
    sort(all(ans));
    cout << ans.size() << endl;
    rep (i, ans.size()) {
        cout << ans[i];
        if (i != ans.size() - 1) cout << " ";
    }
    cout << endl;
}

Compilation message

railway.cpp: In function 'int main()':
railway.cpp:101:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  101 |         if (i != ans.size() - 1) cout << " ";
      |             ~~^~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 7 ms 2652 KB Output is correct
3 Correct 7 ms 2652 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 2908 KB Output is correct
7 Correct 7 ms 2672 KB Output is correct
8 Correct 6 ms 2908 KB Output is correct
9 Correct 6 ms 2936 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 7 ms 2652 KB Output is correct
3 Correct 7 ms 2652 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 2908 KB Output is correct
7 Correct 7 ms 2672 KB Output is correct
8 Correct 6 ms 2908 KB Output is correct
9 Correct 6 ms 2936 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 25 ms 2652 KB Output is correct
16 Correct 26 ms 2652 KB Output is correct
17 Correct 27 ms 2652 KB Output is correct
18 Correct 8 ms 2908 KB Output is correct
19 Correct 7 ms 2652 KB Output is correct
20 Correct 30 ms 2908 KB Output is correct
21 Correct 30 ms 2908 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 7 ms 2760 KB Output is correct
24 Correct 7 ms 2652 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 7 ms 2908 KB Output is correct
28 Correct 7 ms 2656 KB Output is correct
29 Correct 6 ms 2880 KB Output is correct
30 Correct 6 ms 2912 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 352 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 117 ms 27592 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 114 ms 29128 KB Output is correct
4 Correct 111 ms 29076 KB Output is correct
5 Correct 129 ms 29080 KB Output is correct
6 Correct 114 ms 29112 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 113 ms 26988 KB Output is correct
2 Correct 108 ms 27084 KB Output is correct
3 Correct 119 ms 27084 KB Output is correct
4 Correct 115 ms 27084 KB Output is correct
5 Correct 114 ms 27080 KB Output is correct
6 Correct 103 ms 28360 KB Output is correct
7 Correct 103 ms 28360 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 113 ms 26988 KB Output is correct
2 Correct 108 ms 27084 KB Output is correct
3 Correct 119 ms 27084 KB Output is correct
4 Correct 115 ms 27084 KB Output is correct
5 Correct 114 ms 27080 KB Output is correct
6 Correct 103 ms 28360 KB Output is correct
7 Correct 103 ms 28360 KB Output is correct
8 Correct 107 ms 28224 KB Output is correct
9 Correct 108 ms 28408 KB Output is correct
10 Correct 105 ms 28992 KB Output is correct
11 Correct 103 ms 29128 KB Output is correct
12 Correct 92 ms 27992 KB Output is correct
13 Correct 93 ms 27848 KB Output is correct
14 Correct 109 ms 27076 KB Output is correct
15 Correct 118 ms 27324 KB Output is correct
16 Correct 112 ms 27080 KB Output is correct
17 Correct 114 ms 26992 KB Output is correct
18 Correct 112 ms 27112 KB Output is correct
19 Correct 112 ms 27188 KB Output is correct
20 Correct 104 ms 28224 KB Output is correct
21 Correct 105 ms 28192 KB Output is correct
22 Correct 108 ms 28364 KB Output is correct

Subtask #6
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 7 ms 2652 KB Output is correct
3 Correct 7 ms 2652 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 2908 KB Output is correct
7 Correct 7 ms 2672 KB Output is correct
8 Correct 6 ms 2908 KB Output is correct
9 Correct 6 ms 2936 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 25 ms 2652 KB Output is correct
16 Correct 26 ms 2652 KB Output is correct
17 Correct 27 ms 2652 KB Output is correct
18 Correct 8 ms 2908 KB Output is correct
19 Correct 7 ms 2652 KB Output is correct
20 Correct 30 ms 2908 KB Output is correct
21 Correct 30 ms 2908 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 7 ms 2760 KB Output is correct
24 Correct 7 ms 2652 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 7 ms 2908 KB Output is correct
28 Correct 7 ms 2656 KB Output is correct
29 Correct 6 ms 2880 KB Output is correct
30 Correct 6 ms 2912 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 352 KB Output is correct
36 Correct 117 ms 27592 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 114 ms 29128 KB Output is correct
39 Correct 111 ms 29076 KB Output is correct
40 Correct 129 ms 29080 KB Output is correct
41 Correct 114 ms 29112 KB Output is correct
42 Correct 113 ms 26988 KB Output is correct
43 Correct 108 ms 27084 KB Output is correct
44 Correct 119 ms 27084 KB Output is correct
45 Correct 115 ms 27084 KB Output is correct
46 Correct 114 ms 27080 KB Output is correct
47 Correct 103 ms 28360 KB Output is correct
48 Correct 103 ms 28360 KB Output is correct
49 Correct 107 ms 28224 KB Output is correct
50 Correct 108 ms 28408 KB Output is correct
51 Correct 105 ms 28992 KB Output is correct
52 Correct 103 ms 29128 KB Output is correct
53 Correct 92 ms 27992 KB Output is correct
54 Correct 93 ms 27848 KB Output is correct
55 Correct 109 ms 27076 KB Output is correct
56 Correct 118 ms 27324 KB Output is correct
57 Correct 112 ms 27080 KB Output is correct
58 Correct 114 ms 26992 KB Output is correct
59 Correct 112 ms 27112 KB Output is correct
60 Correct 112 ms 27188 KB Output is correct
61 Correct 104 ms 28224 KB Output is correct
62 Correct 105 ms 28192 KB Output is correct
63 Correct 108 ms 28364 KB Output is correct
64 Correct 110 ms 28364 KB Output is correct
65 Correct 118 ms 27080 KB Output is correct
66 Correct 114 ms 27076 KB Output is correct
67 Correct 113 ms 27084 KB Output is correct
68 Correct 86 ms 27932 KB Output is correct
69 Correct 83 ms 28108 KB Output is correct
70 Correct 111 ms 28276 KB Output is correct
71 Correct 107 ms 28268 KB Output is correct
72 Correct 1 ms 348 KB Output is correct
73 Correct 7 ms 2752 KB Output is correct
74 Correct 7 ms 2908 KB Output is correct
75 Correct 1 ms 348 KB Output is correct
76 Correct 0 ms 348 KB Output is correct
77 Correct 7 ms 2904 KB Output is correct
78 Correct 7 ms 2908 KB Output is correct
79 Correct 6 ms 2908 KB Output is correct
80 Correct 6 ms 2908 KB Output is correct
81 Correct 0 ms 348 KB Output is correct
82 Correct 0 ms 348 KB Output is correct
83 Correct 0 ms 436 KB Output is correct
84 Correct 0 ms 344 KB Output is correct
85 Correct 0 ms 348 KB Output is correct
86 Correct 26 ms 3112 KB Output is correct
87 Correct 26 ms 2924 KB Output is correct
88 Correct 27 ms 2924 KB Output is correct
89 Correct 8 ms 2908 KB Output is correct
90 Correct 7 ms 2908 KB Output is correct
91 Correct 27 ms 3184 KB Output is correct
92 Correct 29 ms 3304 KB Output is correct
93 Correct 0 ms 344 KB Output is correct
94 Correct 115 ms 29128 KB Output is correct
95 Correct 117 ms 29320 KB Output is correct
96 Correct 110 ms 29000 KB Output is correct
97 Correct 110 ms 29136 KB Output is correct
98 Correct 111 ms 29156 KB Output is correct
99 Correct 114 ms 27084 KB Output is correct
100 Correct 111 ms 27012 KB Output is correct
101 Correct 110 ms 27084 KB Output is correct
102 Correct 110 ms 27084 KB Output is correct
103 Correct 102 ms 28360 KB Output is correct
104 Correct 104 ms 28364 KB Output is correct
105 Correct 102 ms 28404 KB Output is correct
106 Correct 105 ms 28364 KB Output is correct
107 Correct 103 ms 28360 KB Output is correct
108 Correct 102 ms 29132 KB Output is correct
109 Correct 102 ms 28980 KB Output is correct
110 Correct 95 ms 28376 KB Output is correct
111 Correct 88 ms 27852 KB Output is correct
112 Correct 107 ms 27080 KB Output is correct
113 Correct 107 ms 26936 KB Output is correct