oj.uz

Submission #552722

# Submission time Handle Problem Language Result Execution time Memory
552722 2022-04-23T17:10:42 Z Talha_Taki Railway (BOI17_railway) C++17
100 / 100
 277 ms 34296 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
 
typedef long long ll;
typedef pair <int, int> pii;
 
 
vector <vector <int>> adj, parent;
vector <int> tin, tout, depth;
 
int x, timer;
 
struct Segment_Tree {
    int n;
    vector <int> tree;
 
    Segment_Tree() {}
    Segment_Tree(int n) : n(n) {
        tree.assign(n<<2, 0);
    }
 
    void update(int now, int l, int r, const int i, const int j) { // increment update
        if (l > j || r < i) return ;
        if (i <= l && j >= r) {
            tree[now]++;
            return ;
        }
 
        int mid = (l+r)>>1;
        int left = now<<1;
        int right = left|1;
 
        update(left, l, mid, i, j);
        update(right, mid+1, r, i, j);
    }
 
    int query(int now, int l, int r, const int pos) {
        if (l == r) return tree[now];
        
        int mid = (l+r)>>1;
        int left = now<<1;
        int right = left|1;
 
        if (pos <= mid) return tree[now] + query(left, l, mid, pos);
        else return tree[now] + query(right, mid+1, r, pos);
    }
};
 
void dfs(int u, int p) {
    tin[u] = ++timer;
    depth[u] = depth[p] + 1;
    parent[u][0] = p;
 
    for(int i = 1; i <= x; ++i) parent[u][i] = parent[parent[u][i-1]][i-1];
 
    for(int v : adj[u]) {
        if (v == p) continue;
        dfs(v, u);
    }
 
    tout[u] = ++timer;
}
 
inline bool isAncestor(int u, int v) {
    return tin[u] <= tin[v] && tout[u] >= tout[v];
}
 
int lca(int u, int v) {
    if (isAncestor(u, v)) return u;
    if (isAncestor(v, u)) return v;
 
    for(int i = x; i >= 0; --i) {
        if (!isAncestor(parent[u][i], v)) {
            u = parent[u][i];
        }
    }
 
    return parent[u][0];
}
 
int upper(int u, int v) {
    if (depth[u] > depth[v]) swap(u, v);
 
    for(int i = x; i >= 0; --i) {
        if (!isAncestor(parent[v][i], u)) {
            v = parent[v][i];
        }
    }
    return v;
}
 
inline bool cmp(int u, int v) {
    return tin[u] < tin[v];
}
 
inline pii manage(int u, int v) {
    if (u > v) swap(u, v);
    return make_pair(u, v);
}
 
