oj.uz

Submission #647861

# Submission time Handle Problem Language Result Execution time Memory
647861 2022-10-04T09:16:29 Z mychecksedad Railway (BOI17_railway) C++17
100 / 100
 135 ms 48764 KB 
/* Author : Mychecksdead */
#include<bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef long double ld;
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define PI 3.1415926535
#define pb push_back
#define setp() cout << setprecision(15)
#define all(x) x.begin(), x.end()
#define oset tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
#define debug(x) cerr << #x << " is " << x << '\n';
const int N = 1e6+100, M = 1e5+10, F = 2147483646, K = 20;




int n, m, k, co[N], up[N][K], timer = 0, in[N], out[N];
vector<pair<int, int>> g[N];
vector<int> qq(N);
void pre(int v, int p){
    in[v] = timer++;
    up[v][0] = p;
    for(auto u: g[v]){
        if(u.first != p){
            pre(u.first, v);
        }
    }
    out[v] = timer++;
}
bool is_ancestor(int u, int v){
    return in[u] <= in[v] && out[v] <= out[u]; 
}
int lca(int u, int v){
    if(is_ancestor(u, v)) return u;
    if(is_ancestor(v, u)) return v;
    for(int j = K - 1; j >= 0; --j){
        if(!is_ancestor(up[u][j], v)) u = up[u][j];
    }
    return up[u][0];
}
void dfs(int v, int p, int e){
    for(auto u: g[v]){
        if(u.first != p){
            dfs(u.first, v, u.second);
            qq[v] += qq[u.first];
        }
    }
    co[e] = qq[v];
}
void solve(){
    cin >> n >> m >> k;
    for(int i = 0; i < n - 1; ++i){
        int u, v; cin >> u >> v;
        g[u].pb({v, i});
        g[v].pb({u, i});
        co[i] = 0;
    }
    pre(1, 1);
    for(int j = 1; j < K; ++j){
        for(int i = 1; i <= n; ++i) up[i][j] = up[up[i][j - 1]][j - 1];
    }
    for(int i = 0; i < m; ++i){
        int c; cin >> c;
        vector<int> v;
        for(int j = 0; j < c; ++j){
            int x; cin >> x; v.pb(x);
        }
        sort(all(v), [&](const int &a, const int &b){
            return in[a] < in[b];
        });
        for(int j = 0; j < c; ++j){
            int s = v[j], e = v[(j+1)%c];
            int lc = lca(s, e);
            qq[lc] -= 2;
            qq[s]++, qq[e]++;
        }
    }
    dfs(1, 1, n);

    vector<int> ans;
    for(int i = 0; i < n - 1; ++i) if(co[i] >= 2*k) ans.pb(i + 1);
    cout << ans.size() << '\n';
    for(int p: ans) cout << p << ' ';
}





int main(){
    cin.tie(0); ios::sync_with_stdio(0);
    int T = 1, aa;
    // cin >> T;aa=T;
    while(T--){
        // cout << "Case #" << aa-T << ": ";
        solve();
        cout << '\n';
    }
    return 0;
 
}

Compilation message

railway.cpp: In function 'int main()':
railway.cpp:96:16: warning: unused variable 'aa' [-Wunused-variable]
   96 |     int T = 1, aa;
      |                ^~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 27732 KB Output is correct
