oj.uz

Submission #502225

# Submission time Handle Problem Language Result Execution time Memory
502225 2022-01-05T14:38:54 Z Lobo Railway (BOI17_railway) C++17
100 / 100
 150 ms 29432 KB 
#include<bits/stdc++.h>
using namespace std;

/*for ordered_set
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<pair<int,int>, null_type,less<pair<int,int>>, rb_tree_tag,tree_order_statistics_node_update>
*/

const long long INFll = (long long) 1e18 + 10;
const int INFii = (int) 1e9 + 10;
typedef long long ll;
typedef int ii;
typedef long double dbl;
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()

#define maxn 110000

ii n, m, k, cnt[maxn], p[maxn][25], ps[maxn], h[maxn];
vector<pair<ii,ii>> edg, g[maxn];
ii tin[maxn], timer = 1;

ii lca(ii u, ii v) {
    if(h[u] < h[v]) swap(u,v);

    for(ii i = 20; i >= 0; i--) {
        if(h[p[u][i]] >= h[v]) {
            u = p[u][i];
        }
    }

    if(u == v) {
        return u;
    }

    for(ii i = 20; i >= 0; i--) {
        if(p[u][i] != p[v][i]) {
            u = p[u][i];
            v = p[v][i];
        }
    }

    return p[u][0];
}


void dfslca(ii u, ii ant, ii id) {
    //.fr = pai .sc = filho
    if(u != 1 && edg[id].fr == u) swap(edg[id].fr,edg[id].sc);
    tin[u] = timer++;

    p[u][0] = ant;
    for(ii i = 1; i <= 20; i++) {
        p[u][i] = p[p[u][i-1]][i-1];
    }

    for(auto V : g[u]) {
        ii v = V.fr;
        ii id1 = V.sc;
        if(v == ant) continue;
        h[v] = h[u]+1;
        
        dfslca(v,u,id1);
    }
}

void dfsps(ii u, ii ant) {
    for(auto V : g[u]) {
        ii v = V.fr;
        if(v == ant) continue;
        
        dfsps(v,u);
        ps[u]+= ps[v];
    }
}

void solve() {
    cin >> n >> m >> k;

    for(ii i = 0; i < n-1; i++) {
        ii a, b;
        cin >> a >> b;

        g[a].pb(mp(b,i));
        g[b].pb(mp(a,i));
        edg.pb(mp(a,b));
    }

    h[1] = 0;
    dfslca(1,1,0);

    while(m--) {
        ii s; cin >> s;
        vector<pair<ii,ii>> vert;
        for(ii i = 0; i < s; i++) {
            ii u; cin >> u;
            vert.pb(mp(tin[u],u));
        }

        sort(all(vert));

        for(ii i = 0; i < s; i++) {
            ii u = vert[i].sc;
            ii v = vert[(i+1)%s].sc;
            ii lc = lca(u,v);

            ps[u]++;
            ps[v]++;
            ps[lc]-= 2;
        }

          
    }

    dfsps(1,1);
    for(ii i = 0; i < n-1; i++) {
        ii v = edg[i].sc;
        cnt[i] = ps[v]/2;
    }

    

    vector<ii> ans;
    for(ii i = 0; i < n-1; i++) {
        if(cnt[i] >= k) ans.pb(i+1);
    }

    cout << ans.size() << endl;
    for(auto x : ans) cout << x << " ";
    cout << endl;

}

