oj.uz

Submission #824252

# Submission time Handle Problem Language Result Execution time Memory
824252 2023-08-13T21:42:36 Z Boomyday Railway (BOI17_railway) C++17
100 / 100
 98 ms 32868 KB 




//
// Created by adavy on 2/11/2023.
//
#include <bits/stdc++.h>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

using ll = long long;
using ld = long double;
using db = double;
using str = string; // yay python!

using ii = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;

using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vector<db>;
using vs = vector<str>;
using vii = vector<ii>;
using vpl = vector<pl>;
using vpd = vector<pd>;

#define tcT template<class T
#define tcTU tcT, class U

tcT> using V = vector<T>;
tcT, size_t SZ> using AR = array<T,SZ>;
tcT> using PR = pair<T,T>;

// pairs
#define mp make_pair
#define f first
#define s second

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

#define len(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
#define pb push_back
#define eb emplace_back
#define pf push_front

const int MOD = 1e9+7; // 998244353;
const int MX = 1e5+5;
const int LG = 23;
const ll INF = 1e18; // not too close to LLONG_MAX
const ld PI = acos((ld)-1);
const int dx[4] = {1,0,-1,0}, dy[4] = {0,1,0,-1}; // for every grid problem!!

int n, m, k, T=0;
int par[MX][LG]; // node, depth
int dep[MX], euler[MX];
vector<vi> adj(MX);
set<ii> paths;
vector<ii> pairs;
ll val[MX];


void dfs(int nd, int p=-1){
    euler[nd] = T++;
    par[nd][0] = p;
    if (nd!=0) dep[nd] = dep[p]+1;
    trav(v, adj[nd]){
        if(v != p){
            dfs(v, nd);
        }
    }
}

int lca(int a, int b){
    if (dep[a] < dep[b]) swap(a, b);
    int ddif = dep[a] - dep[b];
    F0R(j, LG) if ((1<<j)&ddif) a = par[a][j];
    if (a==b) return a;
    R0F(j, LG) if (par[a][j] != par[b][j]) {
        a = par[a][j];
        b = par[b][j];
    }
    return par[a][0];
}

