oj.uz

Submission #700070

# Submission time Handle Problem Language Result Execution time Memory
700070 2023-02-18T15:41:54 Z TS_2392 Railway (BOI17_railway) C++14
100 / 100
 99 ms 23028 KB 
#include <bits/stdc++.h>
#define SPEED ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define eb emplace_back
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
using namespace std;
const int N = 1e5 + 3;
int n, m, k, node[N], cnt[N];
int Tin[N], Timer, jmp[N][18], dep[N];
bool mark[N];
vector<int> res;
vector< pair<int, int> > adj[N];
void dfsLca(int u, int par){
    Tin[u] = ++Timer;
    for(int i = 0; i < adj[u].size(); ++i){
        int v = adj[u][i].fi;
        if(v == par) continue;
        jmp[v][0] = u; dep[v] = dep[u] + 1;
        for(int j = 1; j <= 17; ++j){
            if(!jmp[v][j - 1]) break;
            jmp[v][j] = jmp[jmp[v][j - 1]][j - 1];
        }
        dfsLca(v, u);
    }
}
bool cmp(const int &a, const int &b){
    return Tin[a] < Tin[b];
}
int Lca(int u, int v){
    if(dep[u] < dep[v]) swap(u, v);
    for(int i = 17; i >= 0; --i) if(dep[u] - (1 << i) >= dep[v]){
        u = jmp[u][i];
    }
    if(u == v) return u;
    for(int i = 17; i >= 0; --i) if(jmp[u][i] != jmp[v][i]){
        u = jmp[u][i]; v = jmp[v][i];
    }
    return jmp[u][0];
}
void dfs(int u, int pre_id){
    for(int i = 0; i < adj[u].size(); ++i){
        int v, id; tie(v, id) = adj[u][i];
        if(id == pre_id) continue;
        dfs(v, id); cnt[u] += cnt[v];
    }
    if(pre_id && cnt[u] / 2 >= k) res.eb(pre_id);
}
int main(){
    SPEED;
    cin >> n >> m >> k;
    for(int i = 1; i < n; ++i){
        int u, v; cin >> u >> v;
        adj[u].eb(v, i); adj[v].eb(u, i);
    }
    dfsLca(1, 0);
    while(m--){
        int sz; cin >> sz;
        for(int i = 1; i <= sz; ++i) cin >> node[i];
        sort(node + 1, node + 1 + sz, cmp);
        node[sz + 1] = node[1];
        for(int i = 1; i <= sz; ++i){
            int u = node[i], v = node[i + 1];
            int lca = Lca(u, v);
            ++cnt[u]; ++cnt[v]; cnt[lca] -= 2;
        }
    }
    dfs(1, 0); sort(all(res));
    cout << res.size() << '\n';
    for(int &x : res) cout << x << ' ';
    return 0;
}

Compilation message

