oj.uz

Submission #487547

# Submission time Handle Problem Language Result Execution time Memory
487547 2021-11-16T06:00:23 Z alireza_kaviani Railway (BOI17_railway) C++11
30 / 100
 1000 ms 31800 KB 
#include <bits/stdc++.h>
using namespace std;
#define cerr cerr << "DEBUG "
 
constexpr int N = 1e5 + 10, M = 5e4 + 10;
 
int n, k, m, pe[N], sz[N];
int init[N], cnt[M], cnt0, cntf;
vector<int> *st[N];
vector<int> col[N], ge[N], g[N], ans;
 
void prep(int v, int p, int pi) {
    pe[v] = pi;
    int i = 0;
    sz[v] = 1;
    for (auto &u : g[v]) {
        if (u != p) {
            prep(u, v, ge[v][i]);
            sz[v] += sz[v];
        }
        ++i;
    }
}
 
void dfs(int v, int p, bool keep) {
    int bg = -1, bgs = 0;
    for (auto &u : g[v]) {
        if (u != p && sz[u] > bgs) {
            bgs = sz[u];
            bg = u;
        }
    }
    if (bg == -1) {
        st[v] = new vector<int>();
        st[v]->push_back(v);
    } else {
        for (auto &u : g[v]) {
            if (u != p && u != bg) {
                dfs(u, v, false);
            }
        }
        dfs(bg, v, true);
        st[v] = st[bg];
        st[v]->push_back(v);
        for (auto &u : g[v]) {
            if (u != p && u != bg) {
                for (auto &w : *st[u]) {
                    st[v]->push_back(w);
                    for (auto &c : col[w]) {
                        if (++cnt[c] == init[c]) {
                            cntf++;
                        }
                        if (cnt[c] == 1) {
                            cnt0--;
                        }
                    }
                }
                delete st[u];
            }
        }
    }
    for (auto &c : col[v]) {
        if (++cnt[c] == init[c]) {
            cntf++;
        }
        if (cnt[c] == 1) {
            cnt0--;
        }
    }
    if (m - cnt0 - cntf >= k) {
        ans.push_back(pe[v]);
    }
    //cerr << v << ' ' << cnt0 << ' ' << cntf << '\n';
    if (!keep) {
        for (auto &u : *st[v]) {
            for (auto &c : col[u]) {
                if (--cnt[c] == 0) {
                    cnt0++;
                }
                if (cnt[c] == init[c] - 1) {
                    cntf--;
                }
            }
        }
    }
}
 
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
     
    cin >> n >> m >> k;
    for (int i = 0; i < n - 1; ++i) {
        int v, u;
        cin >> v >> u;
        --v, --u;
        g[v].push_back(u);
        g[u].push_back(v);
        ge[v].push_back(i);
        ge[u].push_back(i);
    }
    for (int i = 0; i < m; ++i) {
        int s;
        cin >> s;
        cnt[i] = 0;
        init[i] = s;
        if (!s) {
            ++cntf;
        }
        ++cnt0;
        while (s--) {
            int v;
            cin >> v;
            --v;
            col[v].push_back(i);
        }
    }
 
    prep(0, -1, -1);
    dfs(0, -1, true);
 
    sort(ans.begin(), ans.end());
    cout << ans.size() << '\n';
    for (auto &e : ans) {
        cout << e + 1 << ' ';
    }
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7376 KB Output is correct
2 Correct 9 ms 8464 KB Output is correct
3 Correct 9 ms 8400 KB Output is correct
4 Correct 4 ms 7376 KB Output is correct
5 Correct 4 ms 7376 KB Output is correct
6 Correct 16 ms 9084 KB Output is correct
7 Correct 20 ms 8660 KB Output is correct
8 Correct 8 ms 8500 KB Output is correct
9 Correct 8 ms 8528 KB Output is correct
10 Correct 3 ms 7376 KB Output is correct
11 Correct 3 ms 7368 KB Output is correct
12 Correct 4 ms 7376 KB Output is correct
13 Correct 3 ms 7376 KB Output is correct
14 Correct 4 ms 7376 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7376 KB Output is correct
2 Correct 9 ms 8464 KB Output is correct
3 Correct 9 ms 8400 KB Output is correct
4 Correct 4 ms 7376 KB Output is correct
5 Correct 4 ms 7376 KB Output is correct
6 Correct 16 ms 9084 KB Output is correct
7 Correct 20 ms 8660 KB Output is correct
8 Correct 8 ms 8500 KB Output is correct
9 Correct 8 ms 8528 KB Output is correct
10 Correct 3 ms 7376 KB Output is correct
11 Correct 3 ms 7368 KB Output is correct
12 Correct 4 ms 7376 KB Output is correct
13 Correct 3 ms 7376 KB Output is correct
14 Correct 4 ms 7376 KB Output is correct
15 Correct 22 ms 9416 KB Output is correct
16 Correct 21 ms 9404 KB Output is correct
17 Correct 23 ms 9452 KB Output is correct
18 Correct 19 ms 9124 KB Output is correct
19 Correct 22 ms 8632 KB Output is correct
20 Correct 21 ms 10244 KB Output is correct
21 Correct 27 ms 9804 KB Output is correct
22 Correct 4 ms 7376 KB Output is correct
23 Correct 10 ms 8368 KB Output is correct
24 Correct 10 ms 8408 KB Output is correct
25 Correct 4 ms 7376 KB Output is correct
26 Correct 4 ms 7352 KB Output is correct
27 Correct 17 ms 9136 KB Output is correct
28 Correct 22 ms 8624 KB Output is correct
29 Correct 8 ms 8664 KB Output is correct
30 Correct 9 ms 8528 KB Output is correct
31 Correct 4 ms 7368 KB Output is correct
32 Correct 4 ms 7376 KB Output is correct
33 Correct 4 ms 7368 KB Output is correct
34 Correct 4 ms 7368 KB Output is correct
35 Correct 4 ms 7384 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 31800 KB Output is correct
2 Correct 3 ms 7376 KB Output is correct
3 Correct 76 ms 31228 KB Output is correct
4 Correct 68 ms 30772 KB Output is correct
5 Correct 73 ms 31176 KB Output is correct
6 Correct 95 ms 31576 KB Output is correct

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 905 ms 26152 KB Output is correct
2 Execution timed out 1081 ms 20780 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 905 ms 26152 KB Output is correct
2 Execution timed out 1081 ms 20780 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7376 KB Output is correct
2 Correct 9 ms 8464 KB Output is correct
3 Correct 9 ms 8400 KB Output is correct
4 Correct 4 ms 7376 KB Output is correct
5 Correct 4 ms 7376 KB Output is correct
6 Correct 16 ms 9084 KB Output is correct
7 Correct 20 ms 8660 KB Output is correct
8 Correct 8 ms 8500 KB Output is correct
9 Correct 8 ms 8528 KB Output is correct
10 Correct 3 ms 7376 KB Output is correct
11 Correct 3 ms 7368 KB Output is correct
12 Correct 4 ms 7376 KB Output is correct
13 Correct 3 ms 7376 KB Output is correct
14 Correct 4 ms 7376 KB Output is correct
15 Correct 22 ms 9416 KB Output is correct
16 Correct 21 ms 9404 KB Output is correct
17 Correct 23 ms 9452 KB Output is correct
18 Correct 19 ms 9124 KB Output is correct
19 Correct 22 ms 8632 KB Output is correct
20 Correct 21 ms 10244 KB Output is correct
21 Correct 27 ms 9804 KB Output is correct
22 Correct 4 ms 7376 KB Output is correct
23 Correct 10 ms 8368 KB Output is correct
24 Correct 10 ms 8408 KB Output is correct
25 Correct 4 ms 7376 KB Output is correct
26 Correct 4 ms 7352 KB Output is correct
27 Correct 17 ms 9136 KB Output is correct
28 Correct 22 ms 8624 KB Output is correct
29 Correct 8 ms 8664 KB Output is correct
30 Correct 9 ms 8528 KB Output is correct
31 Correct 4 ms 7368 KB Output is correct
32 Correct 4 ms 7376 KB Output is correct
33 Correct 4 ms 7368 KB Output is correct
34 Correct 4 ms 7368 KB Output is correct
35 Correct 4 ms 7384 KB Output is correct
36 Correct 83 ms 31800 KB Output is correct
37 Correct 3 ms 7376 KB Output is correct
38 Correct 76 ms 31228 KB Output is correct
39 Correct 68 ms 30772 KB Output is correct
40 Correct 73 ms 31176 KB Output is correct
41 Correct 95 ms 31576 KB Output is correct
42 Correct 905 ms 26152 KB Output is correct
43 Execution timed out 1081 ms 20780 KB Time limit exceeded
44 Halted 0 ms 0 KB -