oj.uz

Submission #927809

# Submission time Handle Problem Language Result Execution time Memory
927809 2024-02-15T10:57:11 Z a_l_i_r_e_z_a Railway (BOI17_railway) C++17
100 / 100
 80 ms 24164 KB 
// In the name of God
// Hope is last to die

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define pb push_back
// #define int long long    
#define S second
#define F first
#define mp make_pair
#define smax(x, y) (x) = max((x), (y))
#define smin(x, y) (x) = min((x), (y))
#define all(x) (x).begin(), (x).end()
#define len(x) ((int)(x).size())

const int maxn = 1e5 + 5, lg = 20;
const int inf = 1e9 + 7;
int n, m, k, timer, par[maxn][lg], in[maxn], h[maxn], cnt[maxn], id[maxn];
vector<pii> adj[maxn];

void dfs(int v = 1, int p = 0){
    in[v] = timer++;
    par[v][0] = p;
    for(int i = 1; i < lg; i++) par[v][i] = par[par[v][i - 1]][i - 1];
    for(auto [u, i]: adj[v]){
        if(u == p) continue;
        id[i] = u;
        h[u] = h[v] + 1;
        dfs(u, v);
    }
}

int up(int v, int d){
    for(int i = 0; i < lg; i++){
        if(d & (1ll << i)) v = par[v][i];
    }
    return v;
}

int lca(int u, int v){
    if(h[u] > h[v]) swap(u, v);
    v = up(v, h[v] - h[u]);
    for(int i = lg - 1; i >= 0; i--){
        if(par[u][i] != par[v][i]){
            u = par[u][i];
            v = par[v][i];
        }
    }
    if(u == v) return u;
    return par[v][0];
}

bool cmp(int u, int v){
    return in[u] < in[v];
}

void solve(int v, int p){
    for(auto [u, i]: adj[v]){
        if(p == u) continue;
        solve(u, v);
        cnt[v] += cnt[u];
    }
}

int32_t main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    
    cin >> n >> m >> k;
    for(int i = 0; i < n - 1; i++){
        int u, v; cin >> u >> v;
        adj[u].pb(mp(v, i));
        adj[v].pb(mp(u, i));
    }
    dfs();
    while(m--){
        vector<int> vec;
        int s; cin >> s;
        for(int i = 0; i < s; i++){
            int u; cin >> u;
            vec.pb(u);
        }
        sort(all(vec), cmp);
        for(int i = 0; i < s; i++){
            int l = lca(vec[i], vec[(i + 1) % s]);
            cnt[l]--;
            cnt[vec[i]]++;
        }
    }
    solve(1, 0);
    vector<int> ans;
    for(int i = 0; i < n - 1; i++) if(cnt[id[i]] >= k) ans.pb(i);
    cout << ans.size() << '\n';
    for(auto u: ans) cout << u + 1 << ' ';
    cout << '\n';

    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4696 KB Output is correct
