oj.uz

Submission #940190

# Submission time Handle Problem Language Result Execution time Memory
940190 2024-03-07T06:30:58 Z Pring Railway (BOI17_railway) C++17
100 / 100
 97 ms 35784 KB 
#include <bits/stdc++.h>
using namespace std;

#ifdef MIKU
const string dbmc = "\033[1;38;2;57;197;187m", dbrs = "\033[0m";
#define debug(x...) cout << dbmc << '[' << #x << "] : ", dout(x)
void dout() { cout << dbrs << endl; }
template <typename T, typename ...U>
void dout(T t, U ...u) { cout << t << (sizeof...(u) ? ", " : ""); dout(u...); }
#else
#define debug(...) 39
#endif

#define int long long
#define fs first
#define sc second
#define mp make_pair
#define FOR(i, j, k) for (int i = j, Z = k; i < Z; i++)
typedef pair<int, int> pii;

const int MXN = 100005;
int n, m, k, c, s[MXN];
int eu[MXN], ev[MXN];
vector<int> eid[MXN];

struct CLR {
    int clr[MXN], ans;
    void init(int n) {
        fill(clr + 1, clr + n + 1, 0);
        ans = 0;
    }
    void ADD(int a) {
        if (++clr[a] == 1) ans++;
    }
    void SUB(int a) {
        if (--clr[a] == 0) ans--;
    }
} clr;

namespace HLD {
    int d[MXN], p[MXN], sz[MXN], son[MXN], top[MXN], dfn[MXN], C;
    int rdfn[MXN], ep[MXN];
    vector<int> vc[MXN];

    void DFS1(int id, int par, int dep) {
        p[id] = par;
        d[id] = dep;
        sz[id] = 1;
        son[id] = -1;
        for (auto &e : eid[id]) {
            int i = eu[e] ^ ev[e] ^ id;
            if (i == par) continue;
            ep[i] = e;
            DFS1(i, id, dep + 1);
            sz[id] += sz[i];
            if (son[id] == -1) son[id] = i;
            else if (sz[son[id]] < sz[i]) son[id] = i;
        }
    }

    void DFS2(int id, int par, int _t) {
        top[id] = _t;
        rdfn[C] = id;
        dfn[id] = C++;
        if (son[id] != -1) DFS2(son[id], id, _t);
        for (auto &e : eid[id]) {
            int i = eu[e] ^ ev[e] ^ id;
            if (i == par) continue;
            if (i == son[id]) continue;
            DFS2(i, id, i);
        }
    }

    void DO(int rt) {
        DFS1(1, 0, 0);
        DFS2(1, 0, 1);
    }

    void ADD(int x, int y, int c) {
        while (top[x] != top[y]) {
            if (d[top[x]] < d[top[y]]) swap(x, y);
            vc[dfn[top[x]]].push_back(c);
            vc[dfn[x] + 1].push_back(-c);
            x = p[top[x]];
        }
        if (d[x] < d[y]) swap(x, y);
        vc[dfn[y] + 1].push_back(c);
        vc[dfn[x] + 1].push_back(-c);
    }

    void BOX(vector<int> &v, int k) {
        clr.init(m);
        FOR(i, 0, n) {
            for (auto &j : vc[i]) {
                if (j > 0) clr.ADD(j);
                else clr.SUB(-j);
            }
            if (clr.ans >= k) v.push_back(ep[rdfn[i]]);
        }
    }
}

void miku() {
    cin >> n >> m >> k;
    FOR(i, 1, n) {
        cin >> eu[i] >> ev[i];
        eid[eu[i]].push_back(i);
        eid[ev[i]].push_back(i);
    }
    HLD::DO(1);
    FOR(j, 1, m + 1) {
        cin >> c;
        FOR(i, 0, c) cin >> s[i];
        FOR(i, 1, c) HLD::ADD(s[0], s[i], j);
    }
    vector<int> ans;
    HLD::BOX(ans, k);
    sort(ans.begin(), ans.end());
    cout << ans.size() << '\n';
    for (auto &i : ans) cout << i << ' ';
    cout << '\n';
}