void dfs2(int nd, int p=-1){

    trav(v, adj[nd]){
        if(v != p){

            dfs2(v, nd);
            if (val[v] >= 2*k){
                paths.insert({nd, v});
            }
            val[nd] += val[v];
        }
    }
}


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

    cin >> n >> m >> k;
    memset(val, 0, sizeof(val));

    F0R(_, n-1){
        int a, b; cin >> a >> b;
        a--; b--;
        pairs.pb({a,b});
        adj[a].pb(b);
        adj[b].pb(a);
    }
    dep[0] = 0;
    dfs(0);

    //cout << "________________" << endl;


    for(int j=1; j<LG;++j) F0R(i, n) par[i][j] = par[par[i][j-1]][j-1];


    F0R(_, m){
        int num; cin >> num;
        vi vals;
        F0R(i, num){
            int x; cin >> x; x--;
            vals.pb(x);
        }
        sort(all(vals), [](int a, int b){return euler[a]<euler[b];});
        vals.pb(vals[0]);
        F0R(i, num){
            int a = vals[i], b = vals[i+1];
            int l = lca(a,b);
            val[a]++; val[b]++;
            val[l] -= 2;
        }
    }
    //F0R(i, n) cout << val[i] << " ";
    //cout << endl;
    dfs2(0);
    //cout << paths.size() << endl;



    vi ans;
    F0R(i, n-1){
        int a = pairs[i].f, b = pairs[i].s;
        if (paths.count({a,b}) || paths.count({b,a})) ans.pb(i+1);


    }
    cout << ans.size() << endl;
    trav(i, ans) cout << i << " ";
    cout << endl;



}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3412 KB Output is correct
2 Correct 5 ms 4948 KB Output is correct
3 Correct 5 ms 4948 KB Output is correct
4 Correct 2 ms 3464 KB Output is correct
5 Correct 2 ms 3412 KB Output is correct
6 Correct 6 ms 5580 KB Output is correct
7 Correct 5 ms 5076 KB Output is correct
8 Correct 4 ms 4948 KB Output is correct
9 Correct 4 ms 4948 KB Output is correct
10 Correct 2 ms 3468 KB Output is correct
11 Correct 2 ms 3412 KB Output is correct
12 Correct 2 ms 3412 KB Output is correct
13 Correct 2 ms 3468 KB Output is correct
14 Correct 2 ms 3464 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3412 KB Output is correct
2 Correct 5 ms 4948 KB Output is correct
3 Correct 5 ms 4948 KB Output is correct
4 Correct 2 ms 3464 KB Output is correct
5 Correct 2 ms 3412 KB Output is correct
6 Correct 6 ms 5580 KB Output is correct
7 Correct 5 ms 5076 KB Output is correct
8 Correct 4 ms 4948 KB Output is correct
9 Correct 4 ms 4948 KB Output is correct
10 Correct 2 ms 3468 KB Output is correct
11 Correct 2 ms 3412 KB Output is correct
12 Correct 2 ms 3412 KB Output is correct
13 Correct 2 ms 3468 KB Output is correct
14 Correct 2 ms 3464 KB Output is correct
15 Correct 17 ms 5332 KB Output is correct
16 Correct 17 ms 5460 KB Output is correct
17 Correct 19 ms 5708 KB Output is correct
18 Correct 6 ms 5520 KB Output is correct
19 Correct 5 ms 5076 KB Output is correct
20 Correct 17 ms 5784 KB Output is correct
21 Correct 18 ms 5392 KB Output is correct
22 Correct 2 ms 3412 KB Output is correct
23 Correct 5 ms 4880 KB Output is correct
24 Correct 5 ms 4952 KB Output is correct
25 Correct 2 ms 3412 KB Output is correct
26 Correct 2 ms 3412 KB Output is correct
27 Correct 6 ms 5672 KB Output is correct
28 Correct 7 ms 5204 KB Output is correct
29 Correct 5 ms 4948 KB Output is correct
30 Correct 5 ms 4948 KB Output is correct
31 Correct 2 ms 3412 KB Output is correct
32 Correct 2 ms 3464 KB Output is correct
33 Correct 2 ms 3464 KB Output is correct
34 Correct 2 ms 3468 KB Output is correct
35 Correct 2 ms 3412 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 31712 KB Output is correct
2 Correct 2 ms 3412 KB Output is correct
3 Correct 76 ms 29632 KB Output is correct
4 Correct 63 ms 26696 KB Output is correct
5 Correct 80 ms 32036 KB Output is correct
6 Correct 78 ms 32840 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 22976 KB Output is correct
2 Correct 59 ms 19388 KB Output is correct
3 Correct 60 ms 19048 KB Output is correct
4 Correct 68 ms 19080 KB Output is correct
5 Correct 65 ms 18972 KB Output is correct
6 Correct 60 ms 23472 KB Output is correct
7 Correct 57 ms 23104 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 22976 KB Output is correct
2 Correct 59 ms 19388 KB Output is correct
3 Correct 60 ms 19048 KB Output is correct
4 Correct 68 ms 19080 KB Output is correct
5 Correct 65 ms 18972 KB Output is correct
6 Correct 60 ms 23472 KB Output is correct
7 Correct 57 ms 23104 KB Output is correct
8 Correct 67 ms 23624 KB Output is correct
9 Correct 69 ms 23680 KB Output is correct
10 Correct 77 ms 32608 KB Output is correct
11 Correct 76 ms 32408 KB Output is correct
12 Correct 53 ms 18880 KB Output is correct
13 Correct 47 ms 18968 KB Output is correct
14 Correct 57 ms 18912 KB Output is correct
15 Correct 59 ms 18908 KB Output is correct
16 Correct 66 ms 19136 KB Output is correct
17 Correct 61 ms 19008 KB Output is correct
18 Correct 62 ms 19032 KB Output is correct
19 Correct 62 ms 19408 KB Output is correct
20 Correct 67 ms 24400 KB Output is correct
21 Correct 80 ms 25152 KB Output is correct
22 Correct 68 ms 24668 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3412 KB Output is correct
2 Correct 5 ms 4948 KB Output is correct
3 Correct 5 ms 4948 KB Output is correct
4 Correct 2 ms 3464 KB Output is correct
5 Correct 2 ms 3412 KB Output is correct
6 Correct 6 ms 5580 KB Output is correct
7 Correct 5 ms 5076 KB Output is correct
8 Correct 4 ms 4948 KB Output is correct
9 Correct 4 ms 4948 KB Output is correct
10 Correct 2 ms 3468 KB Output is correct
11 Correct 2 ms 3412 KB Output is correct
12 Correct 2 ms 3412 KB Output is correct
13 Correct 2 ms 3468 KB Output is correct
14 Correct 2 ms 3464 KB Output is correct
15 Correct 17 ms 5332 KB Output is correct
16 Correct 17 ms 5460 KB Output is correct
17 Correct 19 ms 5708 KB Output is correct
18 Correct 6 ms 5520 KB Output is correct
19 Correct 5 ms 5076 KB Output is correct
20 Correct 17 ms 5784 KB Output is correct
21 Correct 18 ms 5392 KB Output is correct
22 Correct 2 ms 3412 KB Output is correct
23 Correct 5 ms 4880 KB Output is correct
24 Correct 5 ms 4952 KB Output is correct
25 Correct 2 ms 3412 KB Output is correct
26 Correct 2 ms 3412 KB Output is correct
27 Correct 6 ms 5672 KB Output is correct
28 Correct 7 ms 5204 KB Output is correct
29 Correct 5 ms 4948 KB Output is correct
30 Correct 5 ms 4948 KB Output is correct
31 Correct 2 ms 3412 KB Output is correct
32 Correct 2 ms 3464 KB Output is correct
33 Correct 2 ms 3464 KB Output is correct
34 Correct 2 ms 3468 KB Output is correct
35 Correct 2 ms 3412 KB Output is correct
36 Correct 81 ms 31712 KB Output is correct
37 Correct 2 ms 3412 KB Output is correct
38 Correct 76 ms 29632 KB Output is correct
39 Correct 63 ms 26696 KB Output is correct
40 Correct 80 ms 32036 KB Output is correct
41 Correct 78 ms 32840 KB Output is correct
42 Correct 57 ms 22976 KB Output is correct
43 Correct 59 ms 19388 KB Output is correct
44 Correct 60 ms 19048 KB Output is correct
45 Correct 68 ms 19080 KB Output is correct
46 Correct 65 ms 18972 KB Output is correct
47 Correct 60 ms 23472 KB Output is correct
48 Correct 57 ms 23104 KB Output is correct
49 Correct 67 ms 23624 KB Output is correct
50 Correct 69 ms 23680 KB Output is correct
51 Correct 77 ms 32608 KB Output is correct
52 Correct 76 ms 32408 KB Output is correct
53 Correct 53 ms 18880 KB Output is correct
54 Correct 47 ms 18968 KB Output is correct
55 Correct 57 ms 18912 KB Output is correct
56 Correct 59 ms 18908 KB Output is correct
57 Correct 66 ms 19136 KB Output is correct
58 Correct 61 ms 19008 KB Output is correct
59 Correct 62 ms 19032 KB Output is correct
60 Correct 62 ms 19408 KB Output is correct
61 Correct 67 ms 24400 KB Output is correct
62 Correct 80 ms 25152 KB Output is correct
63 Correct 68 ms 24668 KB Output is correct
64 Correct 65 ms 24028 KB Output is correct
65 Correct 63 ms 19040 KB Output is correct
66 Correct 79 ms 18904 KB Output is correct
67 Correct 63 ms 18940 KB Output is correct
68 Correct 41 ms 18752 KB Output is correct
69 Correct 41 ms 18772 KB Output is correct
70 Correct 72 ms 25788 KB Output is correct
71 Correct 64 ms 22840 KB Output is correct
72 Correct 2 ms 3472 KB Output is correct
73 Correct 5 ms 4948 KB Output is correct
74 Correct 5 ms 4888 KB Output is correct
75 Correct 2 ms 3412 KB Output is correct
76 Correct 2 ms 3468 KB Output is correct
77 Correct 6 ms 5588 KB Output is correct
78 Correct 5 ms 5076 KB Output is correct
79 Correct 4 ms 4948 KB Output is correct
80 Correct 4 ms 4948 KB Output is correct
81 Correct 1 ms 3464 KB Output is correct
82 Correct 2 ms 3412 KB Output is correct
83 Correct 2 ms 3412 KB Output is correct
84 Correct 2 ms 3412 KB Output is correct
85 Correct 2 ms 3412 KB Output is correct
86 Correct 17 ms 5336 KB Output is correct
87 Correct 17 ms 5460 KB Output is correct
88 Correct 18 ms 5716 KB Output is correct
89 Correct 6 ms 5568 KB Output is correct
90 Correct 5 ms 5036 KB Output is correct
91 Correct 17 ms 5784 KB Output is correct
92 Correct 18 ms 5404 KB Output is correct
93 Correct 2 ms 3412 KB Output is correct
94 Correct 81 ms 31692 KB Output is correct
95 Correct 78 ms 29512 KB Output is correct
96 Correct 59 ms 26696 KB Output is correct
97 Correct 90 ms 31940 KB Output is correct
98 Correct 98 ms 32868 KB Output is correct
99 Correct 62 ms 19040 KB Output is correct
100 Correct 77 ms 19004 KB Output is correct
101 Correct 64 ms 19040 KB Output is correct
102 Correct 63 ms 19396 KB Output is correct
103 Correct 59 ms 23232 KB Output is correct
104 Correct 65 ms 24952 KB Output is correct
105 Correct 58 ms 22960 KB Output is correct
106 Correct 67 ms 24284 KB Output is correct
107 Correct 66 ms 23352 KB Output is correct
108 Correct 76 ms 32580 KB Output is correct
109 Correct 75 ms 32540 KB Output is correct
110 Correct 45 ms 18948 KB Output is correct
111 Correct 47 ms 18872 KB Output is correct
112 Correct 60 ms 18912 KB Output is correct
113 Correct 57 ms 18916 KB Output is correct