oj.uz

Submission #378287

# Submission time Handle Problem Language Result Execution time Memory
378287 2021-03-16T11:51:17 Z Sara Railway (BOI17_railway) C++14
100 / 100
 278 ms 66152 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;

#define pb push_back
#define F first
#define S second
 
const int N = 300000 + 5;
const int LOG = 30;

int n, m, k;
vector < pair <int, int> > g[N];

int par[LOG][N], h[N];

vector <int> ans;
set <int> st[N];
vector <int> out[N];

void dfs(int v, int pr){
    for (auto it : g[v]){
        int u = it.F;
        if (u == pr) continue;
        par[0][u] = v; 
        h[u] = h[v] + 1;
        dfs(u, v);
    }
    return;
}

inline void pre(){
    for (int i = 1; i < LOG; i ++){
        for (int v = 1; v <= n; v ++){
            par[i][v] = par[i - 1][par[i - 1][v]];
        }
    }
    return;
}

inline int get_par(int v, int dif){
    for (int i = 0; i < LOG; i ++){
        if ((dif >> i & 1)){
            v = par[i][v];
        }
    }
    return v;
}

inline int LCA(int u, int v){
    if (h[v] < h[u]) swap(u, v);
    v = get_par(v, h[v] - h[u]);
    if (u == v) return v;
    for (int i = LOG - 1; i >= 0; i --){
        if (par[i][u] != par[i][v]){
            u = par[i][u];
            v = par[i][v];
        }
    }
    return par[0][v];
}

inline void merge(int pr, int v){
    if ((int)st[pr].size() < (int)st[v].size()){
        swap(st[pr], st[v]);
    }
    for (int col : st[v]){
        st[pr].insert(col);
    }
    st[v].clear();
    return;
}

inline void del(int v){
    for (int col : out[v]){
        st[v].erase(st[v].lower_bound(col));
    }
    return;
}

void dfsCalc(int v, int pr){
    for (auto it : g[v]){
        int u = it.F;
        int id = it.S;
        if (id == pr) continue;
        dfsCalc(u, id);
        merge(v, u);
    }
    del(v);
    if ((v != 1) && (k <= (int)st[v].size())) ans.pb(pr);
    return;
}

int main() {
    ios_base::sync_with_stdio(0), cin.tie(0); cout.tie(0);
    cin >> n >> m >> k;
    for (int i = 1; i < n; i ++){
        int u, v;
        cin >> u >> v;
        g[u].pb({v, i}); g[v].pb({u, i});
    }
    dfs(1, 0); pre();
    for (int i = 1; i <= m; i ++){
        int sz, v, lca = 0;
        cin >> sz;
        vector <int> C = {};

        for (int j = 0; j < sz; j ++){
            int v;
            cin >> v;
            C.pb(v);
            if (lca == 0){
                lca = C[j];
            }
            else {
                lca = LCA(lca, C[j]);
            }
        }

        out[lca].pb(i);
        for (int u: C){
            st[u].insert(i);
        }
        //cout << "dbg " << i << ' ' << lca << '\n';
    }
    dfsCalc(1, 0);
    sort(ans.begin(), ans.end());
    cout << (int)ans.size() << '\n';
    for (int i : ans) cout << i << ' ';
    return 0;
}

Compilation message

