oj.uz

답안 #871961

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
871961 2023-11-12T04:50:39 Z sleepntsheep Railway (BOI17_railway) C++17
100 / 100
 76 ms 17112 KB 
#include <iostream>
#include <cassert>
#include <stack>
#include <cstring>
#include <vector>
#include <algorithm>
#include <deque>
#include <set>
#include <utility>
#include <array>

using i64 = long long;
using u64 = unsigned long long;
using f64 = double;
using f80 = long double;

using namespace std;
#define ALL(x) x.begin(), x.end()
#define ShinLena cin.tie(nullptr)->sync_with_stdio(false);
#define N 100000

int n, m, k, h[N], alloc, tin[N], tout[N], timer, P[N], J[N], L[N], CH[N], CI[N], HC[N], htimer, t[N+2], EID[N], RV[N];
struct {int v, l; } g[2*N-1];

inline void add_edge(int u, int v) { g[++alloc] = {v, h[u]}; h[u] = alloc; }

int dfs(int u, int p)
{
    int hvsz{-1}, sz{1};
    tin[u] = ++timer; HC[u] = -1;
    for (auto j = h[u]; j; j = g[j].l) if (g[j].v != p)
    {
        P[g[j].v] = u; L[g[j].v] = L[u] + 1;
        if (L[u] - L[J[u]] == L[J[u]] - L[J[J[u]]]) J[g[j].v] = J[J[u]];
        else J[g[j].v] = u;
        int sub {dfs(g[j].v, u)};
        EID[g[j].v] = j;
        if (sub > hvsz) HC[u] = g[j].v, hvsz = sub;
        sz += sub;
    }
    tout[u] = timer;
    return sz;
}

void hld(int u, int hh)
{
    RV[CI[u] = ++htimer] = u; CH[u] = hh;
    if (HC[u] != -1) hld(HC[u], hh);
    for (auto j = h[u]; j; j = g[j].l)
        if (g[j].v != P[u] && g[j].v != HC[u]) hld(g[j].v, g[j].v);
}

inline int kth(int u, int k)
{
    int dep { L[u] - k };
    for (; L[u] > dep;)
    {
        if (L[J[u]] >= dep) u = J[u];
        else u = P[u];
    }
    return u;
}

inline int lca(int u, int v)
{
    if (L[u] < L[v]) swap(u, v);
    for (; L[u] > L[v];)
    {
        if (L[J[u]] >= L[v]) u = J[u];
        else u = P[u];
    }
    for (; u != v;)
    {
        if (J[u] == J[v]) u = P[u], v = P[v];
        else u = J[u], v = J[v];
    }
    return u;
}

inline void updup(int u, int a)
{
    assert(L[u] >= L[a] && tin[a] <= tin[u] && tout[u] <= tout[a]);
    for (; CH[u] != CH[a]; u = P[CH[u]])
    {
        ++t[CI[CH[u]]];
        --t[CI[u]+1];
    }
    ++t[CI[a]];
    --t[CI[u]+1];
}

