oj.uz

Submission #927165

# Submission time Handle Problem Language Result Execution time Memory
927165 2024-02-14T10:51:28 Z a_l_i_r_e_z_a Railway (BOI17_railway) C++17
100 / 100
 61 ms 23640 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;
const int inf = 1e9 + 7;
int n, m, k, ans, cnt[maxn], a[maxn], sz[maxn];
vector<pii> adj[maxn];
vector<int> col[maxn], vec;
bool mark[maxn];

int get_sz(int v, int p){
    for(auto [u, i]: adj[v]){
        if(u != p) sz[v] += get_sz(u, v);
    }
    return ++sz[v];
}

void reset(){
    for(auto v: vec){
        for(auto c: col[v]){
            a[c]--;
            if(a[c] == cnt[c] - 1) ans++;
            else if(a[c] == 0) ans--;
        }
    }
    vec.clear();
}

void add(int v){
    vec.pb(v);
    for(auto c: col[v]){
        a[c]++;
        if(a[c] == 1) ans++;
        else if(a[c] == cnt[c]) ans--;
    }
}

void dfs2(int v, int p){
    add(v);
    for(auto [u, i]: adj[v]) if(u != p) dfs2(u, v);
}

void dfs(int v, int p, int e){
    int bc = -1, bi = -1;
    for(auto [u, i]: adj[v]){
        if(u != p) if(bc == -1 || sz[u] > sz[bc]){
            bc = u;
            bi = i;
        }
    }
    for(auto [u, i]: adj[v]){
        if(u != p && u != bc){
            dfs(u, v, i);
            reset();
        }
    }
    if(bc != -1) dfs(bc, v, bi);
    for(auto [u, i]: adj[v]){
        if(u != p && u != bc){
            dfs2(u, v);
        }
    }
    add(v);
    if(ans >= k) mark[e] = 1;
}

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));
    }
    for(int i = 0; i < m; i++){
        cin >> cnt[i];
        for(int j = 0; j < cnt[i]; j++){
            int u; cin >> u;
            col[u].pb(i);
        }
    }
    get_sz(1, -1);
    dfs(1, -1, -1);
    vector<int> res;
    for(int i = 0; i < n - 1; i++) if(mark[i]) res.pb(i);
    cout << res.size() << '\n';
    for(auto u: res) cout << u + 1 << ' ';
    cout << '\n';

    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4956 KB Output is correct