railway.cpp: In function 'void dfsLca(int, int)':
railway.cpp:16:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |     for(int i = 0; i < adj[u].size(); ++i){
      |                    ~~^~~~~~~~~~~~~~~
railway.cpp: In function 'void dfs(int, int)':
railway.cpp:42:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |     for(int i = 0; i < adj[u].size(); ++i){
      |                    ~~^~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 5 ms 3796 KB Output is correct
3 Correct 5 ms 3860 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 8 ms 4308 KB Output is correct
7 Correct 7 ms 3924 KB Output is correct
8 Correct 5 ms 3924 KB Output is correct
9 Correct 5 ms 3924 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 1 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 1 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 5 ms 3796 KB Output is correct
3 Correct 5 ms 3860 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 8 ms 4308 KB Output is correct
7 Correct 7 ms 3924 KB Output is correct
8 Correct 5 ms 3924 KB Output is correct
9 Correct 5 ms 3924 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 1 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 1 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 17 ms 3924 KB Output is correct
16 Correct 21 ms 3924 KB Output is correct
17 Correct 19 ms 3896 KB Output is correct
18 Correct 6 ms 4268 KB Output is correct
19 Correct 5 ms 3924 KB Output is correct
20 Correct 16 ms 3948 KB Output is correct
21 Correct 23 ms 3932 KB Output is correct
22 Correct 2 ms 2644 KB Output is correct
23 Correct 5 ms 3816 KB Output is correct
24 Correct 7 ms 3804 KB Output is correct
25 Correct 1 ms 2644 KB Output is correct
26 Correct 1 ms 2644 KB Output is correct
27 Correct 6 ms 4320 KB Output is correct
28 Correct 5 ms 3924 KB Output is correct
29 Correct 4 ms 3924 KB Output is correct
30 Correct 4 ms 3924 KB Output is correct
31 Correct 1 ms 2644 KB Output is correct
32 Correct 1 ms 2644 KB Output is correct
33 Correct 1 ms 2644 KB Output is correct
34 Correct 1 ms 2644 KB Output is correct
35 Correct 2 ms 2644 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 85 ms 22720 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 90 ms 22344 KB Output is correct
4 Correct 80 ms 21844 KB Output is correct
5 Correct 85 ms 22728 KB Output is correct
6 Correct 80 ms 22852 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 18332 KB Output is correct
2 Correct 99 ms 15016 KB Output is correct
3 Correct 64 ms 14748 KB Output is correct
4 Correct 76 ms 14576 KB Output is correct
5 Correct 80 ms 14628 KB Output is correct
6 Correct 77 ms 18600 KB Output is correct
7 Correct 78 ms 18428 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 18332 KB Output is correct
2 Correct 99 ms 15016 KB Output is correct
3 Correct 64 ms 14748 KB Output is correct
4 Correct 76 ms 14576 KB Output is correct
5 Correct 80 ms 14628 KB Output is correct
6 Correct 77 ms 18600 KB Output is correct
7 Correct 78 ms 18428 KB Output is correct
8 Correct 98 ms 18504 KB Output is correct
9 Correct 71 ms 18540 KB Output is correct
10 Correct 84 ms 23028 KB Output is correct
11 Correct 75 ms 22808 KB Output is correct
12 Correct 49 ms 14800 KB Output is correct
13 Correct 55 ms 14736 KB Output is correct
14 Correct 85 ms 14620 KB Output is correct
15 Correct 77 ms 14620 KB Output is correct
16 Correct 68 ms 14628 KB Output is correct
17 Correct 65 ms 14528 KB Output is correct
18 Correct 66 ms 14616 KB Output is correct
19 Correct 71 ms 14996 KB Output is correct
20 Correct 64 ms 18740 KB Output is correct
21 Correct 80 ms 18900 KB Output is correct
22 Correct 71 ms 18740 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 5 ms 3796 KB Output is correct
3 Correct 5 ms 3860 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 8 ms 4308 KB Output is correct
7 Correct 7 ms 3924 KB Output is correct
8 Correct 5 ms 3924 KB Output is correct
9 Correct 5 ms 3924 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 1 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 1 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 17 ms 3924 KB Output is correct
16 Correct 21 ms 3924 KB Output is correct
17 Correct 19 ms 3896 KB Output is correct
18 Correct 6 ms 4268 KB Output is correct
19 Correct 5 ms 3924 KB Output is correct
20 Correct 16 ms 3948 KB Output is correct
21 Correct 23 ms 3932 KB Output is correct
22 Correct 2 ms 2644 KB Output is correct
23 Correct 5 ms 3816 KB Output is correct
24 Correct 7 ms 3804 KB Output is correct
25 Correct 1 ms 2644 KB Output is correct
26 Correct 1 ms 2644 KB Output is correct
27 Correct 6 ms 4320 KB Output is correct
28 Correct 5 ms 3924 KB Output is correct
29 Correct 4 ms 3924 KB Output is correct
30 Correct 4 ms 3924 KB Output is correct
31 Correct 1 ms 2644 KB Output is correct
32 Correct 1 ms 2644 KB Output is correct
33 Correct 1 ms 2644 KB Output is correct
34 Correct 1 ms 2644 KB Output is correct
35 Correct 2 ms 2644 KB Output is correct
36 Correct 85 ms 22720 KB Output is correct
37 Correct 2 ms 2644 KB Output is correct
38 Correct 90 ms 22344 KB Output is correct
39 Correct 80 ms 21844 KB Output is correct
40 Correct 85 ms 22728 KB Output is correct
41 Correct 80 ms 22852 KB Output is correct
42 Correct 67 ms 18332 KB Output is correct
43 Correct 99 ms 15016 KB Output is correct
44 Correct 64 ms 14748 KB Output is correct
45 Correct 76 ms 14576 KB Output is correct
46 Correct 80 ms 14628 KB Output is correct
47 Correct 77 ms 18600 KB Output is correct
48 Correct 78 ms 18428 KB Output is correct
49 Correct 98 ms 18504 KB Output is correct
50 Correct 71 ms 18540 KB Output is correct
51 Correct 84 ms 23028 KB Output is correct
52 Correct 75 ms 22808 KB Output is correct
53 Correct 49 ms 14800 KB Output is correct
54 Correct 55 ms 14736 KB Output is correct
55 Correct 85 ms 14620 KB Output is correct
56 Correct 77 ms 14620 KB Output is correct
57 Correct 68 ms 14628 KB Output is correct
58 Correct 65 ms 14528 KB Output is correct
59 Correct 66 ms 14616 KB Output is correct
60 Correct 71 ms 14996 KB Output is correct
61 Correct 64 ms 18740 KB Output is correct
62 Correct 80 ms 18900 KB Output is correct
63 Correct 71 ms 18740 KB Output is correct
64 Correct 74 ms 18636 KB Output is correct
65 Correct 75 ms 14592 KB Output is correct
66 Correct 79 ms 14616 KB Output is correct
67 Correct 77 ms 14624 KB Output is correct
68 Correct 46 ms 14876 KB Output is correct
69 Correct 43 ms 14804 KB Output is correct
70 Correct 71 ms 18904 KB Output is correct
71 Correct 70 ms 18376 KB Output is correct
72 Correct 2 ms 2644 KB Output is correct
73 Correct 6 ms 3796 KB Output is correct
74 Correct 8 ms 3796 KB Output is correct
75 Correct 2 ms 2644 KB Output is correct
76 Correct 2 ms 2644 KB Output is correct
77 Correct 7 ms 4360 KB Output is correct
78 Correct 5 ms 3924 KB Output is correct
79 Correct 4 ms 3924 KB Output is correct
80 Correct 4 ms 3924 KB Output is correct
81 Correct 2 ms 2644 KB Output is correct
82 Correct 2 ms 2644 KB Output is correct
83 Correct 1 ms 2644 KB Output is correct
84 Correct 1 ms 2644 KB Output is correct
85 Correct 2 ms 2644 KB Output is correct
86 Correct 17 ms 3908 KB Output is correct
87 Correct 18 ms 3904 KB Output is correct
88 Correct 19 ms 3924 KB Output is correct
89 Correct 6 ms 4308 KB Output is correct
90 Correct 9 ms 3992 KB Output is correct
91 Correct 22 ms 3936 KB Output is correct
92 Correct 20 ms 3936 KB Output is correct
93 Correct 2 ms 2644 KB Output is correct
94 Correct 85 ms 22724 KB Output is correct
95 Correct 87 ms 22340 KB Output is correct
96 Correct 75 ms 21832 KB Output is correct
97 Correct 96 ms 22720 KB Output is correct
98 Correct 94 ms 22852 KB Output is correct
99 Correct 68 ms 14724 KB Output is correct
100 Correct 70 ms 14624 KB Output is correct
101 Correct 88 ms 14624 KB Output is correct
102 Correct 77 ms 14968 KB Output is correct
103 Correct 68 ms 18388 KB Output is correct
104 Correct 67 ms 18776 KB Output is correct
105 Correct 83 ms 18444 KB Output is correct
106 Correct 74 ms 18676 KB Output is correct
107 Correct 79 ms 18520 KB Output is correct
108 Correct 88 ms 22848 KB Output is correct
109 Correct 86 ms 22860 KB Output is correct
110 Correct 50 ms 14824 KB Output is correct
111 Correct 61 ms 14740 KB Output is correct
112 Correct 76 ms 14688 KB Output is correct
113 Correct 64 ms 14608 KB Output is correct