oj.uz

답안 #754200

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
754200 2023-06-07T07:48:53 Z hafo Railway (BOI17_railway) C++14
100 / 100
 134 ms 26832 KB 
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define pb push_back
#define pa pair<int, int>
#define pall pair<ll, int>
#define fi first
#define se second
#define TASK "test"
#define Size(x) (int) x.size()
#define all(x) x.begin(), x.end()
using namespace std;

template<typename T1, typename T2> bool mini (T1 &a, T2 b) {if(a > b) a = b; else return 0; return 1;}
template<typename T1, typename T2> bool maxi (T1 &a, T2 b) {if(a < b) a = b; else return 0; return 1;}

const int MOD = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 7;
const ll oo = 1e18 + 69;

int n, m, k, u, v, id[maxn], timer = 0, st[maxn], en[maxn], ex[maxn], res[maxn], edge_id[maxn];
vector<pa> g[maxn];

struct LCA {
    int p[LOG][maxn], f[maxn];

    void dfs(int u, int par) {
        id[u] = ++timer;
        p[0][u] = par;
        for(auto e:g[u]) {
            int v = e.fi;
            if(v == par) continue;
            f[v] = f[u] + 1;
            dfs(v, u);
        }
    }

    int get_lca(int u, int v) {
        if(f[u] < f[v]) swap(u, v);
        int k = f[u] - f[v];
        for(int i = 0; i < LOG; i++)
            if((k >> i) & 1) u = p[i][u];
        if(u == v) return u;
        for(int i = LOG - 1; i >= 0; i--)
        if(p[i][u] != p[i][v]) {
            u = p[i][u];
            v = p[i][v];
        }
        return p[0][u];
    }

    void init() {
        f[1] = 0;
        dfs(1, 0);
        for(int i = 1; i < LOG; i++) {
            for(int u = 1; u <= n; u++) p[i][u] = p[i - 1][p[i - 1][u]];
        }
    }

    int jump(int u, int k) {
        for(int i = 0; i < LOG; i++)
            if((k >> i) & 1) u = p[i][u];
        return u;
    }

    void add(int u, int v) {
        int par = get_lca(u, v);
        st[u]++;
        st[v]++;
        en[par] += 2;
        if(u != par && v != par) ex[par]++;
        else {
            st[par]--;
            en[par]--;
        }
    }

    void update(int u, int v) {
        int par = get_lca(u, v);
        if(u != par) add(u, jump(u, f[u] - f[par] - 1));
        if(v != par) add(v, jump(v, f[v] - f[par] - 1));
    }

} lca;

bool cmp(int a, int b) {
    return id[a] < id[b];
}