2 Correct 22 ms 29040 KB Output is correct
3 Correct 19 ms 28980 KB Output is correct
4 Correct 15 ms 27680 KB Output is correct
5 Correct 17 ms 27732 KB Output is correct
6 Correct 18 ms 29396 KB Output is correct
7 Correct 18 ms 29084 KB Output is correct
8 Correct 17 ms 29012 KB Output is correct
9 Correct 19 ms 29024 KB Output is correct
10 Correct 15 ms 27732 KB Output is correct
11 Correct 14 ms 27732 KB Output is correct
12 Correct 15 ms 27732 KB Output is correct
13 Correct 15 ms 27732 KB Output is correct
14 Correct 16 ms 27732 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 27732 KB Output is correct
2 Correct 22 ms 29040 KB Output is correct
3 Correct 19 ms 28980 KB Output is correct
4 Correct 15 ms 27680 KB Output is correct
5 Correct 17 ms 27732 KB Output is correct
6 Correct 18 ms 29396 KB Output is correct
7 Correct 18 ms 29084 KB Output is correct
8 Correct 17 ms 29012 KB Output is correct
9 Correct 19 ms 29024 KB Output is correct
10 Correct 15 ms 27732 KB Output is correct
11 Correct 14 ms 27732 KB Output is correct
12 Correct 15 ms 27732 KB Output is correct
13 Correct 15 ms 27732 KB Output is correct
14 Correct 16 ms 27732 KB Output is correct
15 Correct 34 ms 29056 KB Output is correct
16 Correct 36 ms 29040 KB Output is correct
17 Correct 42 ms 29032 KB Output is correct
18 Correct 18 ms 29452 KB Output is correct
19 Correct 22 ms 29008 KB Output is correct
20 Correct 47 ms 29064 KB Output is correct
21 Correct 45 ms 29012 KB Output is correct
22 Correct 16 ms 27732 KB Output is correct
23 Correct 19 ms 29012 KB Output is correct
24 Correct 19 ms 29028 KB Output is correct
25 Correct 15 ms 27732 KB Output is correct
26 Correct 14 ms 27732 KB Output is correct
27 Correct 22 ms 29480 KB Output is correct
28 Correct 20 ms 29096 KB Output is correct
29 Correct 19 ms 28996 KB Output is correct
30 Correct 23 ms 29004 KB Output is correct
31 Correct 14 ms 27668 KB Output is correct
32 Correct 14 ms 27680 KB Output is correct
33 Correct 15 ms 27732 KB Output is correct
34 Correct 14 ms 27656 KB Output is correct
35 Correct 15 ms 27732 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 48544 KB Output is correct
2 Correct 15 ms 27732 KB Output is correct
3 Correct 80 ms 48256 KB Output is correct
4 Correct 67 ms 47636 KB Output is correct
5 Correct 75 ms 48628 KB Output is correct
6 Correct 79 ms 48720 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 44228 KB Output is correct
2 Correct 97 ms 40788 KB Output is correct
3 Correct 100 ms 40480 KB Output is correct
4 Correct 113 ms 40432 KB Output is correct
5 Correct 121 ms 40444 KB Output is correct
6 Correct 81 ms 44416 KB Output is correct
7 Correct 79 ms 44240 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 44228 KB Output is correct
2 Correct 97 ms 40788 KB Output is correct
3 Correct 100 ms 40480 KB Output is correct
4 Correct 113 ms 40432 KB Output is correct
5 Correct 121 ms 40444 KB Output is correct
6 Correct 81 ms 44416 KB Output is correct
7 Correct 79 ms 44240 KB Output is correct
8 Correct 106 ms 44364 KB Output is correct
9 Correct 99 ms 44368 KB Output is correct
10 Correct 94 ms 48708 KB Output is correct
11 Correct 77 ms 48656 KB Output is correct
12 Correct 90 ms 40772 KB Output is correct
13 Correct 82 ms 40700 KB Output is correct
14 Correct 118 ms 40384 KB Output is correct
15 Correct 101 ms 40480 KB Output is correct
16 Correct 111 ms 40388 KB Output is correct
17 Correct 114 ms 40424 KB Output is correct
18 Correct 111 ms 40396 KB Output is correct
19 Correct 121 ms 40840 KB Output is correct
20 Correct 107 ms 44552 KB Output is correct
21 Correct 87 ms 44776 KB Output is correct
22 Correct 88 ms 44620 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 27732 KB Output is correct
2 Correct 22 ms 29040 KB Output is correct
3 Correct 19 ms 28980 KB Output is correct
4 Correct 15 ms 27680 KB Output is correct
5 Correct 17 ms 27732 KB Output is correct
6 Correct 18 ms 29396 KB Output is correct
7 Correct 18 ms 29084 KB Output is correct
8 Correct 17 ms 29012 KB Output is correct
9 Correct 19 ms 29024 KB Output is correct
10 Correct 15 ms 27732 KB Output is correct
11 Correct 14 ms 27732 KB Output is correct
12 Correct 15 ms 27732 KB Output is correct
13 Correct 15 ms 27732 KB Output is correct
14 Correct 16 ms 27732 KB Output is correct
15 Correct 34 ms 29056 KB Output is correct
16 Correct 36 ms 29040 KB Output is correct
17 Correct 42 ms 29032 KB Output is correct
18 Correct 18 ms 29452 KB Output is correct
19 Correct 22 ms 29008 KB Output is correct
20 Correct 47 ms 29064 KB Output is correct
21 Correct 45 ms 29012 KB Output is correct
22 Correct 16 ms 27732 KB Output is correct
23 Correct 19 ms 29012 KB Output is correct
24 Correct 19 ms 29028 KB Output is correct
25 Correct 15 ms 27732 KB Output is correct
26 Correct 14 ms 27732 KB Output is correct
27 Correct 22 ms 29480 KB Output is correct
28 Correct 20 ms 29096 KB Output is correct
29 Correct 19 ms 28996 KB Output is correct
30 Correct 23 ms 29004 KB Output is correct
31 Correct 14 ms 27668 KB Output is correct
32 Correct 14 ms 27680 KB Output is correct
33 Correct 15 ms 27732 KB Output is correct
34 Correct 14 ms 27656 KB Output is correct
35 Correct 15 ms 27732 KB Output is correct
36 Correct 79 ms 48544 KB Output is correct
37 Correct 15 ms 27732 KB Output is correct
38 Correct 80 ms 48256 KB Output is correct
39 Correct 67 ms 47636 KB Output is correct
40 Correct 75 ms 48628 KB Output is correct
41 Correct 79 ms 48720 KB Output is correct
42 Correct 90 ms 44228 KB Output is correct
43 Correct 97 ms 40788 KB Output is correct
44 Correct 100 ms 40480 KB Output is correct
45 Correct 113 ms 40432 KB Output is correct
46 Correct 121 ms 40444 KB Output is correct
47 Correct 81 ms 44416 KB Output is correct
48 Correct 79 ms 44240 KB Output is correct
49 Correct 106 ms 44364 KB Output is correct
50 Correct 99 ms 44368 KB Output is correct
51 Correct 94 ms 48708 KB Output is correct
52 Correct 77 ms 48656 KB Output is correct
53 Correct 90 ms 40772 KB Output is correct
54 Correct 82 ms 40700 KB Output is correct
55 Correct 118 ms 40384 KB Output is correct
56 Correct 101 ms 40480 KB Output is correct
57 Correct 111 ms 40388 KB Output is correct
58 Correct 114 ms 40424 KB Output is correct
59 Correct 111 ms 40396 KB Output is correct
60 Correct 121 ms 40840 KB Output is correct
61 Correct 107 ms 44552 KB Output is correct
62 Correct 87 ms 44776 KB Output is correct
63 Correct 88 ms 44620 KB Output is correct
64 Correct 94 ms 44496 KB Output is correct
65 Correct 126 ms 40432 KB Output is correct
66 Correct 135 ms 40484 KB Output is correct
67 Correct 120 ms 40428 KB Output is correct
68 Correct 78 ms 40780 KB Output is correct
69 Correct 89 ms 40652 KB Output is correct
70 Correct 107 ms 44872 KB Output is correct
71 Correct 93 ms 44236 KB Output is correct
72 Correct 14 ms 27732 KB Output is correct
73 Correct 19 ms 29012 KB Output is correct
74 Correct 19 ms 29012 KB Output is correct
75 Correct 15 ms 27740 KB Output is correct
76 Correct 16 ms 27732 KB Output is correct
77 Correct 19 ms 29416 KB Output is correct
78 Correct 24 ms 29084 KB Output is correct
79 Correct 18 ms 29012 KB Output is correct
80 Correct 19 ms 29012 KB Output is correct
81 Correct 15 ms 27732 KB Output is correct
82 Correct 14 ms 27732 KB Output is correct
83 Correct 14 ms 27732 KB Output is correct
84 Correct 15 ms 27732 KB Output is correct
85 Correct 14 ms 27732 KB Output is correct
86 Correct 35 ms 29012 KB Output is correct
87 Correct 35 ms 29028 KB Output is correct
88 Correct 38 ms 29036 KB Output is correct
89 Correct 19 ms 29396 KB Output is correct
90 Correct 18 ms 29012 KB Output is correct
91 Correct 42 ms 29064 KB Output is correct
92 Correct 42 ms 29012 KB Output is correct
93 Correct 15 ms 27748 KB Output is correct
94 Correct 106 ms 48532 KB Output is correct
95 Correct 92 ms 48200 KB Output is correct
96 Correct 74 ms 47640 KB Output is correct
97 Correct 72 ms 48580 KB Output is correct
98 Correct 89 ms 48764 KB Output is correct
99 Correct 121 ms 40452 KB Output is correct
100 Correct 100 ms 40388 KB Output is correct
101 Correct 100 ms 40396 KB Output is correct
102 Correct 100 ms 40848 KB Output is correct
103 Correct 83 ms 44284 KB Output is correct
104 Correct 96 ms 44620 KB Output is correct
105 Correct 81 ms 44216 KB Output is correct
106 Correct 99 ms 44600 KB Output is correct
107 Correct 103 ms 44372 KB Output is correct
108 Correct 74 ms 48708 KB Output is correct
109 Correct 87 ms 48716 KB Output is correct
110 Correct 94 ms 40656 KB Output is correct
111 Correct 90 ms 40696 KB Output is correct
112 Correct 109 ms 40372 KB Output is correct
113 Correct 105 ms 40496 KB Output is correct