oj.uz

Submission #135786

# Submission time Handle Problem Language Result Execution time Memory
135786 2019-07-24T11:11:01 Z popovicirobert Railway (BOI17_railway) C++14
100 / 100
 184 ms 32120 KB 
#include <bits/stdc++.h>
#define lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long
// 217
// 44


/*const int MOD = (int) 1e9 + 7;

inline int lgput(int a, int b) {
    int ans = 1;
    while(b > 0) {
        if(b & 1) ans = (1LL * ans * a) % MOD;
        b >>= 1;
        a = (1LL * a * a) % MOD;
    }
    return ans;
}

inline void mod(int &x) {
    if(x >= MOD)
        x -= MOD;
}

inline void add(int &x, int y) {
    x += y;
    mod(x);
}

inline void sub(int &x, int y) {
    x += MOD - y;
    mod(x);
}

inline void mul(int &x, int y) {
    x = (1LL * x * y) % MOD;
}*/

/*int fact[], invfact[];

inline void prec(int n) {
    fact[0] = 1;
    for(int i = 1; i <= n; i++) {
        fact[i] = (1LL * fact[i - 1] * i) % MOD;
    }
    invfact[n] = lgput(fact[n], MOD - 2);
    for(int i = n - 1; i >= 0; i--) {
        invfact[i] = (1LL * invfact[i + 1] * (i + 1)) % MOD;
    }
}

inline int comb(int n, int k) {
    if(n < k) return 0;
    return (1LL * fact[n] * (1LL * invfact[k] * invfact[n - k] % MOD)) % MOD;
}*/

using namespace std;

const int MAXN = (int) 1e5;

vector < pair <int, int> > g[MAXN + 1];
int idl[MAXN + 1], idr[MAXN + 1], id;

int rmq[20][2 * MAXN + 1], szr;
int lvl[MAXN + 1], first[MAXN + 1];

void dfs(int nod, int par) {
    lvl[nod] = lvl[par] + 1;
    rmq[0][++szr] = nod; first[nod] = szr;

    idl[nod] = ++id;
    for(auto it : g[nod]) {
        if(it.first != par) {
            dfs(it.first, nod);
            rmq[0][++szr] = nod;
        }
    }
    idr[nod] = id;
}

char lg[2 * MAXN + 1];

inline void prec() {
    int i;
    for(i = 2; i <= szr; i++) {
        lg[i] = lg[i >> 1] + 1;
    }
    for(int bit = 1; (1 << bit) <= szr; bit++) {
        for(i = 1; i + (1 << bit) <= szr + 1; i++) {
            int a = rmq[bit - 1][i], b = rmq[bit - 1][i + (1 << (bit - 1))];
            rmq[bit][i] = (lvl[a] < lvl[b] ? a : b);
        }
    }
}

inline int get_lca(int x, int y) {
    x = first[x], y = first[y];
    if(x > y) {
        swap(x, y);
    }
    int bit = lg[y - x + 1];
    int a = rmq[bit][x], b = rmq[bit][y - (1 << bit) + 1];
    return (lvl[a] < lvl[b] ? a : b);
}

inline bool in(int x, int y) {
    return idl[x] <= idl[y] && idr[y] <= idr[x];
}

int sp[MAXN + 1];
vector <int> sol;

void dfs_sp(int nod, int par, int k) {
    for(auto it : g[nod]) {
        if(it.first != par) {
            dfs_sp(it.first, nod, k);
            sp[nod] += sp[it.first];
            if(sp[it.first] >= k) {
                sol.push_back(it.second);
            }
        }
    }
}