void dfs(int u, int par) {
    for(auto e:g[u]) {
        int v = e.fi;
        if(v == par) continue;
        edge_id[v] = e.se;
        dfs(v, u);
        st[u] += st[v];
    }
    res[u] = st[u] - ex[u];
    st[u] -= en[u];
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    //freopen(TASK".inp", "r", stdin);
    //freopen(TASK".out", "w", stdout);

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

    lca.init();
    while(m--) {
        cin>>u;
        vector<int> a;
        for(int i = 0; i < u; i++) {
            cin>>v;
            a.pb(v);
        }
        sort(all(a), cmp);
        for(int i = 0; i < u; i++) {
            int j = (i + 1) % u;
            lca.update(a[i], a[j]);
        }
    }

    dfs(1, 0);
    vector<int> ans;
    for(int i = 1; i <= n; i++) {
        if(res[i] >= 2 * k) ans.pb(edge_id[i]);
    }
    cout<<Size(ans)<<"\n";
    sort(all(ans));
    for(auto i:ans) cout<<i<<" ";
    return 0;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 2772 KB Output is correct
2 Correct 6 ms 4248 KB Output is correct
3 Correct 6 ms 4236 KB Output is correct
4 Correct 2 ms 2692 KB Output is correct
5 Correct 2 ms 2772 KB Output is correct
6 Correct 7 ms 4748 KB Output is correct
7 Correct 6 ms 4308 KB Output is correct
8 Correct 6 ms 4240 KB Output is correct
9 Correct 6 ms 4236 KB Output is correct
10 Correct 2 ms 2772 KB Output is correct
11 Correct 2 ms 2772 KB Output is correct
12 Correct 2 ms 2688 KB Output is correct
13 Correct 2 ms 2772 KB Output is correct
14 Correct 2 ms 2772 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 2772 KB Output is correct
2 Correct 6 ms 4248 KB Output is correct
3 Correct 6 ms 4236 KB Output is correct
4 Correct 2 ms 2692 KB Output is correct
5 Correct 2 ms 2772 KB Output is correct
6 Correct 7 ms 4748 KB Output is correct
7 Correct 6 ms 4308 KB Output is correct
8 Correct 6 ms 4240 KB Output is correct
9 Correct 6 ms 4236 KB Output is correct
10 Correct 2 ms 2772 KB Output is correct
11 Correct 2 ms 2772 KB Output is correct
12 Correct 2 ms 2688 KB Output is correct
13 Correct 2 ms 2772 KB Output is correct
14 Correct 2 ms 2772 KB Output is correct
15 Correct 31 ms 4556 KB Output is correct
16 Correct 32 ms 4688 KB Output is correct
17 Correct 29 ms 4732 KB Output is correct
18 Correct 7 ms 4692 KB Output is correct
19 Correct 8 ms 4364 KB Output is correct
20 Correct 31 ms 4812 KB Output is correct
21 Correct 43 ms 4684 KB Output is correct
22 Correct 2 ms 2684 KB Output is correct
23 Correct 6 ms 4180 KB Output is correct
24 Correct 6 ms 4236 KB Output is correct
25 Correct 2 ms 2692 KB Output is correct
26 Correct 2 ms 2772 KB Output is correct
27 Correct 6 ms 4692 KB Output is correct
28 Correct 6 ms 4308 KB Output is correct
29 Correct 5 ms 4240 KB Output is correct
30 Correct 6 ms 4236 KB Output is correct
31 Correct 2 ms 2772 KB Output is correct
32 Correct 3 ms 2772 KB Output is correct
33 Correct 2 ms 2772 KB Output is correct
34 Correct 2 ms 2772 KB Output is correct
35 Correct 2 ms 2772 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 102 ms 26476 KB Output is correct
2 Correct 2 ms 2772 KB Output is correct
3 Correct 110 ms 26148 KB Output is correct
4 Correct 94 ms 25592 KB Output is correct
5 Correct 118 ms 26476 KB Output is correct
6 Correct 89 ms 26808 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 73 ms 21976 KB Output is correct
2 Correct 96 ms 18476 KB Output is correct
3 Correct 114 ms 18124 KB Output is correct
4 Correct 81 ms 17880 KB Output is correct
5 Correct 114 ms 18076 KB Output is correct
6 Correct 79 ms 22092 KB Output is correct
7 Correct 81 ms 22016 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 73 ms 21976 KB Output is correct
2 Correct 96 ms 18476 KB Output is correct
3 Correct 114 ms 18124 KB Output is correct
4 Correct 81 ms 17880 KB Output is correct
5 Correct 114 ms 18076 KB Output is correct
6 Correct 79 ms 22092 KB Output is correct
7 Correct 81 ms 22016 KB Output is correct
8 Correct 84 ms 22276 KB Output is correct
9 Correct 87 ms 22244 KB Output is correct
10 Correct 81 ms 26504 KB Output is correct
11 Correct 75 ms 26548 KB Output is correct
12 Correct 85 ms 18132 KB Output is correct
13 Correct 76 ms 18044 KB Output is correct
14 Correct 91 ms 18188 KB Output is correct
15 Correct 134 ms 18284 KB Output is correct
16 Correct 102 ms 17980 KB Output is correct
17 Correct 92 ms 17924 KB Output is correct
18 Correct 88 ms 17932 KB Output is correct
19 Correct 96 ms 18492 KB Output is correct
20 Correct 102 ms 22280 KB Output is correct
21 Correct 93 ms 22524 KB Output is correct
22 Correct 85 ms 22296 KB Output is correct

Subtask #6
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 2772 KB Output is correct
2 Correct 6 ms 4248 KB Output is correct
3 Correct 6 ms 4236 KB Output is correct
4 Correct 2 ms 2692 KB Output is correct
5 Correct 2 ms 2772 KB Output is correct
6 Correct 7 ms 4748 KB Output is correct
7 Correct 6 ms 4308 KB Output is correct
8 Correct 6 ms 4240 KB Output is correct
9 Correct 6 ms 4236 KB Output is correct
10 Correct 2 ms 2772 KB Output is correct
11 Correct 2 ms 2772 KB Output is correct
12 Correct 2 ms 2688 KB Output is correct
13 Correct 2 ms 2772 KB Output is correct
14 Correct 2 ms 2772 KB Output is correct
15 Correct 31 ms 4556 KB Output is correct
16 Correct 32 ms 4688 KB Output is correct
17 Correct 29 ms 4732 KB Output is correct
18 Correct 7 ms 4692 KB Output is correct
19 Correct 8 ms 4364 KB Output is correct
20 Correct 31 ms 4812 KB Output is correct
21 Correct 43 ms 4684 KB Output is correct
22 Correct 2 ms 2684 KB Output is correct
23 Correct 6 ms 4180 KB Output is correct
24 Correct 6 ms 4236 KB Output is correct
25 Correct 2 ms 2692 KB Output is correct
26 Correct 2 ms 2772 KB Output is correct
27 Correct 6 ms 4692 KB Output is correct
28 Correct 6 ms 4308 KB Output is correct
29 Correct 5 ms 4240 KB Output is correct
30 Correct 6 ms 4236 KB Output is correct
31 Correct 2 ms 2772 KB Output is correct
32 Correct 3 ms 2772 KB Output is correct
33 Correct 2 ms 2772 KB Output is correct
34 Correct 2 ms 2772 KB Output is correct
35 Correct 2 ms 2772 KB Output is correct
36 Correct 102 ms 26476 KB Output is correct
37 Correct 2 ms 2772 KB Output is correct
38 Correct 110 ms 26148 KB Output is correct
39 Correct 94 ms 25592 KB Output is correct
40 Correct 118 ms 26476 KB Output is correct
41 Correct 89 ms 26808 KB Output is correct
42 Correct 73 ms 21976 KB Output is correct
43 Correct 96 ms 18476 KB Output is correct
44 Correct 114 ms 18124 KB Output is correct
45 Correct 81 ms 17880 KB Output is correct
46 Correct 114 ms 18076 KB Output is correct
47 Correct 79 ms 22092 KB Output is correct
48 Correct 81 ms 22016 KB Output is correct
49 Correct 84 ms 22276 KB Output is correct
50 Correct 87 ms 22244 KB Output is correct
51 Correct 81 ms 26504 KB Output is correct
52 Correct 75 ms 26548 KB Output is correct
53 Correct 85 ms 18132 KB Output is correct
54 Correct 76 ms 18044 KB Output is correct
55 Correct 91 ms 18188 KB Output is correct
56 Correct 134 ms 18284 KB Output is correct
57 Correct 102 ms 17980 KB Output is correct
58 Correct 92 ms 17924 KB Output is correct
59 Correct 88 ms 17932 KB Output is correct
60 Correct 96 ms 18492 KB Output is correct
61 Correct 102 ms 22280 KB Output is correct
62 Correct 93 ms 22524 KB Output is correct
63 Correct 85 ms 22296 KB Output is correct
64 Correct 81 ms 22380 KB Output is correct
65 Correct 125 ms 18168 KB Output is correct
66 Correct 105 ms 18252 KB Output is correct
67 Correct 101 ms 18196 KB Output is correct
68 Correct 66 ms 18052 KB Output is correct
69 Correct 60 ms 18056 KB Output is correct
70 Correct 100 ms 22728 KB Output is correct
71 Correct 91 ms 22024 KB Output is correct
72 Correct 2 ms 2688 KB Output is correct
73 Correct 6 ms 4236 KB Output is correct
74 Correct 7 ms 4180 KB Output is correct
75 Correct 2 ms 2684 KB Output is correct
76 Correct 2 ms 2772 KB Output is correct
77 Correct 6 ms 4744 KB Output is correct
78 Correct 6 ms 4308 KB Output is correct
79 Correct 6 ms 4240 KB Output is correct
80 Correct 6 ms 4308 KB Output is correct
81 Correct 2 ms 2684 KB Output is correct
82 Correct 2 ms 2772 KB Output is correct
83 Correct 2 ms 2772 KB Output is correct
84 Correct 2 ms 2772 KB Output is correct
85 Correct 2 ms 2772 KB Output is correct
86 Correct 29 ms 4612 KB Output is correct
87 Correct 31 ms 4684 KB Output is correct
88 Correct 29 ms 4684 KB Output is correct
89 Correct 7 ms 4616 KB Output is correct
90 Correct 6 ms 4356 KB Output is correct
91 Correct 32 ms 4776 KB Output is correct
92 Correct 38 ms 4684 KB Output is correct
93 Correct 2 ms 2692 KB Output is correct
94 Correct 128 ms 26496 KB Output is correct
95 Correct 97 ms 26184 KB Output is correct
96 Correct 94 ms 25600 KB Output is correct
97 Correct 92 ms 26476 KB Output is correct
98 Correct 101 ms 26832 KB Output is correct
99 Correct 88 ms 17968 KB Output is correct
100 Correct 94 ms 18104 KB Output is correct
101 Correct 103 ms 17904 KB Output is correct
102 Correct 88 ms 18516 KB Output is correct
103 Correct 83 ms 21980 KB Output is correct
104 Correct 80 ms 22344 KB Output is correct
105 Correct 85 ms 22032 KB Output is correct
106 Correct 86 ms 22396 KB Output is correct
107 Correct 82 ms 22212 KB Output is correct
108 Correct 86 ms 26492 KB Output is correct
109 Correct 82 ms 26500 KB Output is correct
110 Correct 78 ms 18056 KB Output is correct
111 Correct 78 ms 18124 KB Output is correct
112 Correct 110 ms 18172 KB Output is correct
113 Correct 92 ms 18204 KB Output is correct