oj.uz

Submission #964636

# Submission time Handle Problem Language Result Execution time Memory
964636 2024-04-17T08:46:41 Z Alihan_8 Railway (BOI17_railway) C++17
100 / 100
 275 ms 41208 KB 
#include <bits/stdc++.h>

using namespace std;

#define all(x) x.begin(), x.end()
#define ar array
#define pb push_back
#define ln '\n'
#define int long long

using i64 = long long;

template <class F, class _S>
bool chmin(F &u, const _S &v){
    bool flag = false;
    if ( u > v ){
        u = v; flag |= true;
    }
    return flag;
}

template <class F, class _S>
bool chmax(F &u, const _S &v){
    bool flag = false;
    if ( u < v ){
        u = v; flag |= true;
    }
    return flag;
}

const int inf = 1e15;

const int N = 1e5 + 1;

int n;

struct SegTree{
    vector <int> T;

    SegTree(){
        T.resize(N * 4, inf);
    }

    void upd(int v, int l, int r, int p, int val){
        if ( l == r ){
            T[v] = val;
            return;
        }
        int md = (l + r) >> 1;
        if ( p <= md ){
            upd(v * 2, l, md, p, val);
        } else{
            upd(v * 2 + 1, md + 1, r, p, val);
        }
        T[v] = min(T[v * 2], T[v * 2 + 1]);
    }

    void upd(int p, int val){
        upd(1, 0, n - 1, p, val);
    }

    int get(int v, int l, int r, int tl, int tr){
        if ( l > tr or r < tl ){
            return inf;
        }
        if ( tl <= l && tr >= r ){
            return T[v];
        }
        int md = (l + r) >> 1;
        return min(get(v * 2, l, md, tl, tr), get(v * 2 + 1, md + 1, r, tl, tr));
    }

