oj.uz

Submission #878292

# Submission time Handle Problem Language Result Execution time Memory
878292 2023-11-24T08:03:16 Z ArashJafariyan Railway (BOI17_railway) C++17
100 / 100
 230 ms 36976 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long 
#define pb push_back
#define pii array<int, 2>

const int LG = 16 + 2, N = 1e5 + 4;

int n, m, k, anc[N][LG], h[N], bc[N], e[N], cnt[N];
vector<int> addSen[N], remSen[N];
vector<pii> g[N];
set<int> sack;

void findAnc(int v = 0, int p = 0) {
    if (v != 0) {
        for (int i = 1; i < LG; ++i) {
            int u = anc[v][i - 1];
            if (u != -1) {
                anc[v][i] = anc[u][i - 1];
            }
        }
    }

    for (auto [u, _] : g[v]) {
        if (u != p) {
            h[u] =  h[v] + 1;
            anc[u][0] = v;
            findAnc(u, v);
        }
    }
}

int lca(int v, int u) {
    if (v == u) {
        return v;
    }

    if (h[v] < h[u])
        swap(v, u);
    
    for (int i = 0; i < LG; ++i) {
        if ((1 << i) & (h[v] - h[u])) {
            v = anc[v][i];
        }
    }

    if (v == u) {
        return v;
    }

    for (int i = LG - 1; i >= 0; --i) {
        int vt = anc[v][i];
        int ut = anc[u][i];
        if (vt != ut && vt != -1 && ut != -1) {
            v = vt;
            u = ut;
        }
    }

    return anc[v][0];
}

int preDfs(int v = 0, int p = 0) {
    int ret = 1, cur = 0;
    for (auto [u, edge] : g[v]) {
        if (u != p) {
            e[u] = edge;
            int res = preDfs(u, v);
            ret += res;
            if (res > cur) {
                cur = res;
                bc[v] = u;
            }
        }
    }
    return ret;
}

void rem(int v, int p) {
    for (int sen : addSen[v]) {
        auto it = sack.find(sen);
        if (it != sack.end()) {
            sack.erase(it);
        }
    }

    for (auto [u, _] : g[v]) {
        if (u != p) {
            rem(u, v);
        }
    }
}

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

    for (int sen : addSen[v]) {
        sack.insert(sen);
    }
    for (int sen : remSen[v]) {
        auto it = sack.find(sen);
        if (it != sack.end()) {
            sack.erase(it);
        }
    }
}