railway.cpp: In function 'int main()':
railway.cpp:106:17: warning: unused variable 'v' [-Wunused-variable]
  106 |         int sz, v, lca = 0;
      |                 ^

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 28652 KB Output is correct
2 Correct 24 ms 30444 KB Output is correct
3 Correct 24 ms 30444 KB Output is correct
4 Correct 19 ms 28652 KB Output is correct
5 Correct 19 ms 28652 KB Output is correct
6 Correct 25 ms 31212 KB Output is correct
7 Correct 24 ms 30572 KB Output is correct
8 Correct 24 ms 30444 KB Output is correct
9 Correct 24 ms 30444 KB Output is correct
10 Correct 18 ms 28652 KB Output is correct
11 Correct 19 ms 28652 KB Output is correct
12 Correct 18 ms 28652 KB Output is correct
13 Correct 18 ms 28652 KB Output is correct
14 Correct 18 ms 28652 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 28652 KB Output is correct
2 Correct 24 ms 30444 KB Output is correct
3 Correct 24 ms 30444 KB Output is correct
4 Correct 19 ms 28652 KB Output is correct
5 Correct 19 ms 28652 KB Output is correct
6 Correct 25 ms 31212 KB Output is correct
7 Correct 24 ms 30572 KB Output is correct
8 Correct 24 ms 30444 KB Output is correct
9 Correct 24 ms 30444 KB Output is correct
10 Correct 18 ms 28652 KB Output is correct
11 Correct 19 ms 28652 KB Output is correct
12 Correct 18 ms 28652 KB Output is correct
13 Correct 18 ms 28652 KB Output is correct
14 Correct 18 ms 28652 KB Output is correct
15 Correct 64 ms 34028 KB Output is correct
16 Correct 63 ms 34028 KB Output is correct
17 Correct 66 ms 34028 KB Output is correct
18 Correct 26 ms 31212 KB Output is correct
19 Correct 25 ms 30572 KB Output is correct
20 Correct 69 ms 35100 KB Output is correct
21 Correct 69 ms 35052 KB Output is correct
22 Correct 18 ms 28652 KB Output is correct
23 Correct 24 ms 30444 KB Output is correct
24 Correct 25 ms 30464 KB Output is correct
25 Correct 19 ms 28652 KB Output is correct
26 Correct 18 ms 28652 KB Output is correct
27 Correct 25 ms 31212 KB Output is correct
28 Correct 24 ms 30572 KB Output is correct
29 Correct 24 ms 30444 KB Output is correct
30 Correct 24 ms 30464 KB Output is correct
31 Correct 19 ms 28652 KB Output is correct
32 Correct 19 ms 28652 KB Output is correct
33 Correct 20 ms 28652 KB Output is correct
34 Correct 22 ms 28652 KB Output is correct
35 Correct 19 ms 28652 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 219 ms 64876 KB Output is correct
2 Correct 21 ms 28780 KB Output is correct
3 Correct 207 ms 64492 KB Output is correct
4 Correct 201 ms 63852 KB Output is correct
5 Correct 200 ms 63852 KB Output is correct
6 Correct 169 ms 66152 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 161 ms 56556 KB Output is correct
2 Correct 211 ms 50668 KB Output is correct
3 Correct 236 ms 50280 KB Output is correct
4 Correct 237 ms 50024 KB Output is correct
5 Correct 242 ms 49896 KB Output is correct
6 Correct 165 ms 56684 KB Output is correct
7 Correct 163 ms 56684 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 161 ms 56556 KB Output is correct
2 Correct 211 ms 50668 KB Output is correct
3 Correct 236 ms 50280 KB Output is correct
4 Correct 237 ms 50024 KB Output is correct
5 Correct 242 ms 49896 KB Output is correct
6 Correct 165 ms 56684 KB Output is correct
7 Correct 163 ms 56684 KB Output is correct
8 Correct 159 ms 56556 KB Output is correct
9 Correct 154 ms 56556 KB Output is correct
10 Correct 146 ms 63844 KB Output is correct
11 Correct 147 ms 63972 KB Output is correct
12 Correct 113 ms 49516 KB Output is correct
13 Correct 117 ms 49412 KB Output is correct
14 Correct 178 ms 49260 KB Output is correct
15 Correct 179 ms 49388 KB Output is correct
16 Correct 244 ms 49896 KB Output is correct
17 Correct 258 ms 50280 KB Output is correct
18 Correct 236 ms 50024 KB Output is correct
19 Correct 222 ms 50668 KB Output is correct
20 Correct 162 ms 56940 KB Output is correct
21 Correct 169 ms 57064 KB Output is correct
22 Correct 162 ms 56940 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 28652 KB Output is correct
2 Correct 24 ms 30444 KB Output is correct
3 Correct 24 ms 30444 KB Output is correct
4 Correct 19 ms 28652 KB Output is correct
5 Correct 19 ms 28652 KB Output is correct
6 Correct 25 ms 31212 KB Output is correct
7 Correct 24 ms 30572 KB Output is correct
8 Correct 24 ms 30444 KB Output is correct
9 Correct 24 ms 30444 KB Output is correct
10 Correct 18 ms 28652 KB Output is correct
11 Correct 19 ms 28652 KB Output is correct
12 Correct 18 ms 28652 KB Output is correct
13 Correct 18 ms 28652 KB Output is correct
14 Correct 18 ms 28652 KB Output is correct
15 Correct 64 ms 34028 KB Output is correct
16 Correct 63 ms 34028 KB Output is correct
17 Correct 66 ms 34028 KB Output is correct
18 Correct 26 ms 31212 KB Output is correct
19 Correct 25 ms 30572 KB Output is correct
20 Correct 69 ms 35100 KB Output is correct
21 Correct 69 ms 35052 KB Output is correct
22 Correct 18 ms 28652 KB Output is correct
23 Correct 24 ms 30444 KB Output is correct
24 Correct 25 ms 30464 KB Output is correct
25 Correct 19 ms 28652 KB Output is correct
26 Correct 18 ms 28652 KB Output is correct
27 Correct 25 ms 31212 KB Output is correct
28 Correct 24 ms 30572 KB Output is correct
29 Correct 24 ms 30444 KB Output is correct
30 Correct 24 ms 30464 KB Output is correct
31 Correct 19 ms 28652 KB Output is correct
32 Correct 19 ms 28652 KB Output is correct
33 Correct 20 ms 28652 KB Output is correct
34 Correct 22 ms 28652 KB Output is correct
35 Correct 19 ms 28652 KB Output is correct
36 Correct 219 ms 64876 KB Output is correct
37 Correct 21 ms 28780 KB Output is correct
38 Correct 207 ms 64492 KB Output is correct
39 Correct 201 ms 63852 KB Output is correct
40 Correct 200 ms 63852 KB Output is correct
41 Correct 169 ms 66152 KB Output is correct
42 Correct 161 ms 56556 KB Output is correct
43 Correct 211 ms 50668 KB Output is correct
44 Correct 236 ms 50280 KB Output is correct
45 Correct 237 ms 50024 KB Output is correct
46 Correct 242 ms 49896 KB Output is correct
47 Correct 165 ms 56684 KB Output is correct
48 Correct 163 ms 56684 KB Output is correct
49 Correct 159 ms 56556 KB Output is correct
50 Correct 154 ms 56556 KB Output is correct
51 Correct 146 ms 63844 KB Output is correct
52 Correct 147 ms 63972 KB Output is correct
53 Correct 113 ms 49516 KB Output is correct
54 Correct 117 ms 49412 KB Output is correct
55 Correct 178 ms 49260 KB Output is correct
56 Correct 179 ms 49388 KB Output is correct
57 Correct 244 ms 49896 KB Output is correct
58 Correct 258 ms 50280 KB Output is correct
59 Correct 236 ms 50024 KB Output is correct
60 Correct 222 ms 50668 KB Output is correct
61 Correct 162 ms 56940 KB Output is correct
62 Correct 169 ms 57064 KB Output is correct
63 Correct 162 ms 56940 KB Output is correct
64 Correct 178 ms 57288 KB Output is correct
65 Correct 278 ms 49644 KB Output is correct
66 Correct 211 ms 49388 KB Output is correct
67 Correct 185 ms 49388 KB Output is correct
68 Correct 103 ms 47724 KB Output is correct
69 Correct 101 ms 47724 KB Output is correct
70 Correct 177 ms 57452 KB Output is correct
71 Correct 167 ms 56428 KB Output is correct
72 Correct 19 ms 28652 KB Output is correct
73 Correct 25 ms 30444 KB Output is correct
74 Correct 25 ms 30444 KB Output is correct
75 Correct 19 ms 28652 KB Output is correct
76 Correct 18 ms 28652 KB Output is correct
77 Correct 25 ms 31212 KB Output is correct
78 Correct 24 ms 30572 KB Output is correct
79 Correct 23 ms 30444 KB Output is correct
80 Correct 24 ms 30444 KB Output is correct
81 Correct 19 ms 28652 KB Output is correct
82 Correct 19 ms 28652 KB Output is correct
83 Correct 19 ms 28652 KB Output is correct
84 Correct 19 ms 28652 KB Output is correct
85 Correct 20 ms 28652 KB Output is correct
86 Correct 67 ms 34028 KB Output is correct
87 Correct 62 ms 34028 KB Output is correct
88 Correct 64 ms 34028 KB Output is correct
89 Correct 26 ms 31212 KB Output is correct
90 Correct 25 ms 30572 KB Output is correct
91 Correct 70 ms 35180 KB Output is correct
92 Correct 70 ms 35052 KB Output is correct
93 Correct 19 ms 28652 KB Output is correct
94 Correct 212 ms 64744 KB Output is correct
95 Correct 215 ms 64624 KB Output is correct
96 Correct 205 ms 63852 KB Output is correct
97 Correct 185 ms 63852 KB Output is correct
98 Correct 173 ms 66140 KB Output is correct
99 Correct 258 ms 49896 KB Output is correct
100 Correct 252 ms 50024 KB Output is correct
101 Correct 247 ms 50152 KB Output is correct
102 Correct 205 ms 50540 KB Output is correct
103 Correct 163 ms 56684 KB Output is correct
104 Correct 166 ms 57064 KB Output is correct
105 Correct 158 ms 56556 KB Output is correct
106 Correct 158 ms 56640 KB Output is correct
107 Correct 160 ms 56556 KB Output is correct
108 Correct 147 ms 63844 KB Output is correct
109 Correct 138 ms 63844 KB Output is correct
110 Correct 116 ms 49516 KB Output is correct
111 Correct 111 ms 49516 KB Output is correct
112 Correct 172 ms 49260 KB Output is correct
113 Correct 178 ms 49260 KB Output is correct