int main()
{
    ShinLena;
    cin >> n >> m >> k;
    for (int i = 1, u, v; i < n; ++i) cin >> u >> v, --u, --v, add_edge(u, v), add_edge(v, u);

    dfs(0, 0);
    hld(0, 0);

    for (int s, i = 0; i < m; ++i)
    {
        cin >> s;
        vector<pair<int, int>> a(s);
        for (auto &[x, y] : a) cin >> y, --y, x = tin[y];
        sort(ALL(a));
        for (u64 y = a.size(), i = 1; i < y; ++i)
        {
            int lc = lca(a[i].second, a[i-1].second);
            a.emplace_back(tin[lc], lc);
        }
        sort(ALL(a));
        a.erase(unique(ALL(a)), a.end());
        stack<int> st;
        for (auto [_, x] : a)
        {
            while (st.size() && !(tin[st.top()] <= tin[x] && tout[x] <= tout[st.top()])) st.pop();
            if (st.size()) updup(x, kth(x, L[x] - L[st.top()] - 1));
            st.push(x);
        }
    }

    vector<int> ans;
    for (auto i = 1; i <= n; ++i)
    {
        t[i] += i ? t[i-1] : 0;
        if (t[i] >= k) ans.push_back((1+EID[RV[i]])/2);
    }
    sort(ALL(ans));
    cout << ans.size() << '\n';
    for (auto x : ans) cout << x << ' ';

    return 0;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 3 ms 2908 KB Output is correct
3 Correct 3 ms 2908 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 3 ms 3420 KB Output is correct
7 Correct 3 ms 2908 KB Output is correct
8 Correct 2 ms 2904 KB Output is correct
9 Correct 2 ms 2904 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 3 ms 2908 KB Output is correct
3 Correct 3 ms 2908 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 3 ms 3420 KB Output is correct
7 Correct 3 ms 2908 KB Output is correct
8 Correct 2 ms 2904 KB Output is correct
9 Correct 2 ms 2904 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 25 ms 2908 KB Output is correct
16 Correct 19 ms 2908 KB Output is correct
17 Correct 20 ms 3060 KB Output is correct
18 Correct 3 ms 3416 KB Output is correct
19 Correct 4 ms 2908 KB Output is correct
20 Correct 11 ms 2908 KB Output is correct
21 Correct 15 ms 2908 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 3 ms 2992 KB Output is correct
24 Correct 4 ms 2912 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 3 ms 3420 KB Output is correct
28 Correct 3 ms 2964 KB Output is correct
29 Correct 2 ms 2908 KB Output is correct
30 Correct 2 ms 2908 KB Output is correct
31 Correct 1 ms 2396 KB Output is correct
32 Correct 1 ms 2396 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 1 ms 2392 KB Output is correct
35 Correct 1 ms 2396 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 60 ms 16852 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 58 ms 16604 KB Output is correct
4 Correct 56 ms 15964 KB Output is correct
5 Correct 76 ms 17112 KB Output is correct
6 Correct 60 ms 16988 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 11356 KB Output is correct
2 Correct 40 ms 7004 KB Output is correct
3 Correct 40 ms 6604 KB Output is correct
4 Correct 37 ms 6492 KB Output is correct
5 Correct 39 ms 6492 KB Output is correct
6 Correct 45 ms 11356 KB Output is correct
7 Correct 45 ms 11404 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 11356 KB Output is correct
2 Correct 40 ms 7004 KB Output is correct
3 Correct 40 ms 6604 KB Output is correct
4 Correct 37 ms 6492 KB Output is correct
5 Correct 39 ms 6492 KB Output is correct
6 Correct 45 ms 11356 KB Output is correct
7 Correct 45 ms 11404 KB Output is correct
8 Correct 51 ms 11356 KB Output is correct
9 Correct 53 ms 11484 KB Output is correct
10 Correct 64 ms 17092 KB Output is correct
11 Correct 63 ms 17100 KB Output is correct
12 Correct 28 ms 6492 KB Output is correct
13 Correct 30 ms 6736 KB Output is correct
14 Correct 41 ms 6688 KB Output is correct
15 Correct 40 ms 6492 KB Output is correct
16 Correct 38 ms 6700 KB Output is correct
17 Correct 38 ms 6500 KB Output is correct
18 Correct 37 ms 6688 KB Output is correct
19 Correct 39 ms 7004 KB Output is correct
20 Correct 51 ms 11604 KB Output is correct
21 Correct 47 ms 11792 KB Output is correct
22 Correct 45 ms 11600 KB Output is correct

Subtask #6
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 3 ms 2908 KB Output is correct
3 Correct 3 ms 2908 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 3 ms 3420 KB Output is correct
7 Correct 3 ms 2908 KB Output is correct
8 Correct 2 ms 2904 KB Output is correct
9 Correct 2 ms 2904 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 25 ms 2908 KB Output is correct
16 Correct 19 ms 2908 KB Output is correct
17 Correct 20 ms 3060 KB Output is correct
18 Correct 3 ms 3416 KB Output is correct
19 Correct 4 ms 2908 KB Output is correct
20 Correct 11 ms 2908 KB Output is correct
21 Correct 15 ms 2908 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 3 ms 2992 KB Output is correct
24 Correct 4 ms 2912 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 3 ms 3420 KB Output is correct
28 Correct 3 ms 2964 KB Output is correct
29 Correct 2 ms 2908 KB Output is correct
30 Correct 2 ms 2908 KB Output is correct
31 Correct 1 ms 2396 KB Output is correct
32 Correct 1 ms 2396 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 1 ms 2392 KB Output is correct
35 Correct 1 ms 2396 KB Output is correct
36 Correct 60 ms 16852 KB Output is correct
37 Correct 1 ms 2392 KB Output is correct
38 Correct 58 ms 16604 KB Output is correct
39 Correct 56 ms 15964 KB Output is correct
40 Correct 76 ms 17112 KB Output is correct
41 Correct 60 ms 16988 KB Output is correct
42 Correct 43 ms 11356 KB Output is correct
43 Correct 40 ms 7004 KB Output is correct
44 Correct 40 ms 6604 KB Output is correct
45 Correct 37 ms 6492 KB Output is correct
46 Correct 39 ms 6492 KB Output is correct
47 Correct 45 ms 11356 KB Output is correct
48 Correct 45 ms 11404 KB Output is correct
49 Correct 51 ms 11356 KB Output is correct
50 Correct 53 ms 11484 KB Output is correct
51 Correct 64 ms 17092 KB Output is correct
52 Correct 63 ms 17100 KB Output is correct
53 Correct 28 ms 6492 KB Output is correct
54 Correct 30 ms 6736 KB Output is correct
55 Correct 41 ms 6688 KB Output is correct
56 Correct 40 ms 6492 KB Output is correct
57 Correct 38 ms 6700 KB Output is correct
58 Correct 38 ms 6500 KB Output is correct
59 Correct 37 ms 6688 KB Output is correct
60 Correct 39 ms 7004 KB Output is correct
61 Correct 51 ms 11604 KB Output is correct
62 Correct 47 ms 11792 KB Output is correct
63 Correct 45 ms 11600 KB Output is correct
64 Correct 47 ms 11660 KB Output is correct
65 Correct 46 ms 6492 KB Output is correct
66 Correct 50 ms 6492 KB Output is correct
67 Correct 43 ms 6492 KB Output is correct
68 Correct 25 ms 6492 KB Output is correct
69 Correct 26 ms 6496 KB Output is correct
70 Correct 49 ms 11992 KB Output is correct
71 Correct 53 ms 11356 KB Output is correct
72 Correct 1 ms 2396 KB Output is correct
73 Correct 2 ms 2908 KB Output is correct
74 Correct 2 ms 2908 KB Output is correct
75 Correct 0 ms 2396 KB Output is correct
76 Correct 0 ms 2396 KB Output is correct
77 Correct 3 ms 3420 KB Output is correct
78 Correct 3 ms 2904 KB Output is correct
79 Correct 2 ms 2908 KB Output is correct
80 Correct 2 ms 2940 KB Output is correct
81 Correct 1 ms 2396 KB Output is correct
82 Correct 1 ms 2396 KB Output is correct
83 Correct 1 ms 2396 KB Output is correct
84 Correct 0 ms 2396 KB Output is correct
85 Correct 0 ms 2396 KB Output is correct
86 Correct 18 ms 2908 KB Output is correct
87 Correct 19 ms 2988 KB Output is correct
88 Correct 19 ms 2992 KB Output is correct
89 Correct 3 ms 3420 KB Output is correct
90 Correct 3 ms 2908 KB Output is correct
91 Correct 11 ms 2908 KB Output is correct
92 Correct 14 ms 2992 KB Output is correct
93 Correct 0 ms 2396 KB Output is correct
94 Correct 63 ms 17000 KB Output is correct
95 Correct 61 ms 16600 KB Output is correct
96 Correct 55 ms 16084 KB Output is correct
97 Correct 71 ms 17000 KB Output is correct
98 Correct 61 ms 17104 KB Output is correct
99 Correct 39 ms 6488 KB Output is correct
100 Correct 39 ms 6492 KB Output is correct
101 Correct 42 ms 6696 KB Output is correct
102 Correct 37 ms 7004 KB Output is correct
103 Correct 41 ms 11300 KB Output is correct
104 Correct 44 ms 11732 KB Output is correct
105 Correct 41 ms 11352 KB Output is correct
106 Correct 52 ms 11600 KB Output is correct
107 Correct 56 ms 11868 KB Output is correct
108 Correct 62 ms 16988 KB Output is correct
109 Correct 64 ms 17104 KB Output is correct
110 Correct 34 ms 6492 KB Output is correct
111 Correct 30 ms 6492 KB Output is correct
112 Correct 40 ms 6492 KB Output is correct
113 Correct 40 ms 6492 KB Output is correct