oj.uz

Submission #940071

# Submission time Handle Problem Language Result Execution time Memory
940071 2024-03-07T05:03:06 Z phoenix0423 Railway (BOI17_railway) C++17
100 / 100
 266 ms 46412 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define fastio ios::sync_with_stdio(false), cin.tie(0)
#define pb push_back
#define eb emplace_back
#define f first
#define s second
#define int long long
const int maxn = 2e5 + 5;
int n, m, k;
int succ[maxn][18], dep[maxn];
int sz[maxn], head[maxn], in[maxn], dfn = 0;
vector<pll> adj[maxn];
vector<int> ans;

void dfs(int pos, int prev){
    sz[pos] = 1;
    succ[pos][0] = prev;
    for(int i = 1; i < 18; i++) succ[pos][i] = succ[succ[pos][i - 1]][i - 1];
    for(auto &k : adj[pos]){
        int x, id;
        tie(x, id) = k;
        if(x == prev) continue;
        adj[x].erase(find(adj[x].begin(), adj[x].end(), pll(pos, id)));
        dep[x] = dep[pos] + 1;
        dfs(x, pos);
        sz[pos] += sz[x];
        if(sz[x] > sz[adj[pos][0].f]) swap(k, adj[pos][0]);
    }
}

void decompose(int pos, int h){
    head[pos] = h;
    in[pos] = ++dfn;
    for(auto [x, id] : adj[pos]){
        if(pll(x, id) == adj[pos][0]) decompose(x, h);
        else decompose(x, x);
    }
}

int lift(int b, int s){
    for(int i = 17; i >= 0; i--){
        if(s & (1 << i)) b = succ[b][i];
    }
    return b;
}
int find_lca(int a, int b){
    if(dep[a] > dep[b]) swap(a, b);
    b = lift(b, dep[b] - dep[a]);
    if(a == b) return a;
    for(int i = 17; i >= 0; i--){
        if(succ[a][i] != succ[b][i]) a = succ[a][i], b = succ[b][i];
    }
    return succ[a][0];
}

int st[maxn * 4];
void push(int v){
    st[v * 2] += st[v], st[v * 2 + 1] += st[v], st[v] = 0;
}
void upd(int l, int r, int val, int v = 1, int L = 0, int R = n){
    if(l > R || r < L) return;
    if(l <= L && r >= R){
        st[v] += val;
        return;
    }
    push(v);
    int m = (L + R) / 2;
    upd(l, r, val, v * 2, L, m);
    upd(l, r, val, v * 2 + 1, m + 1, R);
}

int qry(int pos, int v = 1, int l = 0, int r = n){
    if(l == r) return st[v];
    push(v);
    int m = (l + r) / 2;
    if(pos <= m) return qry(pos, v * 2, l, m);
    else return qry(pos, v * 2 + 1, m + 1, r);
}
void path_aggregate(int a, int b, int val){
    // dep[a] < dep[b], lca(a, b) = a
    while(head[b] != head[a]){
        upd(in[head[b]], in[b], val);
        b = succ[head[b]][0];
    }
    upd(in[a], in[b], val);
}