void dfs(int v = 0, int p = 0) {
    for (auto [u, _] : g[v]) {
        if (u != p && u != bc[v]) {
            dfs(u, v);
            rem(u, v);
        }
    }

    if (bc[v] != -1) {
        dfs(bc[v], v);
    }
    for (auto [u, _] : g[v]) {
        if (u != p && u != bc[v]) {
            add(u, v);
        }
    }
    
    for (int sen : addSen[v]) {
        sack.insert(sen);
    }
    for (int sen : remSen[v]) {
        auto it = sack.find(sen);
        if (it != sack.end()) {
            sack.erase(it);
        }
    }

    if (v != 0) {
        cnt[e[v]] += sack.size();
    }
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    cin >> n >> m >> k;
    for (int i = 0; i < n - 1; ++i) {
        int v, u;
        cin >> v >> u;
        --v, --u;
        g[v].pb({u, i});
        g[u].pb({v, i});
    }

    memset(anc, -1, sizeof anc);
    findAnc();

    for (int i = 0; i < m; ++i) {
        int sz;
        cin >> sz;
        int l = -1;
        while (sz--) {
            int v;
            cin >> v;
            --v;
            if (l == -1) {
                l = v;
            }
            else {
                l = lca(l, v);
            }
            addSen[v].pb(i);
        }
        remSen[l].pb(i);
    }

    memset(bc, -1, sizeof bc);
    preDfs();
    dfs();

    vector<int> out;
    for (int i = 0; i < n - 1; ++i) {
        if (cnt[i] >= k) {
            out.pb(i + 1);
        }
    }  

    cout << out.size() << '\n';
    for (int edge : out) {
        cout << edge << ' ';
    }

    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 16372 KB Output is correct
2 Correct 7 ms 16472 KB Output is correct
3 Correct 7 ms 16476 KB Output is correct
4 Correct 3 ms 16012 KB Output is correct
5 Correct 3 ms 15964 KB Output is correct
6 Correct 7 ms 17244 KB Output is correct
7 Correct 6 ms 16728 KB Output is correct
8 Correct 6 ms 16476 KB Output is correct
9 Correct 7 ms 16476 KB Output is correct
10 Correct 3 ms 15984 KB Output is correct
11 Correct 3 ms 15964 KB Output is correct
12 Correct 3 ms 15964 KB Output is correct
13 Correct 4 ms 16020 KB Output is correct
14 Correct 3 ms 15964 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 16372 KB Output is correct
2 Correct 7 ms 16472 KB Output is correct
3 Correct 7 ms 16476 KB Output is correct
4 Correct 3 ms 16012 KB Output is correct
5 Correct 3 ms 15964 KB Output is correct
6 Correct 7 ms 17244 KB Output is correct
7 Correct 6 ms 16728 KB Output is correct
8 Correct 6 ms 16476 KB Output is correct
9 Correct 7 ms 16476 KB Output is correct
10 Correct 3 ms 15984 KB Output is correct
11 Correct 3 ms 15964 KB Output is correct
12 Correct 3 ms 15964 KB Output is correct
13 Correct 4 ms 16020 KB Output is correct
14 Correct 3 ms 15964 KB Output is correct
15 Correct 35 ms 17500 KB Output is correct
16 Correct 35 ms 17832 KB Output is correct
17 Correct 35 ms 17496 KB Output is correct
18 Correct 7 ms 17244 KB Output is correct
19 Correct 7 ms 16728 KB Output is correct
20 Correct 25 ms 17756 KB Output is correct
21 Correct 28 ms 17756 KB Output is correct
22 Correct 3 ms 16016 KB Output is correct
23 Correct 7 ms 16472 KB Output is correct
24 Correct 8 ms 16472 KB Output is correct
25 Correct 3 ms 16216 KB Output is correct
26 Correct 4 ms 15964 KB Output is correct
27 Correct 8 ms 17244 KB Output is correct
28 Correct 7 ms 16568 KB Output is correct
29 Correct 6 ms 16476 KB Output is correct
30 Correct 7 ms 16476 KB Output is correct
31 Correct 3 ms 15964 KB Output is correct
32 Correct 4 ms 15964 KB Output is correct
33 Correct 3 ms 15964 KB Output is correct
34 Correct 3 ms 15964 KB Output is correct
35 Correct 3 ms 15964 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 36952 KB Output is correct
2 Correct 3 ms 15964 KB Output is correct
3 Correct 98 ms 36376 KB Output is correct
4 Correct 104 ms 36316 KB Output is correct
5 Correct 96 ms 35016 KB Output is correct
6 Correct 79 ms 35152 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 30208 KB Output is correct
2 Correct 101 ms 25184 KB Output is correct
3 Correct 141 ms 24824 KB Output is correct
4 Correct 176 ms 24780 KB Output is correct
5 Correct 163 ms 24720 KB Output is correct
6 Correct 77 ms 30032 KB Output is correct
7 Correct 79 ms 30064 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 30208 KB Output is correct
2 Correct 101 ms 25184 KB Output is correct
3 Correct 141 ms 24824 KB Output is correct
4 Correct 176 ms 24780 KB Output is correct
5 Correct 163 ms 24720 KB Output is correct
6 Correct 77 ms 30032 KB Output is correct
7 Correct 79 ms 30064 KB Output is correct
8 Correct 105 ms 29672 KB Output is correct
9 Correct 89 ms 29780 KB Output is correct
10 Correct 76 ms 34780 KB Output is correct
11 Correct 76 ms 34784 KB Output is correct
12 Correct 58 ms 23212 KB Output is correct
13 Correct 61 ms 23380 KB Output is correct
14 Correct 117 ms 22356 KB Output is correct
15 Correct 109 ms 22484 KB Output is correct
16 Correct 172 ms 25036 KB Output is correct
17 Correct 175 ms 24784 KB Output is correct
18 Correct 173 ms 24784 KB Output is correct
19 Correct 90 ms 25080 KB Output is correct
20 Correct 76 ms 30060 KB Output is correct
21 Correct 79 ms 30288 KB Output is correct
22 Correct 80 ms 30092 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 16372 KB Output is correct
2 Correct 7 ms 16472 KB Output is correct
3 Correct 7 ms 16476 KB Output is correct
4 Correct 3 ms 16012 KB Output is correct
5 Correct 3 ms 15964 KB Output is correct
6 Correct 7 ms 17244 KB Output is correct
7 Correct 6 ms 16728 KB Output is correct
8 Correct 6 ms 16476 KB Output is correct
9 Correct 7 ms 16476 KB Output is correct
10 Correct 3 ms 15984 KB Output is correct
11 Correct 3 ms 15964 KB Output is correct
12 Correct 3 ms 15964 KB Output is correct
13 Correct 4 ms 16020 KB Output is correct
14 Correct 3 ms 15964 KB Output is correct
15 Correct 35 ms 17500 KB Output is correct
16 Correct 35 ms 17832 KB Output is correct
17 Correct 35 ms 17496 KB Output is correct
18 Correct 7 ms 17244 KB Output is correct
19 Correct 7 ms 16728 KB Output is correct
20 Correct 25 ms 17756 KB Output is correct
21 Correct 28 ms 17756 KB Output is correct
22 Correct 3 ms 16016 KB Output is correct
23 Correct 7 ms 16472 KB Output is correct
24 Correct 8 ms 16472 KB Output is correct
25 Correct 3 ms 16216 KB Output is correct
26 Correct 4 ms 15964 KB Output is correct
27 Correct 8 ms 17244 KB Output is correct
28 Correct 7 ms 16568 KB Output is correct
29 Correct 6 ms 16476 KB Output is correct
30 Correct 7 ms 16476 KB Output is correct
31 Correct 3 ms 15964 KB Output is correct
32 Correct 4 ms 15964 KB Output is correct
33 Correct 3 ms 15964 KB Output is correct
34 Correct 3 ms 15964 KB Output is correct
35 Correct 3 ms 15964 KB Output is correct
36 Correct 94 ms 36952 KB Output is correct
37 Correct 3 ms 15964 KB Output is correct
38 Correct 98 ms 36376 KB Output is correct
39 Correct 104 ms 36316 KB Output is correct
40 Correct 96 ms 35016 KB Output is correct
41 Correct 79 ms 35152 KB Output is correct
42 Correct 76 ms 30208 KB Output is correct
43 Correct 101 ms 25184 KB Output is correct
44 Correct 141 ms 24824 KB Output is correct
45 Correct 176 ms 24780 KB Output is correct
46 Correct 163 ms 24720 KB Output is correct
47 Correct 77 ms 30032 KB Output is correct
48 Correct 79 ms 30064 KB Output is correct
49 Correct 105 ms 29672 KB Output is correct
50 Correct 89 ms 29780 KB Output is correct
51 Correct 76 ms 34780 KB Output is correct
52 Correct 76 ms 34784 KB Output is correct
53 Correct 58 ms 23212 KB Output is correct
54 Correct 61 ms 23380 KB Output is correct
55 Correct 117 ms 22356 KB Output is correct
56 Correct 109 ms 22484 KB Output is correct
57 Correct 172 ms 25036 KB Output is correct
58 Correct 175 ms 24784 KB Output is correct
59 Correct 173 ms 24784 KB Output is correct
60 Correct 90 ms 25080 KB Output is correct
61 Correct 76 ms 30060 KB Output is correct
62 Correct 79 ms 30288 KB Output is correct
63 Correct 80 ms 30092 KB Output is correct
64 Correct 85 ms 29960 KB Output is correct
65 Correct 197 ms 25808 KB Output is correct
66 Correct 173 ms 23672 KB Output is correct
67 Correct 118 ms 23332 KB Output is correct
68 Correct 54 ms 22608 KB Output is correct
69 Correct 60 ms 22696 KB Output is correct
70 Correct 89 ms 30792 KB Output is correct
71 Correct 81 ms 29780 KB Output is correct
72 Correct 4 ms 15960 KB Output is correct
73 Correct 8 ms 16476 KB Output is correct
74 Correct 8 ms 16476 KB Output is correct
75 Correct 3 ms 15960 KB Output is correct
76 Correct 4 ms 15960 KB Output is correct
77 Correct 7 ms 17244 KB Output is correct
78 Correct 7 ms 16732 KB Output is correct
79 Correct 6 ms 16540 KB Output is correct
80 Correct 6 ms 16476 KB Output is correct
81 Correct 3 ms 15964 KB Output is correct
82 Correct 3 ms 15960 KB Output is correct
83 Correct 3 ms 15960 KB Output is correct
84 Correct 3 ms 15964 KB Output is correct
85 Correct 3 ms 15960 KB Output is correct
86 Correct 35 ms 17424 KB Output is correct
87 Correct 35 ms 17560 KB Output is correct
88 Correct 43 ms 17496 KB Output is correct
89 Correct 7 ms 17244 KB Output is correct
90 Correct 8 ms 16732 KB Output is correct
91 Correct 27 ms 17752 KB Output is correct
92 Correct 27 ms 17752 KB Output is correct
93 Correct 3 ms 15964 KB Output is correct
94 Correct 109 ms 36976 KB Output is correct
95 Correct 96 ms 36532 KB Output is correct
96 Correct 92 ms 36176 KB Output is correct
97 Correct 86 ms 35016 KB Output is correct
98 Correct 80 ms 35020 KB Output is correct
99 Correct 162 ms 24784 KB Output is correct
100 Correct 177 ms 24596 KB Output is correct
101 Correct 230 ms 24688 KB Output is correct
102 Correct 96 ms 25216 KB Output is correct
103 Correct 81 ms 30036 KB Output is correct
104 Correct 78 ms 30288 KB Output is correct
105 Correct 84 ms 30076 KB Output is correct
106 Correct 90 ms 29824 KB Output is correct
107 Correct 83 ms 29736 KB Output is correct
108 Correct 86 ms 34788 KB Output is correct
109 Correct 90 ms 34824 KB Output is correct
110 Correct 56 ms 23368 KB Output is correct
111 Correct 53 ms 23376 KB Output is correct
112 Correct 151 ms 22596 KB Output is correct
113 Correct 118 ms 22356 KB Output is correct