2 Correct 4 ms 7004 KB Output is correct
3 Correct 4 ms 7004 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct
6 Correct 5 ms 7516 KB Output is correct
7 Correct 4 ms 7256 KB Output is correct
8 Correct 4 ms 7004 KB Output is correct
9 Correct 5 ms 7004 KB Output is correct
10 Correct 1 ms 4700 KB Output is correct
11 Correct 1 ms 4700 KB Output is correct
12 Correct 1 ms 4700 KB Output is correct
13 Correct 1 ms 4700 KB Output is correct
14 Correct 1 ms 4700 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4696 KB Output is correct
2 Correct 4 ms 7004 KB Output is correct
3 Correct 4 ms 7004 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct
6 Correct 5 ms 7516 KB Output is correct
7 Correct 4 ms 7256 KB Output is correct
8 Correct 4 ms 7004 KB Output is correct
9 Correct 5 ms 7004 KB Output is correct
10 Correct 1 ms 4700 KB Output is correct
11 Correct 1 ms 4700 KB Output is correct
12 Correct 1 ms 4700 KB Output is correct
13 Correct 1 ms 4700 KB Output is correct
14 Correct 1 ms 4700 KB Output is correct
15 Correct 19 ms 7164 KB Output is correct
16 Correct 19 ms 7004 KB Output is correct
17 Correct 20 ms 7260 KB Output is correct
18 Correct 5 ms 7516 KB Output is correct
19 Correct 5 ms 7004 KB Output is correct
20 Correct 20 ms 7260 KB Output is correct
21 Correct 22 ms 7004 KB Output is correct
22 Correct 1 ms 4700 KB Output is correct
23 Correct 4 ms 7004 KB Output is correct
24 Correct 4 ms 7004 KB Output is correct
25 Correct 1 ms 4700 KB Output is correct
26 Correct 1 ms 4700 KB Output is correct
27 Correct 5 ms 7516 KB Output is correct
28 Correct 4 ms 7004 KB Output is correct
29 Correct 4 ms 7004 KB Output is correct
30 Correct 4 ms 7004 KB Output is correct
31 Correct 1 ms 4700 KB Output is correct
32 Correct 1 ms 4700 KB Output is correct
33 Correct 1 ms 4700 KB Output is correct
34 Correct 1 ms 4700 KB Output is correct
35 Correct 1 ms 4700 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 24012 KB Output is correct
2 Correct 1 ms 4696 KB Output is correct
3 Correct 68 ms 23500 KB Output is correct
4 Correct 63 ms 22976 KB Output is correct
5 Correct 68 ms 24008 KB Output is correct
6 Correct 71 ms 23992 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 19540 KB Output is correct
2 Correct 60 ms 16116 KB Output is correct
3 Correct 64 ms 15704 KB Output is correct
4 Correct 72 ms 16208 KB Output is correct
5 Correct 60 ms 15696 KB Output is correct
6 Correct 62 ms 19692 KB Output is correct
7 Correct 57 ms 19540 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 19540 KB Output is correct
2 Correct 60 ms 16116 KB Output is correct
3 Correct 64 ms 15704 KB Output is correct
4 Correct 72 ms 16208 KB Output is correct
5 Correct 60 ms 15696 KB Output is correct
6 Correct 62 ms 19692 KB Output is correct
7 Correct 57 ms 19540 KB Output is correct
8 Correct 63 ms 19700 KB Output is correct
9 Correct 61 ms 19792 KB Output is correct
10 Correct 61 ms 24016 KB Output is correct
11 Correct 64 ms 24164 KB Output is correct
12 Correct 46 ms 15960 KB Output is correct
13 Correct 47 ms 16136 KB Output is correct
14 Correct 65 ms 15792 KB Output is correct
15 Correct 58 ms 15700 KB Output is correct
16 Correct 58 ms 15708 KB Output is correct
17 Correct 58 ms 15704 KB Output is correct
18 Correct 58 ms 15912 KB Output is correct
19 Correct 59 ms 16240 KB Output is correct
20 Correct 59 ms 19956 KB Output is correct
21 Correct 61 ms 20176 KB Output is correct
22 Correct 59 ms 20056 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4696 KB Output is correct
2 Correct 4 ms 7004 KB Output is correct
3 Correct 4 ms 7004 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct
6 Correct 5 ms 7516 KB Output is correct
7 Correct 4 ms 7256 KB Output is correct
8 Correct 4 ms 7004 KB Output is correct
9 Correct 5 ms 7004 KB Output is correct
10 Correct 1 ms 4700 KB Output is correct
11 Correct 1 ms 4700 KB Output is correct
12 Correct 1 ms 4700 KB Output is correct
13 Correct 1 ms 4700 KB Output is correct
14 Correct 1 ms 4700 KB Output is correct
15 Correct 19 ms 7164 KB Output is correct
16 Correct 19 ms 7004 KB Output is correct
17 Correct 20 ms 7260 KB Output is correct
18 Correct 5 ms 7516 KB Output is correct
19 Correct 5 ms 7004 KB Output is correct
20 Correct 20 ms 7260 KB Output is correct
21 Correct 22 ms 7004 KB Output is correct
22 Correct 1 ms 4700 KB Output is correct
23 Correct 4 ms 7004 KB Output is correct
24 Correct 4 ms 7004 KB Output is correct
25 Correct 1 ms 4700 KB Output is correct
26 Correct 1 ms 4700 KB Output is correct
27 Correct 5 ms 7516 KB Output is correct
28 Correct 4 ms 7004 KB Output is correct
29 Correct 4 ms 7004 KB Output is correct
30 Correct 4 ms 7004 KB Output is correct
31 Correct 1 ms 4700 KB Output is correct
32 Correct 1 ms 4700 KB Output is correct
33 Correct 1 ms 4700 KB Output is correct
34 Correct 1 ms 4700 KB Output is correct
35 Correct 1 ms 4700 KB Output is correct
36 Correct 69 ms 24012 KB Output is correct
37 Correct 1 ms 4696 KB Output is correct
38 Correct 68 ms 23500 KB Output is correct
39 Correct 63 ms 22976 KB Output is correct
40 Correct 68 ms 24008 KB Output is correct
41 Correct 71 ms 23992 KB Output is correct
42 Correct 61 ms 19540 KB Output is correct
43 Correct 60 ms 16116 KB Output is correct
44 Correct 64 ms 15704 KB Output is correct
45 Correct 72 ms 16208 KB Output is correct
46 Correct 60 ms 15696 KB Output is correct
47 Correct 62 ms 19692 KB Output is correct
48 Correct 57 ms 19540 KB Output is correct
49 Correct 63 ms 19700 KB Output is correct
50 Correct 61 ms 19792 KB Output is correct
51 Correct 61 ms 24016 KB Output is correct
52 Correct 64 ms 24164 KB Output is correct
53 Correct 46 ms 15960 KB Output is correct
54 Correct 47 ms 16136 KB Output is correct
55 Correct 65 ms 15792 KB Output is correct
56 Correct 58 ms 15700 KB Output is correct
57 Correct 58 ms 15708 KB Output is correct
58 Correct 58 ms 15704 KB Output is correct
59 Correct 58 ms 15912 KB Output is correct
60 Correct 59 ms 16240 KB Output is correct
61 Correct 59 ms 19956 KB Output is correct
62 Correct 61 ms 20176 KB Output is correct
63 Correct 59 ms 20056 KB Output is correct
64 Correct 62 ms 19940 KB Output is correct
65 Correct 64 ms 15704 KB Output is correct
66 Correct 80 ms 16120 KB Output is correct
67 Correct 67 ms 15704 KB Output is correct
68 Correct 41 ms 16220 KB Output is correct
69 Correct 41 ms 16212 KB Output is correct
70 Correct 66 ms 20172 KB Output is correct
71 Correct 69 ms 19688 KB Output is correct
72 Correct 1 ms 4700 KB Output is correct
73 Correct 4 ms 7004 KB Output is correct
74 Correct 4 ms 7004 KB Output is correct
75 Correct 1 ms 4700 KB Output is correct
76 Correct 1 ms 4700 KB Output is correct
77 Correct 5 ms 7516 KB Output is correct
78 Correct 5 ms 7004 KB Output is correct
79 Correct 4 ms 7004 KB Output is correct
80 Correct 4 ms 7000 KB Output is correct
81 Correct 1 ms 4696 KB Output is correct
82 Correct 1 ms 4700 KB Output is correct
83 Correct 1 ms 4700 KB Output is correct
84 Correct 1 ms 4700 KB Output is correct
85 Correct 1 ms 4700 KB Output is correct
86 Correct 19 ms 7004 KB Output is correct
87 Correct 21 ms 7252 KB Output is correct
88 Correct 20 ms 7264 KB Output is correct
89 Correct 5 ms 7516 KB Output is correct
90 Correct 5 ms 7004 KB Output is correct
91 Correct 21 ms 7268 KB Output is correct
92 Correct 22 ms 7196 KB Output is correct
93 Correct 1 ms 4700 KB Output is correct
94 Correct 68 ms 23872 KB Output is correct
95 Correct 66 ms 23484 KB Output is correct
96 Correct 66 ms 23100 KB Output is correct
97 Correct 68 ms 24112 KB Output is correct
98 Correct 69 ms 24008 KB Output is correct
99 Correct 60 ms 15708 KB Output is correct
100 Correct 57 ms 15708 KB Output is correct
101 Correct 59 ms 15696 KB Output is correct
102 Correct 58 ms 16224 KB Output is correct
103 Correct 60 ms 19792 KB Output is correct
104 Correct 60 ms 20068 KB Output is correct
105 Correct 58 ms 19540 KB Output is correct
106 Correct 62 ms 20052 KB Output is correct
107 Correct 63 ms 19796 KB Output is correct
108 Correct 62 ms 24008 KB Output is correct
109 Correct 70 ms 24132 KB Output is correct
110 Correct 51 ms 15960 KB Output is correct
111 Correct 47 ms 15964 KB Output is correct
112 Correct 59 ms 15912 KB Output is correct
113 Correct 62 ms 15920 KB Output is correct