int main() {
    //ifstream cin("A.in");
    //ofstream cout("A.out");
    int i, n, m, k;
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);

    cin >> n >> m >> k;

    for(i = 1; i < n; i++) {
        int x, y;
        cin >> x >> y;
        g[x].push_back({y, i});
        g[y].push_back({x, i});
    }

    dfs(1, 0);
    prec();

    while(m--) {

        int sz;
        cin >> sz;

        vector <int> nodes;
        for(i = 0; i < sz; i++) {
            int nod;
            cin >> nod;
            nodes.push_back(nod);
        }

        sort(nodes.begin(), nodes.end(), [&](const int &x, const int &y) {

                    return idl[x] < idl[y];

             });

        for(i = 0; i + 1 < sz; i++) {
            nodes.push_back(get_lca(nodes[i], nodes[i + 1]));
        }

        sort(nodes.begin(), nodes.end(), [&](const int &x, const int &y) {

                    return idl[x] < idl[y];

             });

        nodes.resize(unique(nodes.begin(), nodes.end()) - nodes.begin());

        stack <int> stk;
        for(auto nod : nodes) {
            while(stk.size() && !in(stk.top(), nod)) {
                stk.pop();
            }
            if(stk.size()) {
                sp[nod]++;
                sp[stk.top()]--;
            }
            stk.push(nod);
        }
    }

    dfs_sp(1, 0, k);

    cout << sol.size() << "\n";

    sort(sol.begin(), sol.end());
    for(auto it : sol) {
        cout << it << " ";
    }

    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 10 ms 4576 KB Output is correct