    int get(int l, int r){
        return get(1, 0, n - 1, l, r);
    }
} seg;

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

    int m, k; cin >> n >> m >> k;
    vector <vector<ar<int,2>>> G(n);
    for ( int i = 0; i + 1 < n; i++ ){
        int u, v; cin >> u >> v;
        --u, --v;
        G[u].pb({v, i});
        G[v].pb({u, i});
    }
    vector <int> d(n), tin(n), tout(n), rev(n);
    vector <vector<int>> up(20, vector <int> (n));
    int ct = -1;
    auto dfs = [&](auto dfs, int u, int p) -> void{
        up[0][u] = p;
        for ( int i = 1; i < 20; i++ ){
            up[i][u] = up[i - 1][up[i - 1][u]];
        }
        tin[u] = ++ct;
        rev[tin[u]] = u;
        for ( auto &[v, j]: G[u] ){
            if ( v != p ){
                d[v] = d[u] + 1;
                dfs(dfs, v, u);
            }
        } tout[u] = ct;
    };
    dfs(dfs, 0, 0);
    auto lca = [&](int u, int v){
        if ( d[u] < d[v] ) swap(u, v);
        int df = d[u] - d[v];
        for ( int i = 0; i < 20; i++ ){
            if ( df >> i & 1 ){
                u = up[i][u];
            }
        }
        if ( u == v ){
            return u;
        }
        for ( int i = 19; i >= 0; i-- ){
            if ( up[i][u] != up[i][v] ){
                u = up[i][u];
                v = up[i][v];
            }
        }
        return up[0][u];
    };
    vector <int> cnt(n);
    auto rec = [&](auto rec, int u) -> void{
        seg.upd(tin[u], inf);
        while ( true ){
            int x = seg.get(tin[u], tout[u]);
            if ( x == inf ) break;
            x = rev[x];
            cnt[u]--, cnt[x]++;
            rec(rec, x);
        }
    };
    for ( int i = 0; i < m; i++ ){
        int s; cin >> s;
        vector <int> a(s);
        int p = -1;
        for ( auto &u: a ){
            cin >> u; --u;
            if ( p == -1 ){
                p = u;
            } else p = lca(u, p);
            seg.upd(tin[u], tin[u]);
        }
        sort(all(a), [&](int &u, int &v){
             return tin[u] < tin[v];
        });
        for ( int j = 1; j < s; j++ ){
            int p = lca(a[j - 1], a[j]);
            seg.upd(tin[p], tin[p]);
        }
        rec(rec, p);
    }
    vector <int> ans;
    auto dfs2 = [&](auto dfs2, int u, int p) -> void{
        for ( auto &[v, j]: G[u] ){
            if ( v != p ){
                dfs2(dfs2, v, u);
                if ( cnt[v] >= k ){
                    ans.pb(j);
                }
                cnt[u] += cnt[v];
            }
        }
    };
    dfs2(dfs2, 0, 0);
    sort(all(ans));
    cout << ans.size() << ln;
    for ( auto &u: ans ){
        cout << u + 1 << ' ';
    }

    cout << '\n';
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3420 KB Output is correct
2 Correct 5 ms 6308 KB Output is correct
3 Correct 6 ms 6232 KB Output is correct
4 Correct 2 ms 3420 KB Output is correct
5 Correct 2 ms 3576 KB Output is correct
6 Correct 7 ms 6492 KB Output is correct
7 Correct 6 ms 6236 KB Output is correct
8 Correct 5 ms 6236 KB Output is correct
9 Correct 5 ms 6236 KB Output is correct
10 Correct 2 ms 3416 KB Output is correct
11 Correct 1 ms 3420 KB Output is correct
12 Correct 2 ms 3420 KB Output is correct
13 Correct 1 ms 3416 KB Output is correct
14 Correct 2 ms 3420 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3420 KB Output is correct
2 Correct 5 ms 6308 KB Output is correct
3 Correct 6 ms 6232 KB Output is correct
4 Correct 2 ms 3420 KB Output is correct
5 Correct 2 ms 3576 KB Output is correct
6 Correct 7 ms 6492 KB Output is correct
7 Correct 6 ms 6236 KB Output is correct
8 Correct 5 ms 6236 KB Output is correct
9 Correct 5 ms 6236 KB Output is correct
10 Correct 2 ms 3416 KB Output is correct
11 Correct 1 ms 3420 KB Output is correct
12 Correct 2 ms 3420 KB Output is correct
13 Correct 1 ms 3416 KB Output is correct
14 Correct 2 ms 3420 KB Output is correct
15 Correct 55 ms 6296 KB Output is correct
16 Correct 55 ms 6232 KB Output is correct
17 Correct 61 ms 6232 KB Output is correct
18 Correct 7 ms 6492 KB Output is correct
19 Correct 6 ms 6236 KB Output is correct
20 Correct 47 ms 6268 KB Output is correct
21 Correct 73 ms 6260 KB Output is correct
22 Correct 2 ms 3420 KB Output is correct
23 Correct 8 ms 6172 KB Output is correct
24 Correct 6 ms 6240 KB Output is correct
25 Correct 2 ms 3420 KB Output is correct
26 Correct 1 ms 3420 KB Output is correct
27 Correct 6 ms 6532 KB Output is correct
28 Correct 7 ms 6400 KB Output is correct
29 Correct 5 ms 6236 KB Output is correct
30 Correct 8 ms 6236 KB Output is correct
31 Correct 1 ms 3420 KB Output is correct
32 Correct 1 ms 3420 KB Output is correct
33 Correct 2 ms 3416 KB Output is correct
34 Correct 2 ms 3420 KB Output is correct
35 Correct 2 ms 3420 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 169 ms 39040 KB Output is correct
2 Correct 1 ms 3600 KB Output is correct
3 Correct 214 ms 39532 KB Output is correct
4 Correct 177 ms 38412 KB Output is correct
5 Correct 256 ms 40636 KB Output is correct
6 Correct 193 ms 40896 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 129 ms 34128 KB Output is correct
2 Correct 143 ms 32672 KB Output is correct
3 Correct 156 ms 32352 KB Output is correct
4 Correct 144 ms 32612 KB Output is correct
5 Correct 174 ms 32356 KB Output is correct
6 Correct 129 ms 35912 KB Output is correct
7 Correct 122 ms 35688 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 129 ms 34128 KB Output is correct
2 Correct 143 ms 32672 KB Output is correct
3 Correct 156 ms 32352 KB Output is correct
4 Correct 144 ms 32612 KB Output is correct
5 Correct 174 ms 32356 KB Output is correct
6 Correct 129 ms 35912 KB Output is correct
7 Correct 122 ms 35688 KB Output is correct
8 Correct 205 ms 35780 KB Output is correct
9 Correct 213 ms 35916 KB Output is correct
10 Correct 168 ms 40772 KB Output is correct
11 Correct 185 ms 40708 KB Output is correct
12 Correct 177 ms 31628 KB Output is correct
13 Correct 170 ms 31680 KB Output is correct
14 Correct 180 ms 32416 KB Output is correct
15 Correct 187 ms 32228 KB Output is correct
16 Correct 151 ms 32496 KB Output is correct
17 Correct 181 ms 32496 KB Output is correct
18 Correct 130 ms 32240 KB Output is correct
19 Correct 141 ms 32808 KB Output is correct
20 Correct 155 ms 36200 KB Output is correct
21 Correct 133 ms 36672 KB Output is correct
22 Correct 132 ms 36276 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3420 KB Output is correct
2 Correct 5 ms 6308 KB Output is correct
3 Correct 6 ms 6232 KB Output is correct
4 Correct 2 ms 3420 KB Output is correct
5 Correct 2 ms 3576 KB Output is correct
6 Correct 7 ms 6492 KB Output is correct
7 Correct 6 ms 6236 KB Output is correct
8 Correct 5 ms 6236 KB Output is correct
9 Correct 5 ms 6236 KB Output is correct
10 Correct 2 ms 3416 KB Output is correct
11 Correct 1 ms 3420 KB Output is correct
12 Correct 2 ms 3420 KB Output is correct
13 Correct 1 ms 3416 KB Output is correct
14 Correct 2 ms 3420 KB Output is correct
15 Correct 55 ms 6296 KB Output is correct
16 Correct 55 ms 6232 KB Output is correct
17 Correct 61 ms 6232 KB Output is correct
18 Correct 7 ms 6492 KB Output is correct
19 Correct 6 ms 6236 KB Output is correct
20 Correct 47 ms 6268 KB Output is correct
21 Correct 73 ms 6260 KB Output is correct
22 Correct 2 ms 3420 KB Output is correct
23 Correct 8 ms 6172 KB Output is correct
24 Correct 6 ms 6240 KB Output is correct
25 Correct 2 ms 3420 KB Output is correct
26 Correct 1 ms 3420 KB Output is correct
27 Correct 6 ms 6532 KB Output is correct
28 Correct 7 ms 6400 KB Output is correct
29 Correct 5 ms 6236 KB Output is correct
30 Correct 8 ms 6236 KB Output is correct
31 Correct 1 ms 3420 KB Output is correct
32 Correct 1 ms 3420 KB Output is correct
33 Correct 2 ms 3416 KB Output is correct
34 Correct 2 ms 3420 KB Output is correct
35 Correct 2 ms 3420 KB Output is correct
36 Correct 169 ms 39040 KB Output is correct
37 Correct 1 ms 3600 KB Output is correct
38 Correct 214 ms 39532 KB Output is correct
39 Correct 177 ms 38412 KB Output is correct
40 Correct 256 ms 40636 KB Output is correct
41 Correct 193 ms 40896 KB Output is correct
42 Correct 129 ms 34128 KB Output is correct
43 Correct 143 ms 32672 KB Output is correct
44 Correct 156 ms 32352 KB Output is correct
45 Correct 144 ms 32612 KB Output is correct
46 Correct 174 ms 32356 KB Output is correct
47 Correct 129 ms 35912 KB Output is correct
48 Correct 122 ms 35688 KB Output is correct
49 Correct 205 ms 35780 KB Output is correct
50 Correct 213 ms 35916 KB Output is correct
51 Correct 168 ms 40772 KB Output is correct
52 Correct 185 ms 40708 KB Output is correct
53 Correct 177 ms 31628 KB Output is correct
54 Correct 170 ms 31680 KB Output is correct
55 Correct 180 ms 32416 KB Output is correct
56 Correct 187 ms 32228 KB Output is correct
57 Correct 151 ms 32496 KB Output is correct
58 Correct 181 ms 32496 KB Output is correct
59 Correct 130 ms 32240 KB Output is correct
60 Correct 141 ms 32808 KB Output is correct
61 Correct 155 ms 36200 KB Output is correct
62 Correct 133 ms 36672 KB Output is correct
63 Correct 132 ms 36276 KB Output is correct
64 Correct 163 ms 36176 KB Output is correct
65 Correct 225 ms 32744 KB Output is correct
66 Correct 275 ms 32420 KB Output is correct
67 Correct 201 ms 32348 KB Output is correct
68 Correct 149 ms 31588 KB Output is correct
69 Correct 156 ms 31396 KB Output is correct
70 Correct 177 ms 36680 KB Output is correct
71 Correct 214 ms 35788 KB Output is correct
72 Correct 1 ms 3416 KB Output is correct
73 Correct 6 ms 6236 KB Output is correct
74 Correct 6 ms 6236 KB Output is correct
75 Correct 2 ms 3420 KB Output is correct
76 Correct 2 ms 3420 KB Output is correct
77 Correct 7 ms 6744 KB Output is correct
78 Correct 6 ms 6492 KB Output is correct
79 Correct 7 ms 6236 KB Output is correct
80 Correct 6 ms 6172 KB Output is correct
81 Correct 1 ms 3420 KB Output is correct
82 Correct 1 ms 3600 KB Output is correct
83 Correct 2 ms 3596 KB Output is correct
84 Correct 2 ms 3420 KB Output is correct
85 Correct 1 ms 3416 KB Output is correct
86 Correct 52 ms 6672 KB Output is correct
87 Correct 53 ms 6748 KB Output is correct
88 Correct 54 ms 6676 KB Output is correct
89 Correct 8 ms 6744 KB Output is correct
90 Correct 6 ms 6488 KB Output is correct
91 Correct 50 ms 6800 KB Output is correct
92 Correct 55 ms 6812 KB Output is correct
93 Correct 1 ms 3416 KB Output is correct
94 Correct 164 ms 40512 KB Output is correct
95 Correct 163 ms 39488 KB Output is correct
96 Correct 154 ms 38396 KB Output is correct
97 Correct 241 ms 40440 KB Output is correct
98 Correct 189 ms 41208 KB Output is correct
99 Correct 155 ms 32460 KB Output is correct
100 Correct 148 ms 32476 KB Output is correct
101 Correct 148 ms 32496 KB Output is correct
102 Correct 153 ms 32804 KB Output is correct
103 Correct 132 ms 35860 KB Output is correct
104 Correct 127 ms 36416 KB Output is correct
105 Correct 135 ms 35912 KB Output is correct
106 Correct 185 ms 36092 KB Output is correct
107 Correct 207 ms 35772 KB Output is correct
108 Correct 184 ms 40908 KB Output is correct
109 Correct 196 ms 40568 KB Output is correct
110 Correct 165 ms 31676 KB Output is correct
111 Correct 173 ms 31680 KB Output is correct
112 Correct 187 ms 32256 KB Output is correct
113 Correct 179 ms 32612 KB Output is correct