oj.uz

Submission #654609

# Submission time Handle Problem Language Result Execution time Memory
654609 2022-10-31T22:18:24 Z esomer Railway (BOI17_railway) C++17
100 / 100
 389 ms 57852 KB 
#include<bits/stdc++.h>

using namespace std;

#define ll long long
#define endl "\n"

const int MOD = 998244353;

struct segTree {
    int size;
    vector<pair<ll, int>> minimum;
    void init(int n){
        size = 1;
        while (size < n) size *= 2;
        minimum.assign(2 * size, {1e18, 1});
    }

    void build(vector<int> &a, int x, int lx, int rx){
        if (rx - lx == 1){
            if (lx < (int)a.size()){
                minimum[x] = {a[lx], lx};
            }
            return;
        }
        int m = (lx + rx) / 2;
        build(a, 2 * x + 1, lx, m);
        build(a, 2 * x + 2, m, rx);
        minimum[x] = min(minimum[2 * x + 1], minimum[2 * x + 2]);
    }
    void build(vector<int>& a){
        build(a, 0, 0, size);
    }

    pair<ll, int> calc(int l, int r, int x, int lx, int rx){
        if (lx >= r || l >= rx)
            return {1e18, 1};
        if (lx >= l && rx <= r){
            return minimum[x];
        }
        int m = (lx + rx) / 2;
        pair<ll, int> s1 = calc(l, r, 2 * x + 1, lx, m);
        pair<ll, int> s2 = calc(l, r, 2 * x + 2, m, rx);
        return min(s1, s2);
    }

    ll calc(int l, int r){
        return calc(l, r, 0, 0, size).second;
    }
};

struct segTree2{
    int size;
    vector<ll> sums;
    void init(int n){
        size = 1;
        while (size < n) size *= 2;
        sums.assign(2 * size, 0LL);
    }
    void set(int i, int v, int x, int lx, int rx){
        if (rx - lx == 1){
            sums[x] += v;
            return;
        }
        int m = (lx + rx) / 2;
        if (i < m){
            set(i, v, 2 * x + 1, lx, m);
        }else{
            set(i, v, 2 * x + 2, m, rx);
        }
        sums[x] = sums[2 * x + 1] + sums[2 * x + 2];
    }
    void set(int i, int v){
        set (i, v, 0, 0, size);
    }

    ll sum(int l, int r, int x, int lx, int rx){
        if (lx >= r || l >= rx){
            return 0;
        }
        if (lx >= l && rx <= r){
            return sums[x];
        }
        int m = (lx + rx) / 2;
        ll s1 = sum(l, r, 2 * x + 1, lx, m);
        ll s2 = sum(l, r, 2 * x + 2, m, rx);
        return s1 + s2;
    }

    ll sum (int l, int r){
        return sum(l, r, 0, 0, size);
    }
};


int cnt = 0;

void build_euler(int x, vector<vector<pair<int, int>>>& adj, vector<int>& depths, vector<int>& euler_depth, vector<int>& euler, vector<pair<int, int>>& t, vector<pair<int, int>>& t2, vector<int>& pos, vector<int>& id, int p, int edge){
    t[x].first = (int)euler.size();
    t2[x].first = cnt; pos[cnt] = x; cnt++;
    id[x] = edge;
    euler.push_back(x); euler_depth.push_back(depths[x]);
    for(auto pr : adj[x]){
        int node = pr.first;
        if(node == p) continue;
        depths[node] = depths[x] + 1;
        build_euler(node, adj, depths, euler_depth, euler, t, t2, pos, id, x, pr.second);
        t[x].second = (int)euler.size();
        euler.push_back(x); euler_depth.push_back(depths[x]);
    }
    if(t[x].first + 1 == (int)euler.size()){
        t[x].second = (int)euler.size();
        euler.push_back(x); euler_depth.push_back(depths[x]);
    }
    t2[x].second = cnt; pos[cnt] = x; cnt++;
}

