oj.uz

Submission #930962

# Submission time Handle Problem Language Result Execution time Memory
930962 2024-02-21T01:21:35 Z Regulus Railway (BOI17_railway) C++17
100 / 100
 125 ms 43860 KB 
#include <bits/stdc++.h>
#define IO ios::sync_with_stdio(false);cin.tie(0);
#define debug(x) cerr << #x << " = " << (x) << ' '
#define bug(x) cerr << (x) << ' '
#define endl cerr << '\n'
#define all(v) (v).begin(), (v).end()
#define SZ(v) (ll)(v).size()
#define lowbit(x) (x)&-(x)
#define pb emplace_back
#define F first
#define S second
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
//#define TEST
const int N = 1e5+5;
const int LogN = 17;
int tin[N], tout[N], timer, anc[LogN+5][N], cnt[N];
vector<pll> g[N];
vector<int> v[N], ans;

inline void dfs0(int x, int pre)
{
    tin[x] = ++timer, anc[0][x] = pre;
    for (auto e : g[x])
    {
        int v = e.F, id = e.S;
        if (v == pre) continue;
        dfs0(v, x);
    }
    tout[x] = ++timer;
}

inline bool is_anc(int x, int y)
{ return tin[x] <= tin[y] && tout[y] <= tout[x]; }
inline int get_lca(int x, int y)
{
    if (is_anc(x, y)) return x;
    if (is_anc(y, x)) return y;
    for (int i=LogN; i >= 0; --i)
        if (anc[i][x] && !is_anc(anc[i][x], y)) x = anc[i][x];
    return anc[0][x];
}

inline set<int> dfs(int x, int pre)
{
    set<int> st, tmp;

    for (auto e : g[x])
    {
        int v = e.F, id = e.S;
        if (v == pre) continue;
        tmp = dfs(v, x);
        cnt[id] = SZ(tmp);

        if (SZ(st) < SZ(tmp)) swap(st, tmp);
        for (int xx : tmp) st.insert(xx);
    }
    for (int d : v[x]) if (d > 0) st.insert(d);
    for (int d : v[x]) if (d < 0) st.erase(-d);

    return st;
}

int main(void)
{ IO
    int n, i, Q, K;

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

    dfs0(1, 0);
    for (i=1; i <= LogN; ++i)
        for (int j=1; j <= n; ++j) anc[i][j] = anc[i-1][anc[i-1][j]];

    for (i=1; i <= Q; ++i)
    {
        int k, pre = 0; cin >> k;
        for (int j=0; j < k; ++j)
        {
            int x; cin >> x;
            pre = (pre)?get_lca(pre, x) : x;
            v[x].pb(i);
        }
        v[pre].pb(-i);
    }

    for (i=1; i <= n; ++i)
    {
        sort(all(v[i]));
        v[i].resize(unique(all(v[i]))-v[i].begin());
    }

    dfs(1, 0);
    for (i=1; i <= n-1; ++i)
        if (cnt[i] >= K) ans.pb(i);
    
    cout << SZ(ans) << '\n';
    for (int i : ans) cout << i << ' ';
    cout << '\n';

    return 0;
}

Compilation message