2 Correct 4 ms 5724 KB Output is correct
3 Correct 5 ms 5724 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 1 ms 4956 KB Output is correct
6 Correct 5 ms 6236 KB Output is correct
7 Correct 4 ms 5720 KB Output is correct
8 Correct 3 ms 5724 KB Output is correct
9 Correct 4 ms 5724 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct
11 Correct 1 ms 4956 KB Output is correct
12 Correct 1 ms 4956 KB Output is correct
13 Correct 1 ms 4956 KB Output is correct
14 Correct 1 ms 4956 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4956 KB Output is correct
2 Correct 4 ms 5724 KB Output is correct
3 Correct 5 ms 5724 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 1 ms 4956 KB Output is correct
6 Correct 5 ms 6236 KB Output is correct
7 Correct 4 ms 5720 KB Output is correct
8 Correct 3 ms 5724 KB Output is correct
9 Correct 4 ms 5724 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct
11 Correct 1 ms 4956 KB Output is correct
12 Correct 1 ms 4956 KB Output is correct
13 Correct 1 ms 4956 KB Output is correct
14 Correct 1 ms 4956 KB Output is correct
15 Correct 13 ms 6744 KB Output is correct
16 Correct 13 ms 6744 KB Output is correct
17 Correct 13 ms 6748 KB Output is correct
18 Correct 4 ms 6156 KB Output is correct
19 Correct 6 ms 5724 KB Output is correct
20 Correct 13 ms 7004 KB Output is correct
21 Correct 12 ms 7012 KB Output is correct
22 Correct 1 ms 4956 KB Output is correct
23 Correct 4 ms 5724 KB Output is correct
24 Correct 4 ms 5724 KB Output is correct
25 Correct 1 ms 4952 KB Output is correct
26 Correct 1 ms 4956 KB Output is correct
27 Correct 4 ms 6236 KB Output is correct
28 Correct 4 ms 5724 KB Output is correct
29 Correct 3 ms 5724 KB Output is correct
30 Correct 4 ms 5724 KB Output is correct
31 Correct 1 ms 5160 KB Output is correct
32 Correct 1 ms 4952 KB Output is correct
33 Correct 1 ms 5208 KB Output is correct
34 Correct 1 ms 4956 KB Output is correct
35 Correct 1 ms 4956 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 23564 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 50 ms 23344 KB Output is correct
4 Correct 46 ms 22884 KB Output is correct
5 Correct 49 ms 23116 KB Output is correct
6 Correct 48 ms 23640 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 17112 KB Output is correct
2 Correct 39 ms 13008 KB Output is correct
3 Correct 45 ms 12532 KB Output is correct
4 Correct 44 ms 12504 KB Output is correct
5 Correct 59 ms 12752 KB Output is correct
6 Correct 37 ms 17364 KB Output is correct
7 Correct 41 ms 17260 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 17112 KB Output is correct
2 Correct 39 ms 13008 KB Output is correct
3 Correct 45 ms 12532 KB Output is correct
4 Correct 44 ms 12504 KB Output is correct
5 Correct 59 ms 12752 KB Output is correct
6 Correct 37 ms 17364 KB Output is correct
7 Correct 41 ms 17260 KB Output is correct
8 Correct 42 ms 17876 KB Output is correct
9 Correct 42 ms 17880 KB Output is correct
10 Correct 49 ms 23220 KB Output is correct
11 Correct 47 ms 23004 KB Output is correct
12 Correct 36 ms 13264 KB Output is correct
13 Correct 46 ms 13480 KB Output is correct
14 Correct 44 ms 12312 KB Output is correct
15 Correct 44 ms 12236 KB Output is correct
16 Correct 45 ms 12748 KB Output is correct
17 Correct 46 ms 12752 KB Output is correct
18 Correct 46 ms 12716 KB Output is correct
19 Correct 39 ms 12960 KB Output is correct
20 Correct 43 ms 17288 KB Output is correct
21 Correct 41 ms 17524 KB Output is correct
22 Correct 39 ms 17616 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4956 KB Output is correct
2 Correct 4 ms 5724 KB Output is correct
3 Correct 5 ms 5724 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 1 ms 4956 KB Output is correct
6 Correct 5 ms 6236 KB Output is correct
7 Correct 4 ms 5720 KB Output is correct
8 Correct 3 ms 5724 KB Output is correct
9 Correct 4 ms 5724 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct
11 Correct 1 ms 4956 KB Output is correct
12 Correct 1 ms 4956 KB Output is correct
13 Correct 1 ms 4956 KB Output is correct
14 Correct 1 ms 4956 KB Output is correct
15 Correct 13 ms 6744 KB Output is correct
16 Correct 13 ms 6744 KB Output is correct
17 Correct 13 ms 6748 KB Output is correct
18 Correct 4 ms 6156 KB Output is correct
19 Correct 6 ms 5724 KB Output is correct
20 Correct 13 ms 7004 KB Output is correct
21 Correct 12 ms 7012 KB Output is correct
22 Correct 1 ms 4956 KB Output is correct
23 Correct 4 ms 5724 KB Output is correct
24 Correct 4 ms 5724 KB Output is correct
25 Correct 1 ms 4952 KB Output is correct
26 Correct 1 ms 4956 KB Output is correct
27 Correct 4 ms 6236 KB Output is correct
28 Correct 4 ms 5724 KB Output is correct
29 Correct 3 ms 5724 KB Output is correct
30 Correct 4 ms 5724 KB Output is correct
31 Correct 1 ms 5160 KB Output is correct
32 Correct 1 ms 4952 KB Output is correct
33 Correct 1 ms 5208 KB Output is correct
34 Correct 1 ms 4956 KB Output is correct
35 Correct 1 ms 4956 KB Output is correct
36 Correct 53 ms 23564 KB Output is correct
37 Correct 1 ms 4956 KB Output is correct
38 Correct 50 ms 23344 KB Output is correct
39 Correct 46 ms 22884 KB Output is correct
40 Correct 49 ms 23116 KB Output is correct
41 Correct 48 ms 23640 KB Output is correct
42 Correct 39 ms 17112 KB Output is correct
43 Correct 39 ms 13008 KB Output is correct
44 Correct 45 ms 12532 KB Output is correct
45 Correct 44 ms 12504 KB Output is correct
46 Correct 59 ms 12752 KB Output is correct
47 Correct 37 ms 17364 KB Output is correct
48 Correct 41 ms 17260 KB Output is correct
49 Correct 42 ms 17876 KB Output is correct
50 Correct 42 ms 17880 KB Output is correct
51 Correct 49 ms 23220 KB Output is correct
52 Correct 47 ms 23004 KB Output is correct
53 Correct 36 ms 13264 KB Output is correct
54 Correct 46 ms 13480 KB Output is correct
55 Correct 44 ms 12312 KB Output is correct
56 Correct 44 ms 12236 KB Output is correct
57 Correct 45 ms 12748 KB Output is correct
58 Correct 46 ms 12752 KB Output is correct
59 Correct 46 ms 12716 KB Output is correct
60 Correct 39 ms 12960 KB Output is correct
61 Correct 43 ms 17288 KB Output is correct
62 Correct 41 ms 17524 KB Output is correct
63 Correct 39 ms 17616 KB Output is correct
64 Correct 42 ms 18012 KB Output is correct
65 Correct 61 ms 14028 KB Output is correct
66 Correct 58 ms 13520 KB Output is correct
67 Correct 56 ms 13236 KB Output is correct
68 Correct 33 ms 12756 KB Output is correct
69 Correct 34 ms 12768 KB Output is correct
70 Correct 46 ms 18480 KB Output is correct
71 Correct 50 ms 17916 KB Output is correct
72 Correct 1 ms 4952 KB Output is correct
73 Correct 4 ms 5724 KB Output is correct
74 Correct 4 ms 5724 KB Output is correct
75 Correct 1 ms 4956 KB Output is correct
76 Correct 1 ms 4956 KB Output is correct
77 Correct 4 ms 6236 KB Output is correct
78 Correct 4 ms 5860 KB Output is correct
79 Correct 3 ms 5856 KB Output is correct
80 Correct 4 ms 5720 KB Output is correct
81 Correct 1 ms 4956 KB Output is correct
82 Correct 1 ms 4956 KB Output is correct
83 Correct 1 ms 4956 KB Output is correct
84 Correct 1 ms 4956 KB Output is correct
85 Correct 1 ms 4956 KB Output is correct
86 Correct 13 ms 6748 KB Output is correct
87 Correct 14 ms 6708 KB Output is correct
88 Correct 13 ms 7000 KB Output is correct
89 Correct 4 ms 6232 KB Output is correct
90 Correct 4 ms 5724 KB Output is correct
91 Correct 13 ms 7156 KB Output is correct
92 Correct 12 ms 7048 KB Output is correct
93 Correct 1 ms 4956 KB Output is correct
94 Correct 53 ms 23588 KB Output is correct
95 Correct 48 ms 23356 KB Output is correct
96 Correct 52 ms 22824 KB Output is correct
97 Correct 49 ms 23116 KB Output is correct
98 Correct 47 ms 23628 KB Output is correct
99 Correct 46 ms 12752 KB Output is correct
100 Correct 44 ms 12748 KB Output is correct
101 Correct 50 ms 12808 KB Output is correct
102 Correct 41 ms 13176 KB Output is correct
103 Correct 37 ms 17360 KB Output is correct
104 Correct 40 ms 17524 KB Output is correct
105 Correct 36 ms 17108 KB Output is correct
106 Correct 42 ms 18128 KB Output is correct
107 Correct 42 ms 17808 KB Output is correct
108 Correct 47 ms 23116 KB Output is correct
109 Correct 46 ms 23120 KB Output is correct
110 Correct 34 ms 13268 KB Output is correct
111 Correct 34 ms 13300 KB Output is correct
112 Correct 44 ms 12240 KB Output is correct
113 Correct 44 ms 12236 KB Output is correct