void dfs2(int pos, int id = -1){
    if(id != -1){
        if(qry(in[pos]) >= k) ans.pb(id);
    }
    for(auto [x, id] : adj[pos]){
        dfs2(x, id);
    }
}
signed main(void){
    // fastio;
    cin>>n>>m>>k;
    for(int i = 0; i < n - 1; i++){
        int a, b;
        cin>>a>>b;
        a--, b--;
        adj[a].eb(b, i), adj[b].eb(a, i);
    }
    dfs(0, 0);
    decompose(0, 0);
    for(int i = 0; i < m; i++){
        int d;
        cin>>d;
        vector<int> a(d);
        for(int j = 0; j < d; j++) cin>>a[j], a[j] --;
        sort(a.begin(), a.end(), [&](int x, int y){ return in[x] < in[y];});
        a.erase(unique(a.begin(), a.end()), a.end());
        if(d < 2) continue;
        int glca = find_lca(a[0], a[1]);
        for(int j = 2; j < d; j++) glca = find_lca(glca, a[j]);
        int prev = glca;
        for(int j = 0; j < d; j++){
            int lca = find_lca(prev, a[j]);
            path_aggregate(glca, a[j], 1);
            path_aggregate(glca, lca, -1);
            prev = a[j];
        }
        
    }
    dfs2(0, -1);
    sort(ans.begin(), ans.end());
    cout<<ans.size()<<"\n";
    for(auto x : ans) cout<<x + 1<<" ";
    cout<<"\n";
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12632 KB Output is correct
2 Correct 12 ms 15560 KB Output is correct
3 Correct 10 ms 15452 KB Output is correct
4 Correct 3 ms 12748 KB Output is correct
5 Correct 3 ms 12636 KB Output is correct
6 Correct 12 ms 16176 KB Output is correct
7 Correct 11 ms 15580 KB Output is correct
8 Correct 12 ms 15536 KB Output is correct
9 Correct 12 ms 15452 KB Output is correct
10 Correct 3 ms 12640 KB Output is correct
11 Correct 3 ms 12636 KB Output is correct
12 Correct 3 ms 12644 KB Output is correct
13 Correct 2 ms 12640 KB Output is correct
14 Correct 2 ms 12636 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12632 KB Output is correct
2 Correct 12 ms 15560 KB Output is correct
3 Correct 10 ms 15452 KB Output is correct
4 Correct 3 ms 12748 KB Output is correct
5 Correct 3 ms 12636 KB Output is correct
6 Correct 12 ms 16176 KB Output is correct
7 Correct 11 ms 15580 KB Output is correct
8 Correct 12 ms 15536 KB Output is correct
9 Correct 12 ms 15452 KB Output is correct
10 Correct 3 ms 12640 KB Output is correct
11 Correct 3 ms 12636 KB Output is correct
12 Correct 3 ms 12644 KB Output is correct
13 Correct 2 ms 12640 KB Output is correct
14 Correct 2 ms 12636 KB Output is correct
15 Correct 89 ms 15964 KB Output is correct
16 Correct 89 ms 16024 KB Output is correct
17 Correct 87 ms 15956 KB Output is correct
18 Correct 12 ms 16076 KB Output is correct
19 Correct 11 ms 15712 KB Output is correct
20 Correct 71 ms 16164 KB Output is correct
21 Correct 73 ms 16092 KB Output is correct
22 Correct 2 ms 12648 KB Output is correct
23 Correct 11 ms 15696 KB Output is correct
24 Correct 11 ms 15684 KB Output is correct
25 Correct 2 ms 12644 KB Output is correct
26 Correct 2 ms 12784 KB Output is correct
27 Correct 13 ms 15968 KB Output is correct
28 Correct 11 ms 15708 KB Output is correct
29 Correct 9 ms 15452 KB Output is correct
30 Correct 10 ms 15452 KB Output is correct
31 Correct 3 ms 13076 KB Output is correct
32 Correct 2 ms 12728 KB Output is correct
33 Correct 2 ms 12636 KB Output is correct
34 Correct 2 ms 12636 KB Output is correct
35 Correct 2 ms 12736 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 211 ms 45948 KB Output is correct
2 Correct 3 ms 12888 KB Output is correct
3 Correct 211 ms 45436 KB Output is correct
4 Correct 189 ms 44644 KB Output is correct
5 Correct 245 ms 45772 KB Output is correct
6 Correct 200 ms 46288 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 172 ms 41044 KB Output is correct
2 Correct 188 ms 37716 KB Output is correct
3 Correct 190 ms 37352 KB Output is correct
4 Correct 221 ms 37188 KB Output is correct
5 Correct 202 ms 37460 KB Output is correct
6 Correct 155 ms 41468 KB Output is correct
7 Correct 191 ms 41136 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 172 ms 41044 KB Output is correct
2 Correct 188 ms 37716 KB Output is correct
3 Correct 190 ms 37352 KB Output is correct
4 Correct 221 ms 37188 KB Output is correct
5 Correct 202 ms 37460 KB Output is correct
6 Correct 155 ms 41468 KB Output is correct
7 Correct 191 ms 41136 KB Output is correct
8 Correct 175 ms 41556 KB Output is correct
9 Correct 214 ms 41480 KB Output is correct
10 Correct 196 ms 45960 KB Output is correct
11 Correct 194 ms 46104 KB Output is correct
12 Correct 146 ms 36556 KB Output is correct
13 Correct 154 ms 36412 KB Output is correct
14 Correct 253 ms 37184 KB Output is correct
15 Correct 231 ms 37204 KB Output is correct
16 Correct 225 ms 37368 KB Output is correct
17 Correct 220 ms 37316 KB Output is correct
18 Correct 196 ms 37184 KB Output is correct
19 Correct 169 ms 37712 KB Output is correct
20 Correct 156 ms 41540 KB Output is correct
21 Correct 155 ms 41680 KB Output is correct
22 Correct 152 ms 41604 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12632 KB Output is correct
2 Correct 12 ms 15560 KB Output is correct
3 Correct 10 ms 15452 KB Output is correct
4 Correct 3 ms 12748 KB Output is correct
5 Correct 3 ms 12636 KB Output is correct
6 Correct 12 ms 16176 KB Output is correct
7 Correct 11 ms 15580 KB Output is correct
8 Correct 12 ms 15536 KB Output is correct
9 Correct 12 ms 15452 KB Output is correct
10 Correct 3 ms 12640 KB Output is correct
11 Correct 3 ms 12636 KB Output is correct
12 Correct 3 ms 12644 KB Output is correct
13 Correct 2 ms 12640 KB Output is correct
14 Correct 2 ms 12636 KB Output is correct
15 Correct 89 ms 15964 KB Output is correct
16 Correct 89 ms 16024 KB Output is correct
17 Correct 87 ms 15956 KB Output is correct
18 Correct 12 ms 16076 KB Output is correct
19 Correct 11 ms 15712 KB Output is correct
20 Correct 71 ms 16164 KB Output is correct
21 Correct 73 ms 16092 KB Output is correct
22 Correct 2 ms 12648 KB Output is correct
23 Correct 11 ms 15696 KB Output is correct
24 Correct 11 ms 15684 KB Output is correct
25 Correct 2 ms 12644 KB Output is correct
26 Correct 2 ms 12784 KB Output is correct
27 Correct 13 ms 15968 KB Output is correct
28 Correct 11 ms 15708 KB Output is correct
29 Correct 9 ms 15452 KB Output is correct
30 Correct 10 ms 15452 KB Output is correct
31 Correct 3 ms 13076 KB Output is correct
32 Correct 2 ms 12728 KB Output is correct
33 Correct 2 ms 12636 KB Output is correct
34 Correct 2 ms 12636 KB Output is correct
35 Correct 2 ms 12736 KB Output is correct
36 Correct 211 ms 45948 KB Output is correct
37 Correct 3 ms 12888 KB Output is correct
38 Correct 211 ms 45436 KB Output is correct
39 Correct 189 ms 44644 KB Output is correct
40 Correct 245 ms 45772 KB Output is correct
41 Correct 200 ms 46288 KB Output is correct
42 Correct 172 ms 41044 KB Output is correct
43 Correct 188 ms 37716 KB Output is correct
44 Correct 190 ms 37352 KB Output is correct
45 Correct 221 ms 37188 KB Output is correct
46 Correct 202 ms 37460 KB Output is correct
47 Correct 155 ms 41468 KB Output is correct
48 Correct 191 ms 41136 KB Output is correct
49 Correct 175 ms 41556 KB Output is correct
50 Correct 214 ms 41480 KB Output is correct
51 Correct 196 ms 45960 KB Output is correct
52 Correct 194 ms 46104 KB Output is correct
53 Correct 146 ms 36556 KB Output is correct
54 Correct 154 ms 36412 KB Output is correct
55 Correct 253 ms 37184 KB Output is correct
56 Correct 231 ms 37204 KB Output is correct
57 Correct 225 ms 37368 KB Output is correct
58 Correct 220 ms 37316 KB Output is correct
59 Correct 196 ms 37184 KB Output is correct
60 Correct 169 ms 37712 KB Output is correct
61 Correct 156 ms 41540 KB Output is correct
62 Correct 155 ms 41680 KB Output is correct
63 Correct 152 ms 41604 KB Output is correct
64 Correct 176 ms 41600 KB Output is correct
65 Correct 254 ms 37400 KB Output is correct
66 Correct 266 ms 37304 KB Output is correct
67 Correct 243 ms 37236 KB Output is correct
68 Correct 132 ms 36432 KB Output is correct
69 Correct 153 ms 36436 KB Output is correct
70 Correct 175 ms 41932 KB Output is correct
71 Correct 191 ms 41220 KB Output is correct
72 Correct 2 ms 12632 KB Output is correct
73 Correct 10 ms 15572 KB Output is correct
74 Correct 10 ms 15572 KB Output is correct
75 Correct 2 ms 12636 KB Output is correct
76 Correct 2 ms 12632 KB Output is correct
77 Correct 12 ms 15960 KB Output is correct
78 Correct 10 ms 15708 KB Output is correct
79 Correct 9 ms 15452 KB Output is correct
80 Correct 10 ms 15560 KB Output is correct
81 Correct 3 ms 12636 KB Output is correct
82 Correct 2 ms 12632 KB Output is correct
83 Correct 2 ms 12636 KB Output is correct
84 Correct 2 ms 12636 KB Output is correct
85 Correct 2 ms 12636 KB Output is correct
86 Correct 79 ms 15944 KB Output is correct
87 Correct 114 ms 15932 KB Output is correct
88 Correct 86 ms 16020 KB Output is correct
89 Correct 11 ms 15964 KB Output is correct
90 Correct 11 ms 15576 KB Output is correct
91 Correct 78 ms 16024 KB Output is correct
92 Correct 69 ms 15964 KB Output is correct
93 Correct 2 ms 12632 KB Output is correct
94 Correct 190 ms 45908 KB Output is correct
95 Correct 210 ms 45432 KB Output is correct
96 Correct 167 ms 44632 KB Output is correct
97 Correct 196 ms 45860 KB Output is correct
98 Correct 194 ms 46412 KB Output is correct
99 Correct 230 ms 37204 KB Output is correct
100 Correct 196 ms 37184 KB Output is correct
101 Correct 204 ms 37272 KB Output is correct
102 Correct 191 ms 37648 KB Output is correct
103 Correct 157 ms 41404 KB Output is correct
104 Correct 193 ms 41808 KB Output is correct
105 Correct 154 ms 41100 KB Output is correct
106 Correct 197 ms 41556 KB Output is correct
107 Correct 168 ms 41372 KB Output is correct
108 Correct 222 ms 46108 KB Output is correct
109 Correct 192 ms 46032 KB Output is correct
110 Correct 153 ms 36556 KB Output is correct
111 Correct 169 ms 36524 KB Output is correct
112 Correct 236 ms 37172 KB Output is correct
113 Correct 246 ms 37184 KB Output is correct