int main(const int argc, const char *argv[]) {
 
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
 
    int n, m, k;
    cin >> n >> m >> k;
    int euler = n<<1;
 
    x = ceil(log2(n));
    timer = 0;
    adj.resize(n+1);
    parent.assign(n+1, vector <int> (x+1, 0));
    tin.resize(n+1);
    tout.resize(n+1);
    depth.assign(n+1, 0);
    tin[0] = 0;
    tout[0] = euler+1;
 
    map <pii, int> mp;
 
    for(int i = 1; i < n; ++i) {
        int u, v;
        cin >> u >> v;
 
        adj[u].push_back(v);
        adj[v].push_back(u);

        mp[manage(u, v)] = i;
    }
    dfs(1, 0);
    Segment_Tree seg_tree(euler+1);
 
    for(int i = 0; i < m; ++i) {
        int s;
        cin >> s;
 
        vector <int> node(s);
        for(int i = 0; i < s; ++i) {
            cin >> node[i];
        }
        sort(node.begin(), node.end(), cmp);
 
        for(int i = 1; i < s; ++i) {
            node.push_back(lca(node[i], node[i-1]));
        }
 
        sort(node.begin(), node.end());
        node.resize(distance(node.begin(), unique(node.begin(), node.end())));
        sort(node.begin(), node.end(), cmp);
        s = node.size();
        
        vector <int> tmp;
        tmp.push_back(node[0]);
 
        for(int i = 1; i < s; ++i) {
            while (tmp.size() >= 2 && !isAncestor(tmp.back(), node[i])) {
                int u = tmp[tmp.size()-2];
                int v = tmp.back();
                assert(isAncestor(u, v));
                int a = upper(u, v);
                seg_tree.update(1, 1, euler, tin[a], tin[v]);
                tmp.pop_back();
            }
            tmp.push_back(node[i]);
        }
 
        while (tmp.size() > 1)  {
            int u = tmp[tmp.size()-2];
            int v = tmp.back();
            assert(isAncestor(u, v));
            int a = upper(u, v);
            seg_tree.update(1, 1, euler, tin[a], tin[v]);
            tmp.pop_back();
        }
    }
 
    int ans = 0;
    vector <int> id;
    for(int i = 2; i <= n; ++i) {
        int res = seg_tree.query(1, 1, euler, tin[i]) - seg_tree.query(1, 1, euler, tout[i]);
        if (res >= k) {
            ans++;
            id.push_back(mp[manage(parent[i][0], i)]);
        }
    }
    cout << ans << '\n';
 
    sort(id.begin(), id.end());
    for(int i : id) {
        cout << i << ' ';
    }
 
    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 11 ms 3024 KB Output is correct
3 Correct 11 ms 3016 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 10 ms 3284 KB Output is correct
7 Correct 9 ms 3028 KB Output is correct
8 Correct 8 ms 3020 KB Output is correct
9 Correct 9 ms 3028 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 316 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 11 ms 3024 KB Output is correct
3 Correct 11 ms 3016 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 10 ms 3284 KB Output is correct
7 Correct 9 ms 3028 KB Output is correct
8 Correct 8 ms 3020 KB Output is correct
9 Correct 9 ms 3028 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 316 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 63 ms 3332 KB Output is correct
16 Correct 62 ms 3404 KB Output is correct
17 Correct 62 ms 3404 KB Output is correct
18 Correct 11 ms 3304 KB Output is correct
19 Correct 8 ms 3024 KB Output is correct
20 Correct 50 ms 3544 KB Output is correct
21 Correct 70 ms 3488 KB Output is correct
22 Correct 1 ms 316 KB Output is correct
23 Correct 10 ms 3028 KB Output is correct
24 Correct 10 ms 3016 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 9 ms 3276 KB Output is correct
28 Correct 9 ms 3028 KB Output is correct
29 Correct 8 ms 3012 KB Output is correct
30 Correct 9 ms 3052 KB Output is correct
31 Correct 1 ms 316 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 213 ms 32388 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 231 ms 33612 KB Output is correct
4 Correct 217 ms 32960 KB Output is correct
5 Correct 255 ms 33912 KB Output is correct
6 Correct 233 ms 34240 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 144 ms 29132 KB Output is correct
2 Correct 162 ms 28596 KB Output is correct
3 Correct 189 ms 28428 KB Output is correct
4 Correct 171 ms 28464 KB Output is correct
5 Correct 172 ms 28416 KB Output is correct
6 Correct 158 ms 30888 KB Output is correct
7 Correct 140 ms 30800 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 144 ms 29132 KB Output is correct
2 Correct 162 ms 28596 KB Output is correct
3 Correct 189 ms 28428 KB Output is correct
4 Correct 171 ms 28464 KB Output is correct
5 Correct 172 ms 28416 KB Output is correct
6 Correct 158 ms 30888 KB Output is correct
7 Correct 140 ms 30800 KB Output is correct
8 Correct 202 ms 30904 KB Output is correct
9 Correct 221 ms 30896 KB Output is correct
10 Correct 221 ms 34048 KB Output is correct
11 Correct 277 ms 33996 KB Output is correct
12 Correct 159 ms 28328 KB Output is correct
13 Correct 179 ms 28356 KB Output is correct
14 Correct 224 ms 28364 KB Output is correct
15 Correct 197 ms 28360 KB Output is correct
16 Correct 192 ms 28516 KB Output is correct
17 Correct 178 ms 28364 KB Output is correct
18 Correct 183 ms 28552 KB Output is correct
19 Correct 200 ms 28676 KB Output is correct
20 Correct 143 ms 31224 KB Output is correct
21 Correct 160 ms 31336 KB Output is correct
22 Correct 158 ms 30992 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 11 ms 3024 KB Output is correct
3 Correct 11 ms 3016 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 10 ms 3284 KB Output is correct
7 Correct 9 ms 3028 KB Output is correct
8 Correct 8 ms 3020 KB Output is correct
9 Correct 9 ms 3028 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 316 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 63 ms 3332 KB Output is correct
16 Correct 62 ms 3404 KB Output is correct
17 Correct 62 ms 3404 KB Output is correct
18 Correct 11 ms 3304 KB Output is correct
19 Correct 8 ms 3024 KB Output is correct
20 Correct 50 ms 3544 KB Output is correct
21 Correct 70 ms 3488 KB Output is correct
22 Correct 1 ms 316 KB Output is correct
23 Correct 10 ms 3028 KB Output is correct
24 Correct 10 ms 3016 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 9 ms 3276 KB Output is correct
28 Correct 9 ms 3028 KB Output is correct
29 Correct 8 ms 3012 KB Output is correct
30 Correct 9 ms 3052 KB Output is correct
31 Correct 1 ms 316 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 213 ms 32388 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 231 ms 33612 KB Output is correct
39 Correct 217 ms 32960 KB Output is correct
40 Correct 255 ms 33912 KB Output is correct
41 Correct 233 ms 34240 KB Output is correct
42 Correct 144 ms 29132 KB Output is correct
43 Correct 162 ms 28596 KB Output is correct
44 Correct 189 ms 28428 KB Output is correct
45 Correct 171 ms 28464 KB Output is correct
46 Correct 172 ms 28416 KB Output is correct
47 Correct 158 ms 30888 KB Output is correct
48 Correct 140 ms 30800 KB Output is correct
49 Correct 202 ms 30904 KB Output is correct
50 Correct 221 ms 30896 KB Output is correct
51 Correct 221 ms 34048 KB Output is correct
52 Correct 277 ms 33996 KB Output is correct
53 Correct 159 ms 28328 KB Output is correct
54 Correct 179 ms 28356 KB Output is correct
55 Correct 224 ms 28364 KB Output is correct
56 Correct 197 ms 28360 KB Output is correct
57 Correct 192 ms 28516 KB Output is correct
58 Correct 178 ms 28364 KB Output is correct
59 Correct 183 ms 28552 KB Output is correct
60 Correct 200 ms 28676 KB Output is correct
61 Correct 143 ms 31224 KB Output is correct
62 Correct 160 ms 31336 KB Output is correct
63 Correct 158 ms 30992 KB Output is correct
64 Correct 163 ms 30992 KB Output is correct
65 Correct 218 ms 28368 KB Output is correct
66 Correct 251 ms 28368 KB Output is correct
67 Correct 199 ms 28496 KB Output is correct
68 Correct 151 ms 28244 KB Output is correct
69 Correct 165 ms 28164 KB Output is correct
70 Correct 163 ms 31304 KB Output is correct
71 Correct 204 ms 30628 KB Output is correct
72 Correct 1 ms 316 KB Output is correct
73 Correct 10 ms 3028 KB Output is correct
74 Correct 9 ms 3028 KB Output is correct
75 Correct 0 ms 212 KB Output is correct
76 Correct 0 ms 212 KB Output is correct
77 Correct 9 ms 3272 KB Output is correct
78 Correct 10 ms 3028 KB Output is correct
79 Correct 8 ms 3028 KB Output is correct
80 Correct 9 ms 3028 KB Output is correct
81 Correct 1 ms 320 KB Output is correct
82 Correct 1 ms 212 KB Output is correct
83 Correct 1 ms 212 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 1 ms 324 KB Output is correct
86 Correct 55 ms 3344 KB Output is correct
87 Correct 74 ms 3496 KB Output is correct
88 Correct 78 ms 3464 KB Output is correct
89 Correct 11 ms 3328 KB Output is correct
90 Correct 10 ms 3020 KB Output is correct
91 Correct 46 ms 3612 KB Output is correct
92 Correct 52 ms 3496 KB Output is correct
93 Correct 0 ms 212 KB Output is correct
94 Correct 208 ms 34008 KB Output is correct
95 Correct 231 ms 33528 KB Output is correct
96 Correct 182 ms 33056 KB Output is correct
97 Correct 255 ms 33936 KB Output is correct
98 Correct 252 ms 34296 KB Output is correct
99 Correct 182 ms 28424 KB Output is correct
100 Correct 177 ms 28440 KB Output is correct
101 Correct 208 ms 28440 KB Output is correct
102 Correct 158 ms 28560 KB Output is correct
103 Correct 138 ms 30796 KB Output is correct
104 Correct 166 ms 31164 KB Output is correct
105 Correct 141 ms 30676 KB Output is correct
106 Correct 197 ms 30972 KB Output is correct
107 Correct 218 ms 30828 KB Output is correct
108 Correct 203 ms 34048 KB Output is correct
109 Correct 227 ms 34036 KB Output is correct
110 Correct 182 ms 28348 KB Output is correct
111 Correct 157 ms 28212 KB Output is correct
112 Correct 189 ms 28248 KB Output is correct
113 Correct 212 ms 28236 KB Output is correct