3 Correct 10 ms 4472 KB Output is correct
4 Correct 4 ms 2808 KB Output is correct
5 Correct 4 ms 2736 KB Output is correct
6 Correct 11 ms 4984 KB Output is correct
7 Correct 11 ms 4600 KB Output is correct
8 Correct 9 ms 4472 KB Output is correct
9 Correct 10 ms 4572 KB Output is correct
10 Correct 4 ms 2724 KB Output is correct
11 Correct 4 ms 2680 KB Output is correct
12 Correct 4 ms 2684 KB Output is correct
13 Correct 4 ms 2808 KB Output is correct
14 Correct 4 ms 2680 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 10 ms 4576 KB Output is correct
3 Correct 10 ms 4472 KB Output is correct
4 Correct 4 ms 2808 KB Output is correct
5 Correct 4 ms 2736 KB Output is correct
6 Correct 11 ms 4984 KB Output is correct
7 Correct 11 ms 4600 KB Output is correct
8 Correct 9 ms 4472 KB Output is correct
9 Correct 10 ms 4572 KB Output is correct
10 Correct 4 ms 2724 KB Output is correct
11 Correct 4 ms 2680 KB Output is correct
12 Correct 4 ms 2684 KB Output is correct
13 Correct 4 ms 2808 KB Output is correct
14 Correct 4 ms 2680 KB Output is correct
15 Correct 33 ms 4956 KB Output is correct
16 Correct 33 ms 4984 KB Output is correct
17 Correct 34 ms 4984 KB Output is correct
18 Correct 12 ms 4984 KB Output is correct
19 Correct 13 ms 4668 KB Output is correct
20 Correct 28 ms 5148 KB Output is correct
21 Correct 32 ms 4984 KB Output is correct
22 Correct 4 ms 2680 KB Output is correct
23 Correct 11 ms 4472 KB Output is correct
24 Correct 10 ms 4472 KB Output is correct
25 Correct 4 ms 2680 KB Output is correct
26 Correct 4 ms 2680 KB Output is correct
27 Correct 11 ms 4984 KB Output is correct
28 Correct 11 ms 4600 KB Output is correct
29 Correct 9 ms 4600 KB Output is correct
30 Correct 10 ms 4600 KB Output is correct
31 Correct 4 ms 2680 KB Output is correct
32 Correct 4 ms 2680 KB Output is correct
33 Correct 4 ms 2680 KB Output is correct
34 Correct 4 ms 2808 KB Output is correct
35 Correct 4 ms 2680 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 116 ms 31584 KB Output is correct
2 Correct 4 ms 2808 KB Output is correct
3 Correct 106 ms 31348 KB Output is correct
4 Correct 106 ms 30712 KB Output is correct
5 Correct 100 ms 31672 KB Output is correct
6 Correct 110 ms 31968 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 105 ms 27372 KB Output is correct
2 Correct 134 ms 23944 KB Output is correct
3 Correct 184 ms 23556 KB Output is correct
4 Correct 141 ms 23524 KB Output is correct
5 Correct 118 ms 23516 KB Output is correct
6 Correct 104 ms 27484 KB Output is correct
7 Correct 103 ms 27384 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 105 ms 27372 KB Output is correct
2 Correct 134 ms 23944 KB Output is correct
3 Correct 184 ms 23556 KB Output is correct
4 Correct 141 ms 23524 KB Output is correct
5 Correct 118 ms 23516 KB Output is correct
6 Correct 104 ms 27484 KB Output is correct
7 Correct 103 ms 27384 KB Output is correct
8 Correct 105 ms 27512 KB Output is correct
9 Correct 108 ms 27584 KB Output is correct
10 Correct 101 ms 31780 KB Output is correct
11 Correct 98 ms 31728 KB Output is correct
12 Correct 82 ms 23416 KB Output is correct
13 Correct 81 ms 23288 KB Output is correct
14 Correct 113 ms 23312 KB Output is correct
15 Correct 109 ms 23544 KB Output is correct
16 Correct 120 ms 23416 KB Output is correct
17 Correct 118 ms 23544 KB Output is correct
18 Correct 120 ms 23500 KB Output is correct
19 Correct 121 ms 23976 KB Output is correct
20 Correct 118 ms 27648 KB Output is correct
21 Correct 120 ms 27760 KB Output is correct
22 Correct 105 ms 27656 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 10 ms 4576 KB Output is correct
3 Correct 10 ms 4472 KB Output is correct
4 Correct 4 ms 2808 KB Output is correct
5 Correct 4 ms 2736 KB Output is correct
6 Correct 11 ms 4984 KB Output is correct
7 Correct 11 ms 4600 KB Output is correct
8 Correct 9 ms 4472 KB Output is correct
9 Correct 10 ms 4572 KB Output is correct
10 Correct 4 ms 2724 KB Output is correct
11 Correct 4 ms 2680 KB Output is correct
12 Correct 4 ms 2684 KB Output is correct
13 Correct 4 ms 2808 KB Output is correct
14 Correct 4 ms 2680 KB Output is correct
15 Correct 33 ms 4956 KB Output is correct
16 Correct 33 ms 4984 KB Output is correct
17 Correct 34 ms 4984 KB Output is correct
18 Correct 12 ms 4984 KB Output is correct
19 Correct 13 ms 4668 KB Output is correct
20 Correct 28 ms 5148 KB Output is correct
21 Correct 32 ms 4984 KB Output is correct
22 Correct 4 ms 2680 KB Output is correct
23 Correct 11 ms 4472 KB Output is correct
24 Correct 10 ms 4472 KB Output is correct
25 Correct 4 ms 2680 KB Output is correct
26 Correct 4 ms 2680 KB Output is correct
27 Correct 11 ms 4984 KB Output is correct
28 Correct 11 ms 4600 KB Output is correct
29 Correct 9 ms 4600 KB Output is correct
30 Correct 10 ms 4600 KB Output is correct
31 Correct 4 ms 2680 KB Output is correct
32 Correct 4 ms 2680 KB Output is correct
33 Correct 4 ms 2680 KB Output is correct
34 Correct 4 ms 2808 KB Output is correct
35 Correct 4 ms 2680 KB Output is correct
36 Correct 116 ms 31584 KB Output is correct
37 Correct 4 ms 2808 KB Output is correct
38 Correct 106 ms 31348 KB Output is correct
39 Correct 106 ms 30712 KB Output is correct
40 Correct 100 ms 31672 KB Output is correct
41 Correct 110 ms 31968 KB Output is correct
42 Correct 105 ms 27372 KB Output is correct
43 Correct 134 ms 23944 KB Output is correct
44 Correct 184 ms 23556 KB Output is correct
45 Correct 141 ms 23524 KB Output is correct
46 Correct 118 ms 23516 KB Output is correct
47 Correct 104 ms 27484 KB Output is correct
48 Correct 103 ms 27384 KB Output is correct
49 Correct 105 ms 27512 KB Output is correct
50 Correct 108 ms 27584 KB Output is correct
51 Correct 101 ms 31780 KB Output is correct
52 Correct 98 ms 31728 KB Output is correct
53 Correct 82 ms 23416 KB Output is correct
54 Correct 81 ms 23288 KB Output is correct
55 Correct 113 ms 23312 KB Output is correct
56 Correct 109 ms 23544 KB Output is correct
57 Correct 120 ms 23416 KB Output is correct
58 Correct 118 ms 23544 KB Output is correct
59 Correct 120 ms 23500 KB Output is correct
60 Correct 121 ms 23976 KB Output is correct
61 Correct 118 ms 27648 KB Output is correct
62 Correct 120 ms 27760 KB Output is correct
63 Correct 105 ms 27656 KB Output is correct
64 Correct 110 ms 27668 KB Output is correct
65 Correct 153 ms 23544 KB Output is correct
66 Correct 128 ms 23416 KB Output is correct
67 Correct 120 ms 23416 KB Output is correct
68 Correct 85 ms 23160 KB Output is correct
69 Correct 84 ms 23156 KB Output is correct
70 Correct 113 ms 27932 KB Output is correct
71 Correct 109 ms 27384 KB Output is correct
72 Correct 4 ms 2680 KB Output is correct
73 Correct 11 ms 4600 KB Output is correct
74 Correct 10 ms 4600 KB Output is correct
75 Correct 4 ms 2680 KB Output is correct
76 Correct 4 ms 2808 KB Output is correct
77 Correct 10 ms 4984 KB Output is correct
78 Correct 10 ms 4600 KB Output is correct
79 Correct 10 ms 4472 KB Output is correct
80 Correct 10 ms 4600 KB Output is correct
81 Correct 4 ms 2808 KB Output is correct
82 Correct 4 ms 2680 KB Output is correct
83 Correct 4 ms 2808 KB Output is correct
84 Correct 4 ms 2808 KB Output is correct
85 Correct 4 ms 2680 KB Output is correct
86 Correct 33 ms 4984 KB Output is correct
87 Correct 32 ms 4956 KB Output is correct
88 Correct 33 ms 4984 KB Output is correct
89 Correct 11 ms 4984 KB Output is correct
90 Correct 11 ms 4600 KB Output is correct
91 Correct 26 ms 5112 KB Output is correct
92 Correct 30 ms 4984 KB Output is correct
93 Correct 4 ms 2808 KB Output is correct
94 Correct 121 ms 31744 KB Output is correct
95 Correct 123 ms 31296 KB Output is correct
96 Correct 104 ms 30840 KB Output is correct
97 Correct 97 ms 31572 KB Output is correct
98 Correct 105 ms 32120 KB Output is correct
99 Correct 118 ms 23416 KB Output is correct
100 Correct 109 ms 23416 KB Output is correct
101 Correct 112 ms 23544 KB Output is correct
102 Correct 112 ms 23800 KB Output is correct
103 Correct 103 ms 27456 KB Output is correct
104 Correct 105 ms 27736 KB Output is correct
105 Correct 103 ms 27376 KB Output is correct
106 Correct 109 ms 27640 KB Output is correct
107 Correct 104 ms 27512 KB Output is correct
108 Correct 98 ms 31872 KB Output is correct
109 Correct 100 ms 31716 KB Output is correct
110 Correct 78 ms 23288 KB Output is correct
111 Correct 81 ms 23288 KB Output is correct
112 Correct 121 ms 23380 KB Output is correct
113 Correct 109 ms 23448 KB Output is correct