int main() {
    ios::sync_with_stdio(false); cin.tie(0);

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

    ii tt = 1;
    // cin >> tt;
    while(tt--) solve();

}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2892 KB Output is correct
2 Correct 7 ms 4428 KB Output is correct
3 Correct 6 ms 4428 KB Output is correct
4 Correct 2 ms 2892 KB Output is correct
5 Correct 2 ms 2892 KB Output is correct
6 Correct 7 ms 4940 KB Output is correct
7 Correct 6 ms 4556 KB Output is correct
8 Correct 5 ms 4556 KB Output is correct
9 Correct 6 ms 4548 KB Output is correct
10 Correct 2 ms 2892 KB Output is correct
11 Correct 2 ms 2892 KB Output is correct
12 Correct 2 ms 2892 KB Output is correct
13 Correct 2 ms 2892 KB Output is correct
14 Correct 1 ms 2892 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2892 KB Output is correct
2 Correct 7 ms 4428 KB Output is correct
3 Correct 6 ms 4428 KB Output is correct
4 Correct 2 ms 2892 KB Output is correct
5 Correct 2 ms 2892 KB Output is correct
6 Correct 7 ms 4940 KB Output is correct
7 Correct 6 ms 4556 KB Output is correct
8 Correct 5 ms 4556 KB Output is correct
9 Correct 6 ms 4548 KB Output is correct
10 Correct 2 ms 2892 KB Output is correct
11 Correct 2 ms 2892 KB Output is correct
12 Correct 2 ms 2892 KB Output is correct
13 Correct 2 ms 2892 KB Output is correct
14 Correct 1 ms 2892 KB Output is correct
15 Correct 30 ms 4476 KB Output is correct
16 Correct 39 ms 4484 KB Output is correct
17 Correct 30 ms 4548 KB Output is correct
18 Correct 7 ms 4940 KB Output is correct
19 Correct 6 ms 4608 KB Output is correct
20 Correct 36 ms 4580 KB Output is correct
21 Correct 33 ms 4512 KB Output is correct
22 Correct 2 ms 2892 KB Output is correct
23 Correct 6 ms 4448 KB Output is correct
24 Correct 6 ms 4428 KB Output is correct
25 Correct 2 ms 2892 KB Output is correct
26 Correct 1 ms 2892 KB Output is correct
27 Correct 8 ms 4940 KB Output is correct
28 Correct 10 ms 4556 KB Output is correct
29 Correct 6 ms 4556 KB Output is correct
30 Correct 8 ms 4528 KB Output is correct
31 Correct 2 ms 2892 KB Output is correct
32 Correct 2 ms 2892 KB Output is correct
33 Correct 2 ms 2892 KB Output is correct
34 Correct 2 ms 2892 KB Output is correct
35 Correct 2 ms 2812 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 117 ms 27252 KB Output is correct
2 Correct 2 ms 2892 KB Output is correct
3 Correct 105 ms 26600 KB Output is correct
4 Correct 127 ms 25968 KB Output is correct
5 Correct 150 ms 27348 KB Output is correct
6 Correct 122 ms 27376 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 22484 KB Output is correct
2 Correct 101 ms 19080 KB Output is correct
3 Correct 112 ms 18784 KB Output is correct
4 Correct 105 ms 18724 KB Output is correct
5 Correct 98 ms 18764 KB Output is correct
6 Correct 83 ms 22708 KB Output is correct
7 Correct 84 ms 22608 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 22484 KB Output is correct
2 Correct 101 ms 19080 KB Output is correct
3 Correct 112 ms 18784 KB Output is correct
4 Correct 105 ms 18724 KB Output is correct
5 Correct 98 ms 18764 KB Output is correct
6 Correct 83 ms 22708 KB Output is correct
7 Correct 84 ms 22608 KB Output is correct
8 Correct 96 ms 22664 KB Output is correct
9 Correct 100 ms 24536 KB Output is correct
10 Correct 101 ms 29132 KB Output is correct
11 Correct 103 ms 29040 KB Output is correct
12 Correct 78 ms 20272 KB Output is correct
13 Correct 94 ms 20280 KB Output is correct
14 Correct 108 ms 20476 KB Output is correct
15 Correct 102 ms 20408 KB Output is correct
16 Correct 105 ms 20536 KB Output is correct
17 Correct 107 ms 20528 KB Output is correct
18 Correct 102 ms 20460 KB Output is correct
19 Correct 100 ms 20880 KB Output is correct
20 Correct 89 ms 24700 KB Output is correct
21 Correct 92 ms 24908 KB Output is correct
22 Correct 86 ms 24760 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2892 KB Output is correct
2 Correct 7 ms 4428 KB Output is correct
3 Correct 6 ms 4428 KB Output is correct
4 Correct 2 ms 2892 KB Output is correct
5 Correct 2 ms 2892 KB Output is correct
6 Correct 7 ms 4940 KB Output is correct
7 Correct 6 ms 4556 KB Output is correct
8 Correct 5 ms 4556 KB Output is correct
9 Correct 6 ms 4548 KB Output is correct
10 Correct 2 ms 2892 KB Output is correct
11 Correct 2 ms 2892 KB Output is correct
12 Correct 2 ms 2892 KB Output is correct
13 Correct 2 ms 2892 KB Output is correct
14 Correct 1 ms 2892 KB Output is correct
15 Correct 30 ms 4476 KB Output is correct
16 Correct 39 ms 4484 KB Output is correct
17 Correct 30 ms 4548 KB Output is correct
18 Correct 7 ms 4940 KB Output is correct
19 Correct 6 ms 4608 KB Output is correct
20 Correct 36 ms 4580 KB Output is correct
21 Correct 33 ms 4512 KB Output is correct
22 Correct 2 ms 2892 KB Output is correct
23 Correct 6 ms 4448 KB Output is correct
24 Correct 6 ms 4428 KB Output is correct
25 Correct 2 ms 2892 KB Output is correct
26 Correct 1 ms 2892 KB Output is correct
27 Correct 8 ms 4940 KB Output is correct
28 Correct 10 ms 4556 KB Output is correct
29 Correct 6 ms 4556 KB Output is correct
30 Correct 8 ms 4528 KB Output is correct
31 Correct 2 ms 2892 KB Output is correct
32 Correct 2 ms 2892 KB Output is correct
33 Correct 2 ms 2892 KB Output is correct
34 Correct 2 ms 2892 KB Output is correct
35 Correct 2 ms 2812 KB Output is correct
36 Correct 117 ms 27252 KB Output is correct
37 Correct 2 ms 2892 KB Output is correct
38 Correct 105 ms 26600 KB Output is correct
39 Correct 127 ms 25968 KB Output is correct
40 Correct 150 ms 27348 KB Output is correct
41 Correct 122 ms 27376 KB Output is correct
42 Correct 84 ms 22484 KB Output is correct
43 Correct 101 ms 19080 KB Output is correct
44 Correct 112 ms 18784 KB Output is correct
45 Correct 105 ms 18724 KB Output is correct
46 Correct 98 ms 18764 KB Output is correct
47 Correct 83 ms 22708 KB Output is correct
48 Correct 84 ms 22608 KB Output is correct
49 Correct 96 ms 22664 KB Output is correct
50 Correct 100 ms 24536 KB Output is correct
51 Correct 101 ms 29132 KB Output is correct
52 Correct 103 ms 29040 KB Output is correct
53 Correct 78 ms 20272 KB Output is correct
54 Correct 94 ms 20280 KB Output is correct
55 Correct 108 ms 20476 KB Output is correct
56 Correct 102 ms 20408 KB Output is correct
57 Correct 105 ms 20536 KB Output is correct
58 Correct 107 ms 20528 KB Output is correct
59 Correct 102 ms 20460 KB Output is correct
60 Correct 100 ms 20880 KB Output is correct
61 Correct 89 ms 24700 KB Output is correct
62 Correct 92 ms 24908 KB Output is correct
63 Correct 86 ms 24760 KB Output is correct
64 Correct 106 ms 24796 KB Output is correct
65 Correct 124 ms 20668 KB Output is correct
66 Correct 110 ms 20440 KB Output is correct
67 Correct 117 ms 20532 KB Output is correct
68 Correct 80 ms 20268 KB Output is correct
69 Correct 73 ms 20268 KB Output is correct
70 Correct 110 ms 25192 KB Output is correct
71 Correct 104 ms 24280 KB Output is correct
72 Correct 2 ms 2912 KB Output is correct
73 Correct 7 ms 4552 KB Output is correct
74 Correct 7 ms 4548 KB Output is correct
75 Correct 2 ms 2892 KB Output is correct
76 Correct 2 ms 2896 KB Output is correct
77 Correct 6 ms 4976 KB Output is correct
78 Correct 7 ms 4684 KB Output is correct
79 Correct 6 ms 4556 KB Output is correct
80 Correct 6 ms 4556 KB Output is correct
81 Correct 2 ms 2892 KB Output is correct
82 Correct 2 ms 2892 KB Output is correct
83 Correct 2 ms 2908 KB Output is correct
84 Correct 2 ms 2892 KB Output is correct
85 Correct 2 ms 2892 KB Output is correct
86 Correct 29 ms 4956 KB Output is correct
87 Correct 28 ms 4984 KB Output is correct
88 Correct 31 ms 4952 KB Output is correct
89 Correct 7 ms 4992 KB Output is correct
90 Correct 9 ms 4684 KB Output is correct
91 Correct 33 ms 5112 KB Output is correct
92 Correct 40 ms 5000 KB Output is correct
93 Correct 2 ms 2908 KB Output is correct
94 Correct 107 ms 29024 KB Output is correct
95 Correct 111 ms 28464 KB Output is correct
96 Correct 149 ms 27728 KB Output is correct
97 Correct 122 ms 29020 KB Output is correct
98 Correct 114 ms 29432 KB Output is correct
99 Correct 108 ms 20520 KB Output is correct
100 Correct 112 ms 20572 KB Output is correct
101 Correct 109 ms 20540 KB Output is correct
102 Correct 112 ms 20928 KB Output is correct
103 Correct 108 ms 24428 KB Output is correct
104 Correct 97 ms 24908 KB Output is correct
105 Correct 86 ms 24328 KB Output is correct
106 Correct 122 ms 24660 KB Output is correct
107 Correct 103 ms 24440 KB Output is correct
108 Correct 103 ms 29108 KB Output is correct
109 Correct 102 ms 29144 KB Output is correct
110 Correct 83 ms 20256 KB Output is correct
111 Correct 93 ms 20444 KB Output is correct
112 Correct 109 ms 20488 KB Output is correct
113 Correct 100 ms 20412 KB Output is correct