railway.cpp: In function 'void dfs0(int, int)':
railway.cpp:27:22: warning: unused variable 'id' [-Wunused-variable]
   27 |         int v = e.F, id = e.S;
      |                      ^~

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 13660 KB Output is correct
3 Correct 6 ms 13456 KB Output is correct
4 Correct 2 ms 12892 KB Output is correct
5 Correct 3 ms 12892 KB Output is correct
6 Correct 6 ms 14684 KB Output is correct
7 Correct 5 ms 13916 KB Output is correct
8 Correct 5 ms 13660 KB Output is correct
9 Correct 5 ms 13648 KB Output is correct
10 Correct 2 ms 12892 KB Output is correct
11 Correct 2 ms 12888 KB Output is correct
12 Correct 2 ms 12892 KB Output is correct
13 Correct 4 ms 12892 KB Output is correct
14 Correct 2 ms 12892 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 13660 KB Output is correct
3 Correct 6 ms 13456 KB Output is correct
4 Correct 2 ms 12892 KB Output is correct
5 Correct 3 ms 12892 KB Output is correct
6 Correct 6 ms 14684 KB Output is correct
7 Correct 5 ms 13916 KB Output is correct
8 Correct 5 ms 13660 KB Output is correct
9 Correct 5 ms 13648 KB Output is correct
10 Correct 2 ms 12892 KB Output is correct
11 Correct 2 ms 12888 KB Output is correct
12 Correct 2 ms 12892 KB Output is correct
13 Correct 4 ms 12892 KB Output is correct
14 Correct 2 ms 12892 KB Output is correct
15 Correct 25 ms 14720 KB Output is correct
16 Correct 20 ms 14680 KB Output is correct
17 Correct 21 ms 14684 KB Output is correct
18 Correct 7 ms 14608 KB Output is correct
19 Correct 8 ms 14184 KB Output is correct
20 Correct 23 ms 14852 KB Output is correct
21 Correct 24 ms 14684 KB Output is correct
22 Correct 3 ms 12892 KB Output is correct
23 Correct 6 ms 13660 KB Output is correct
24 Correct 6 ms 13660 KB Output is correct
25 Correct 2 ms 12904 KB Output is correct
26 Correct 2 ms 12892 KB Output is correct
27 Correct 6 ms 14684 KB Output is correct
28 Correct 5 ms 13660 KB Output is correct
29 Correct 5 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 3 ms 13044 KB Output is correct
34 Correct 2 ms 12892 KB Output is correct
35 Correct 2 ms 12892 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 43828 KB Output is correct
2 Correct 2 ms 12896 KB Output is correct
3 Correct 88 ms 43680 KB Output is correct
4 Correct 87 ms 43100 KB Output is correct
5 Correct 70 ms 42704 KB Output is correct
6 Correct 68 ms 42956 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 33340 KB Output is correct
2 Correct 86 ms 24032 KB Output is correct
3 Correct 111 ms 25092 KB Output is correct
4 Correct 88 ms 25292 KB Output is correct
5 Correct 100 ms 24972 KB Output is correct
6 Correct 75 ms 33360 KB Output is correct
7 Correct 81 ms 33456 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 33340 KB Output is correct
2 Correct 86 ms 24032 KB Output is correct
3 Correct 111 ms 25092 KB Output is correct
4 Correct 88 ms 25292 KB Output is correct
5 Correct 100 ms 24972 KB Output is correct
6 Correct 75 ms 33360 KB Output is correct
7 Correct 81 ms 33456 KB Output is correct
8 Correct 71 ms 32848 KB Output is correct
9 Correct 78 ms 32848 KB Output is correct
10 Correct 63 ms 42708 KB Output is correct
11 Correct 64 ms 42460 KB Output is correct
12 Correct 42 ms 21480 KB Output is correct
13 Correct 41 ms 21452 KB Output is correct
14 Correct 75 ms 21500 KB Output is correct
15 Correct 70 ms 21588 KB Output is correct
16 Correct 105 ms 25608 KB Output is correct
17 Correct 118 ms 25292 KB Output is correct
18 Correct 87 ms 25172 KB Output is correct
19 Correct 91 ms 24176 KB Output is correct
20 Correct 85 ms 33468 KB Output is correct
21 Correct 78 ms 33364 KB Output is correct
22 Correct 78 ms 33240 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 13660 KB Output is correct
3 Correct 6 ms 13456 KB Output is correct
4 Correct 2 ms 12892 KB Output is correct
5 Correct 3 ms 12892 KB Output is correct
6 Correct 6 ms 14684 KB Output is correct
7 Correct 5 ms 13916 KB Output is correct
8 Correct 5 ms 13660 KB Output is correct
9 Correct 5 ms 13648 KB Output is correct
10 Correct 2 ms 12892 KB Output is correct
11 Correct 2 ms 12888 KB Output is correct
12 Correct 2 ms 12892 KB Output is correct
13 Correct 4 ms 12892 KB Output is correct
14 Correct 2 ms 12892 KB Output is correct
15 Correct 25 ms 14720 KB Output is correct
16 Correct 20 ms 14680 KB Output is correct
17 Correct 21 ms 14684 KB Output is correct
18 Correct 7 ms 14608 KB Output is correct
19 Correct 8 ms 14184 KB Output is correct
20 Correct 23 ms 14852 KB Output is correct
21 Correct 24 ms 14684 KB Output is correct
22 Correct 3 ms 12892 KB Output is correct
23 Correct 6 ms 13660 KB Output is correct
24 Correct 6 ms 13660 KB Output is correct
25 Correct 2 ms 12904 KB Output is correct
26 Correct 2 ms 12892 KB Output is correct
27 Correct 6 ms 14684 KB Output is correct
28 Correct 5 ms 13660 KB Output is correct
29 Correct 5 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 3 ms 13044 KB Output is correct
34 Correct 2 ms 12892 KB Output is correct
35 Correct 2 ms 12892 KB Output is correct
36 Correct 88 ms 43828 KB Output is correct
37 Correct 2 ms 12896 KB Output is correct
38 Correct 88 ms 43680 KB Output is correct
39 Correct 87 ms 43100 KB Output is correct
40 Correct 70 ms 42704 KB Output is correct
41 Correct 68 ms 42956 KB Output is correct
42 Correct 78 ms 33340 KB Output is correct
43 Correct 86 ms 24032 KB Output is correct
44 Correct 111 ms 25092 KB Output is correct
45 Correct 88 ms 25292 KB Output is correct
46 Correct 100 ms 24972 KB Output is correct
47 Correct 75 ms 33360 KB Output is correct
48 Correct 81 ms 33456 KB Output is correct
49 Correct 71 ms 32848 KB Output is correct
50 Correct 78 ms 32848 KB Output is correct
51 Correct 63 ms 42708 KB Output is correct
52 Correct 64 ms 42460 KB Output is correct
53 Correct 42 ms 21480 KB Output is correct
54 Correct 41 ms 21452 KB Output is correct
55 Correct 75 ms 21500 KB Output is correct
56 Correct 70 ms 21588 KB Output is correct
57 Correct 105 ms 25608 KB Output is correct
58 Correct 118 ms 25292 KB Output is correct
59 Correct 87 ms 25172 KB Output is correct
60 Correct 91 ms 24176 KB Output is correct
61 Correct 85 ms 33468 KB Output is correct
62 Correct 78 ms 33364 KB Output is correct
63 Correct 78 ms 33240 KB Output is correct
64 Correct 96 ms 33364 KB Output is correct
65 Correct 125 ms 25164 KB Output is correct
66 Correct 110 ms 22928 KB Output is correct
67 Correct 91 ms 22612 KB Output is correct
68 Correct 42 ms 20816 KB Output is correct
69 Correct 39 ms 20656 KB Output is correct
70 Correct 95 ms 34020 KB Output is correct
71 Correct 69 ms 32848 KB Output is correct
72 Correct 2 ms 12880 KB Output is correct
73 Correct 5 ms 13660 KB Output is correct
74 Correct 5 ms 13660 KB Output is correct
75 Correct 2 ms 12892 KB Output is correct
76 Correct 2 ms 12892 KB Output is correct
77 Correct 7 ms 14684 KB Output is correct
78 Correct 5 ms 13696 KB Output is correct
79 Correct 5 ms 13660 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 12892 KB Output is correct
83 Correct 3 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 25 ms 14752 KB Output is correct
87 Correct 21 ms 14800 KB Output is correct
88 Correct 21 ms 14804 KB Output is correct
89 Correct 9 ms 14768 KB Output is correct
90 Correct 6 ms 14028 KB Output is correct
91 Correct 23 ms 14848 KB Output is correct
92 Correct 23 ms 14820 KB Output is correct
93 Correct 2 ms 12892 KB Output is correct
94 Correct 89 ms 43860 KB Output is correct
95 Correct 85 ms 43348 KB Output is correct
96 Correct 81 ms 43264 KB Output is correct
97 Correct 69 ms 42700 KB Output is correct
98 Correct 67 ms 43044 KB Output is correct
99 Correct 120 ms 25512 KB Output is correct
100 Correct 104 ms 25632 KB Output is correct
101 Correct 97 ms 25608 KB Output is correct
102 Correct 97 ms 24536 KB Output is correct
103 Correct 85 ms 33312 KB Output is correct
104 Correct 85 ms 33464 KB Output is correct
105 Correct 72 ms 33464 KB Output is correct
106 Correct 74 ms 32592 KB Output is correct
107 Correct 69 ms 32852 KB Output is correct
108 Correct 67 ms 42660 KB Output is correct
109 Correct 65 ms 42488 KB Output is correct
110 Correct 45 ms 21456 KB Output is correct
111 Correct 42 ms 21460 KB Output is correct
112 Correct 66 ms 21328 KB Output is correct
113 Correct 65 ms 21416 KB Output is correct