void solve(){
    int n, m, k; cin >> n >> m >> k;
    vector<vector<pair<int, int>>> adj(n);
    for(int i = 0; i < n - 1; i++){
        int a, b; cin >> a >> b; a--; b--;
        adj[a].push_back({b, i + 1}); adj[b].push_back({a, i + 1});
    }
    vector<int> depths(n, 0);
    vector<int> euler_depth;
    vector<int> euler;
    vector<int> id(n);
    vector<pair<int, int>> t(n);
    vector<pair<int, int>> t2(n);
    vector<int> pos(2 * n);
    build_euler(0, adj, depths, euler_depth, euler, t, t2, pos, id, -1, -1);
    segTree lca;
    lca.init((int)euler.size()); lca.build(euler_depth);
    vector<int> lc(m);
    vector<vector<int>> mn(n);
    segTree2 lcas; lcas.init(2 * n);
    for(int q = 0; q < m; q++){
        int s; cin >> s;
        vector<int> v(s); for(auto &i : v) cin >> i; for(int i = 0; i < s; i++) v[i]--;
        int l = v[0];
        mn[v[0]].push_back(q);
        set<int> done; done.insert(v[0]);
        for(int i = 1; i < s; i++){
            bool good = done.count(v[i]);
            if(good) continue;
            done.insert(v[i]);
            mn[v[i]].push_back(q);
            l = euler[lca.calc(min(t[l].first, t[v[i]].first), max(t[l].second, t[v[i]].second))];
        }
        lc[q] = l;
        lcas.set(t2[l].first, 1);
    }
    //I have to do one Euler for the different ministers in the subtree.
    //Another one for the LCAs in my subtree, and substract.
    segTree2 ministers; ministers.init(2 * n);
    vector<int> lst(m, -1);
    vector<vector<int>> next(2 * n);
    for(int i = 0; i < 2 * n; i++){
        for(int x : mn[pos[i]]){
            if(lst[x] == -1) {lst[x] = i; ministers.set(i, 1);}
            else {next[lst[x]].push_back(i); lst[x] = i;}
        }
    }
    vector<pair<int, int>> queries(n);
    for(int i = 0; i < n; i++) queries[i] = {t2[i].first, t2[i].second};
    sort(queries.begin(), queries.end());
    vector<int> ans;
    int l = 0;
    for(auto p : queries){
        while(l < p.first){
            for(int y : next[l]) ministers.set(y, 1);
            l++;
        }
        int mini = ministers.sum(p.first, p.second + 1) - lcas.sum(p.first, p.second + 1);
        //cout << "P.first "<< p.first << " "<< p.second << " pos "<< pos[p.first] << " "<< mini << endl;
        //cout << "Sum "<< ministers.sum(p.first, p.second + 1) << " lca "<< lcas.sum(p.first, p.second + 1) << endl;
        if(mini >= k){
            ans.push_back(id[pos[p.first]]);
        }
    }
    sort(ans.begin(), ans.end()); cout << ans.size() << endl; for(int x : ans) {cout << x << " ";} cout << endl;
}

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    //freopen("inpt.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);

    //int tt; cin >> tt;
    int tt = 1;
    for(int t = 1; t <= tt; t++){
        //cout << "Case #"<<t << ": ";
        solve();
    }
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 9 ms 4436 KB Output is correct
3 Correct 10 ms 4436 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 10 ms 5292 KB Output is correct
7 Correct 10 ms 4776 KB Output is correct
8 Correct 9 ms 4532 KB Output is correct
9 Correct 9 ms 4564 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 320 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 1 ms 212 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 9 ms 4436 KB Output is correct
3 Correct 10 ms 4436 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 10 ms 5292 KB Output is correct
7 Correct 10 ms 4776 KB Output is correct
8 Correct 9 ms 4532 KB Output is correct
9 Correct 9 ms 4564 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 320 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 45 ms 6480 KB Output is correct
16 Correct 45 ms 6536 KB Output is correct
17 Correct 47 ms 6592 KB Output is correct
18 Correct 11 ms 5196 KB Output is correct
19 Correct 11 ms 4680 KB Output is correct
20 Correct 59 ms 6996 KB Output is correct
21 Correct 55 ms 6988 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 10 ms 4436 KB Output is correct
24 Correct 9 ms 4428 KB Output is correct
25 Correct 1 ms 316 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 11 ms 5332 KB Output is correct
28 Correct 10 ms 4656 KB Output is correct
29 Correct 9 ms 4564 KB Output is correct
30 Correct 9 ms 4552 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 1 ms 320 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 219 ms 57368 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 213 ms 56896 KB Output is correct
4 Correct 203 ms 56240 KB Output is correct
5 Correct 179 ms 57796 KB Output is correct
6 Correct 189 ms 57808 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 132 ms 46136 KB Output is correct
2 Correct 138 ms 40044 KB Output is correct
3 Correct 146 ms 39468 KB Output is correct
4 Correct 141 ms 39424 KB Output is correct
5 Correct 152 ms 39608 KB Output is correct
6 Correct 143 ms 46332 KB Output is correct
7 Correct 132 ms 46216 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 132 ms 46136 KB Output is correct
2 Correct 138 ms 40044 KB Output is correct
3 Correct 146 ms 39468 KB Output is correct
4 Correct 141 ms 39424 KB Output is correct
5 Correct 152 ms 39608 KB Output is correct
6 Correct 143 ms 46332 KB Output is correct
7 Correct 132 ms 46216 KB Output is correct
8 Correct 171 ms 49424 KB Output is correct
9 Correct 169 ms 49464 KB Output is correct
10 Correct 179 ms 57852 KB Output is correct
11 Correct 185 ms 57756 KB Output is correct
12 Correct 160 ms 52208 KB Output is correct
13 Correct 183 ms 52156 KB Output is correct
14 Correct 137 ms 39504 KB Output is correct
15 Correct 145 ms 39408 KB Output is correct
16 Correct 169 ms 39652 KB Output is correct
17 Correct 151 ms 39560 KB Output is correct
18 Correct 165 ms 39528 KB Output is correct
19 Correct 137 ms 40044 KB Output is correct
20 Correct 143 ms 46584 KB Output is correct
21 Correct 143 ms 46808 KB Output is correct
22 Correct 139 ms 46528 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 9 ms 4436 KB Output is correct
3 Correct 10 ms 4436 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 10 ms 5292 KB Output is correct
7 Correct 10 ms 4776 KB Output is correct
8 Correct 9 ms 4532 KB Output is correct
9 Correct 9 ms 4564 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 320 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 45 ms 6480 KB Output is correct
16 Correct 45 ms 6536 KB Output is correct
17 Correct 47 ms 6592 KB Output is correct
18 Correct 11 ms 5196 KB Output is correct
19 Correct 11 ms 4680 KB Output is correct
20 Correct 59 ms 6996 KB Output is correct
21 Correct 55 ms 6988 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 10 ms 4436 KB Output is correct
24 Correct 9 ms 4428 KB Output is correct
25 Correct 1 ms 316 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 11 ms 5332 KB Output is correct
28 Correct 10 ms 4656 KB Output is correct
29 Correct 9 ms 4564 KB Output is correct
30 Correct 9 ms 4552 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 1 ms 320 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 219 ms 57368 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 213 ms 56896 KB Output is correct
39 Correct 203 ms 56240 KB Output is correct
40 Correct 179 ms 57796 KB Output is correct
41 Correct 189 ms 57808 KB Output is correct
42 Correct 132 ms 46136 KB Output is correct
43 Correct 138 ms 40044 KB Output is correct
44 Correct 146 ms 39468 KB Output is correct
45 Correct 141 ms 39424 KB Output is correct
46 Correct 152 ms 39608 KB Output is correct
47 Correct 143 ms 46332 KB Output is correct
48 Correct 132 ms 46216 KB Output is correct
49 Correct 171 ms 49424 KB Output is correct
50 Correct 169 ms 49464 KB Output is correct
51 Correct 179 ms 57852 KB Output is correct
52 Correct 185 ms 57756 KB Output is correct
53 Correct 160 ms 52208 KB Output is correct
54 Correct 183 ms 52156 KB Output is correct
55 Correct 137 ms 39504 KB Output is correct
56 Correct 145 ms 39408 KB Output is correct
57 Correct 169 ms 39652 KB Output is correct
58 Correct 151 ms 39560 KB Output is correct
59 Correct 165 ms 39528 KB Output is correct
60 Correct 137 ms 40044 KB Output is correct
61 Correct 143 ms 46584 KB Output is correct
62 Correct 143 ms 46808 KB Output is correct
63 Correct 139 ms 46528 KB Output is correct
64 Correct 169 ms 48152 KB Output is correct
65 Correct 244 ms 43112 KB Output is correct
66 Correct 212 ms 43320 KB Output is correct
67 Correct 183 ms 42328 KB Output is correct
68 Correct 138 ms 50204 KB Output is correct
69 Correct 138 ms 50092 KB Output is correct
70 Correct 163 ms 48580 KB Output is correct
71 Correct 165 ms 48872 KB Output is correct
72 Correct 1 ms 320 KB Output is correct
73 Correct 9 ms 4424 KB Output is correct
74 Correct 10 ms 4424 KB Output is correct
75 Correct 1 ms 212 KB Output is correct
76 Correct 1 ms 212 KB Output is correct
77 Correct 11 ms 5332 KB Output is correct
78 Correct 10 ms 4772 KB Output is correct
79 Correct 8 ms 4564 KB Output is correct
80 Correct 9 ms 4556 KB Output is correct
81 Correct 1 ms 212 KB Output is correct
82 Correct 1 ms 212 KB Output is correct
83 Correct 1 ms 320 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 1 ms 212 KB Output is correct
86 Correct 46 ms 6412 KB Output is correct
87 Correct 49 ms 6616 KB Output is correct
88 Correct 49 ms 6564 KB Output is correct
89 Correct 11 ms 5204 KB Output is correct
90 Correct 10 ms 4692 KB Output is correct
91 Correct 58 ms 7052 KB Output is correct
92 Correct 59 ms 6956 KB Output is correct
93 Correct 1 ms 320 KB Output is correct
94 Correct 215 ms 57440 KB Output is correct
95 Correct 217 ms 56908 KB Output is correct
96 Correct 217 ms 56232 KB Output is correct
97 Correct 216 ms 57780 KB Output is correct
98 Correct 278 ms 57768 KB Output is correct
99 Correct 193 ms 39912 KB Output is correct
100 Correct 162 ms 39496 KB Output is correct
101 Correct 166 ms 39480 KB Output is correct
102 Correct 161 ms 40072 KB Output is correct
103 Correct 157 ms 46324 KB Output is correct
104 Correct 151 ms 46776 KB Output is correct
105 Correct 146 ms 46172 KB Output is correct
106 Correct 200 ms 49612 KB Output is correct
107 Correct 389 ms 49384 KB Output is correct
108 Correct 185 ms 57760 KB Output is correct
109 Correct 212 ms 57852 KB Output is correct
110 Correct 183 ms 52228 KB Output is correct
111 Correct 196 ms 52260 KB Output is correct
112 Correct 150 ms 39444 KB Output is correct
113 Correct 157 ms 39392 KB Output is correct