int32_t main() {
    cin.tie(0) -> sync_with_stdio(false);
    cin.exceptions(iostream::failbit);
    miku();
    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12888 KB Output is correct
2 Correct 5 ms 13656 KB Output is correct
3 Correct 5 ms 13660 KB Output is correct
4 Correct 2 ms 12948 KB Output is correct
5 Correct 3 ms 12892 KB Output is correct
6 Correct 5 ms 13916 KB Output is correct
7 Correct 5 ms 13660 KB Output is correct
8 Correct 5 ms 13656 KB Output is correct
9 Correct 4 ms 13660 KB Output is correct
10 Correct 2 ms 12888 KB Output is correct
11 Correct 2 ms 12892 KB Output is correct
12 Correct 2 ms 12892 KB Output is correct
13 Correct 2 ms 12892 KB Output is correct
14 Correct 2 ms 12888 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12888 KB Output is correct
2 Correct 5 ms 13656 KB Output is correct
3 Correct 5 ms 13660 KB Output is correct
4 Correct 2 ms 12948 KB Output is correct
5 Correct 3 ms 12892 KB Output is correct
6 Correct 5 ms 13916 KB Output is correct
7 Correct 5 ms 13660 KB Output is correct
8 Correct 5 ms 13656 KB Output is correct
9 Correct 4 ms 13660 KB Output is correct
10 Correct 2 ms 12888 KB Output is correct
11 Correct 2 ms 12892 KB Output is correct
12 Correct 2 ms 12892 KB Output is correct
13 Correct 2 ms 12892 KB Output is correct
14 Correct 2 ms 12888 KB Output is correct
15 Correct 23 ms 21072 KB Output is correct
16 Correct 22 ms 21168 KB Output is correct
17 Correct 28 ms 21844 KB Output is correct
18 Correct 6 ms 13916 KB Output is correct
19 Correct 6 ms 13720 KB Output is correct
20 Correct 22 ms 20176 KB Output is correct
21 Correct 22 ms 20332 KB Output is correct
22 Correct 3 ms 12892 KB Output is correct
23 Correct 5 ms 13660 KB Output is correct
24 Correct 6 ms 13660 KB Output is correct
25 Correct 3 ms 12892 KB Output is correct
26 Correct 2 ms 12892 KB Output is correct
27 Correct 5 ms 13980 KB Output is correct
28 Correct 6 ms 13764 KB Output is correct
29 Correct 4 ms 13656 KB Output is correct
30 Correct 5 ms 13660 KB Output is correct
31 Correct 2 ms 12892 KB Output is correct
32 Correct 2 ms 12892 KB Output is correct
33 Correct 2 ms 12892 KB Output is correct
34 Correct 2 ms 12888 KB Output is correct
35 Correct 3 ms 12892 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 29732 KB Output is correct
2 Correct 2 ms 12892 KB Output is correct
3 Correct 54 ms 29388 KB Output is correct
4 Correct 45 ms 28484 KB Output is correct
5 Correct 54 ms 30916 KB Output is correct
6 Correct 54 ms 32296 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 25168 KB Output is correct
2 Correct 54 ms 23540 KB Output is correct
3 Correct 56 ms 24760 KB Output is correct
4 Correct 85 ms 27256 KB Output is correct
5 Correct 52 ms 25772 KB Output is correct
6 Correct 44 ms 25428 KB Output is correct
7 Correct 43 ms 25168 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 25168 KB Output is correct
2 Correct 54 ms 23540 KB Output is correct
3 Correct 56 ms 24760 KB Output is correct
4 Correct 85 ms 27256 KB Output is correct
5 Correct 52 ms 25772 KB Output is correct
6 Correct 44 ms 25428 KB Output is correct
7 Correct 43 ms 25168 KB Output is correct
8 Correct 68 ms 26932 KB Output is correct
9 Correct 51 ms 26800 KB Output is correct
10 Correct 52 ms 30664 KB Output is correct
11 Correct 49 ms 30664 KB Output is correct
12 Correct 50 ms 27544 KB Output is correct
13 Correct 48 ms 27336 KB Output is correct
14 Correct 61 ms 32984 KB Output is correct
15 Correct 57 ms 31708 KB Output is correct
16 Correct 53 ms 27532 KB Output is correct
17 Correct 53 ms 27036 KB Output is correct
18 Correct 54 ms 27200 KB Output is correct
19 Correct 47 ms 23256 KB Output is correct
20 Correct 47 ms 25564 KB Output is correct
21 Correct 44 ms 25652 KB Output is correct
22 Correct 45 ms 25808 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12888 KB Output is correct
2 Correct 5 ms 13656 KB Output is correct
3 Correct 5 ms 13660 KB Output is correct
4 Correct 2 ms 12948 KB Output is correct
5 Correct 3 ms 12892 KB Output is correct
6 Correct 5 ms 13916 KB Output is correct
7 Correct 5 ms 13660 KB Output is correct
8 Correct 5 ms 13656 KB Output is correct
9 Correct 4 ms 13660 KB Output is correct
10 Correct 2 ms 12888 KB Output is correct
11 Correct 2 ms 12892 KB Output is correct
12 Correct 2 ms 12892 KB Output is correct
13 Correct 2 ms 12892 KB Output is correct
14 Correct 2 ms 12888 KB Output is correct
15 Correct 23 ms 21072 KB Output is correct
16 Correct 22 ms 21168 KB Output is correct
17 Correct 28 ms 21844 KB Output is correct
18 Correct 6 ms 13916 KB Output is correct
19 Correct 6 ms 13720 KB Output is correct
20 Correct 22 ms 20176 KB Output is correct
21 Correct 22 ms 20332 KB Output is correct
22 Correct 3 ms 12892 KB Output is correct
23 Correct 5 ms 13660 KB Output is correct
24 Correct 6 ms 13660 KB Output is correct
25 Correct 3 ms 12892 KB Output is correct
26 Correct 2 ms 12892 KB Output is correct
27 Correct 5 ms 13980 KB Output is correct
28 Correct 6 ms 13764 KB Output is correct
29 Correct 4 ms 13656 KB Output is correct
30 Correct 5 ms 13660 KB Output is correct
31 Correct 2 ms 12892 KB Output is correct
32 Correct 2 ms 12892 KB Output is correct
33 Correct 2 ms 12892 KB Output is correct
34 Correct 2 ms 12888 KB Output is correct
35 Correct 3 ms 12892 KB Output is correct
36 Correct 52 ms 29732 KB Output is correct
37 Correct 2 ms 12892 KB Output is correct
38 Correct 54 ms 29388 KB Output is correct
39 Correct 45 ms 28484 KB Output is correct
40 Correct 54 ms 30916 KB Output is correct
41 Correct 54 ms 32296 KB Output is correct
42 Correct 41 ms 25168 KB Output is correct
43 Correct 54 ms 23540 KB Output is correct
44 Correct 56 ms 24760 KB Output is correct
45 Correct 85 ms 27256 KB Output is correct
46 Correct 52 ms 25772 KB Output is correct
47 Correct 44 ms 25428 KB Output is correct
48 Correct 43 ms 25168 KB Output is correct
49 Correct 68 ms 26932 KB Output is correct
50 Correct 51 ms 26800 KB Output is correct
51 Correct 52 ms 30664 KB Output is correct
52 Correct 49 ms 30664 KB Output is correct
53 Correct 50 ms 27544 KB Output is correct
54 Correct 48 ms 27336 KB Output is correct
55 Correct 61 ms 32984 KB Output is correct
56 Correct 57 ms 31708 KB Output is correct
57 Correct 53 ms 27532 KB Output is correct
58 Correct 53 ms 27036 KB Output is correct
59 Correct 54 ms 27200 KB Output is correct
60 Correct 47 ms 23256 KB Output is correct
61 Correct 47 ms 25564 KB Output is correct
62 Correct 44 ms 25652 KB Output is correct
63 Correct 45 ms 25808 KB Output is correct
64 Correct 47 ms 26192 KB Output is correct
65 Correct 97 ms 29784 KB Output is correct
66 Correct 91 ms 35784 KB Output is correct
67 Correct 82 ms 33344 KB Output is correct
68 Correct 46 ms 25168 KB Output is correct
69 Correct 48 ms 25292 KB Output is correct
70 Correct 61 ms 26844 KB Output is correct
71 Correct 67 ms 26580 KB Output is correct
72 Correct 3 ms 12892 KB Output is correct
73 Correct 5 ms 13660 KB Output is correct
74 Correct 6 ms 13660 KB Output is correct
75 Correct 3 ms 12892 KB Output is correct
76 Correct 3 ms 12888 KB Output is correct
77 Correct 7 ms 13916 KB Output is correct
78 Correct 5 ms 13660 KB Output is correct
79 Correct 4 ms 13912 KB Output is correct
80 Correct 5 ms 13660 KB Output is correct
81 Correct 2 ms 12892 KB Output is correct
82 Correct 2 ms 12900 KB Output is correct
83 Correct 2 ms 12892 KB Output is correct
84 Correct 2 ms 12892 KB Output is correct
85 Correct 2 ms 12892 KB Output is correct
86 Correct 26 ms 21240 KB Output is correct
87 Correct 23 ms 21180 KB Output is correct
88 Correct 24 ms 21712 KB Output is correct
89 Correct 5 ms 13912 KB Output is correct
90 Correct 5 ms 13656 KB Output is correct
91 Correct 21 ms 20172 KB Output is correct
92 Correct 24 ms 20808 KB Output is correct
93 Correct 3 ms 12892 KB Output is correct
94 Correct 51 ms 29884 KB Output is correct
95 Correct 50 ms 29300 KB Output is correct
96 Correct 45 ms 28416 KB Output is correct
97 Correct 53 ms 30824 KB Output is correct
98 Correct 54 ms 32208 KB Output is correct
99 Correct 56 ms 27296 KB Output is correct
100 Correct 60 ms 27080 KB Output is correct
101 Correct 73 ms 29404 KB Output is correct
102 Correct 52 ms 23876 KB Output is correct
103 Correct 43 ms 25388 KB Output is correct
104 Correct 45 ms 25672 KB Output is correct
105 Correct 49 ms 25168 KB Output is correct
106 Correct 51 ms 27084 KB Output is correct
107 Correct 51 ms 26716 KB Output is correct
108 Correct 50 ms 30712 KB Output is correct
109 Correct 50 ms 30916 KB Output is correct
110 Correct 55 ms 27472 KB Output is correct
111 Correct 60 ms 27452 KB Output is correct
112 Correct 74 ms 33632 KB Output is correct
113 Correct 66 ms 32608 KB Output is correct