oj.uz

Submission #498627

# Submission time Handle Problem Language Result Execution time Memory
498627 2021-12-25T21:04:01 Z Johann Railway (BOI17_railway) C++14
100 / 100
 243 ms 65588 KB 
// https://oj.uz/problem/view/BOI17_railway

#include<bits/stdc++.h>
using namespace std;

#define ll long long
#define pii pair<int, int>
#define tiii tuple<int,int,int>
#define vi vector<ll>
#define vvi vector<vi>
#define vpii vector<pii>
#define vtiii vector<tiii>


void dfs(vvi & adj, int v, int p, vi & in, vi & out, vvi & vorg, int & cnt, vi & depth, int d) {
    in[v] = cnt++;
    vorg[v].push_back(p); // erster vorg
    for (int i = 1; 1 << (i-1) < vorg.size(); i++) {
        vorg[v].push_back(vorg[vorg[v][i-1]][i-1]);
    }
    depth[v] = d;

    for (int u : adj[v]) {
        if (u == p) continue;
        dfs(adj, u, v, in, out, vorg, cnt, depth, d+1);
    }

    out[v] = cnt++;
}

void dfs2(vvi & adj, int v, int p, vi & in, vi & out, vi & summe, vi & edges, map<pii,int> & mapping, int k) {
    int d = summe[in[v]] - summe[out[v]];
    if (d >= k) {
        if (v > p) edges.push_back(mapping[{ p, v }]);
        else edges.push_back(mapping[{ v, p }]);
    }

    for (int u : adj[v]) {
        if (u == p) continue;
        dfs2(adj, u, v, in, out, summe, edges, mapping, k);
    }
}

int lift(vvi & vorg, int a, int k) {
    if (k == 0) return a;
    int i = floor(log2(k));
    return lift(vorg, vorg[a][i], k - (1 << i));
}

bool is_predecessor(int u, int v, vi & in, vi & out) { // u Vorgänger von v
    return in[u] <= in[v] && out[u] >= out[v];
}

int lca(vvi & vorg, vi & in, vi & out, int u, int v) {
    if (is_predecessor(u,v,in,out)) return u;
    if (is_predecessor(v,u,in,out)) return v;

    for (int i = vorg[0].size(); i >= 0; --i) {
        if (!is_predecessor(vorg[u][i], v, in, out))
            u = vorg[u][i];
    }
    return vorg[u][0];
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    map<pii, int> mapping;
    int n,m,k;
    cin >> n >> m >> k;
    vvi adj(n);
    for (int i = 1,a,b; i < n; i++) {
        cin >> a >> b;
        a--; b--;
        adj[a].push_back(b);
        adj[b].push_back(a);
        if (a > b) swap(a,b);
        mapping[make_pair(a,b)] = i;
    }

    // root = 0;
    vi in(n);
    vi out(n);
    vi depth(n);
    vvi vorg(n);
    int cnt = 0;
    dfs(adj, 0, 0, in, out, vorg, cnt, depth, 0);
    vi pref(2 * n);

    for (int i = 0,s; i < m; i++) {
        cin >> s;
        vpii neighbors(s);
        for (int j = 0,l; j < s; j++) {
            cin >> l; l--;
            neighbors[j] = make_pair( in[l], l );
        }
        sort(neighbors.begin(), neighbors.end());
        int current_lca = neighbors[0].second; // der lca aller bisher betrachteten Knoten
        for (int j = 1; j < s; j++) {
            int v = neighbors[j-1].second;
            int u = neighbors[j].second;
            int l = lca(vorg,in,out,v,u);
            if (in[l] < in[current_lca]) {
                // hier ist der current lca unter dem aktuellen lca
                pref[in[l]+1]++;
                pref[in[current_lca]+1]--;
                pref[in[l]+1]++;
                pref[in[u]+1]--;
                current_lca = l;
            } else {
                // hier ist der gefunden lca unter dem akutellen lca
                pref[in[l]+1]++;
                pref[in[u]+1]--;
            }
        }
    }

    vi summe(2 * n + 1);
    partial_sum(pref.begin(), pref.end(), summe.begin());
    vi edges;
    dfs2(adj, 0, 0, in, out, summe, edges, mapping, k);
    sort(edges.begin(), edges.end());
    cout << edges.size() << "\n";
    for (int e : edges) {
        cout << e << " ";
    }

}

Compilation message

railway.cpp: In function 'void dfs(std::vector<std::vector<long long int> >&, int, int, std::vector<long long int>&, std::vector<long long int>&, std::vector<std::vector<long long int> >&, int&, std::vector<long long int>&, int)':
railway.cpp:18:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |     for (int i = 1; 1 << (i-1) < vorg.size(); i++) {
      |                     ~~~~~~~~~~~^~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 8 ms 3660 KB Output is correct
3 Correct 8 ms 3772 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 9 ms 4680 KB Output is correct
7 Correct 9 ms 3916 KB Output is correct
8 Correct 11 ms 3760 KB Output is correct
9 Correct 8 ms 3780 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 8 ms 3660 KB Output is correct
3 Correct 8 ms 3772 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 9 ms 4680 KB Output is correct
7 Correct 9 ms 3916 KB Output is correct
8 Correct 11 ms 3760 KB Output is correct
9 Correct 8 ms 3780 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 23 ms 3804 KB Output is correct
16 Correct 20 ms 3896 KB Output is correct
17 Correct 23 ms 3892 KB Output is correct
18 Correct 11 ms 4544 KB Output is correct
19 Correct 9 ms 3944 KB Output is correct
20 Correct 21 ms 3924 KB Output is correct
21 Correct 23 ms 3804 KB Output is correct
22 Correct 1 ms 312 KB Output is correct
23 Correct 9 ms 3776 KB Output is correct
24 Correct 8 ms 3764 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 9 ms 4680 KB Output is correct
28 Correct 9 ms 3888 KB Output is correct
29 Correct 8 ms 3788 KB Output is correct
30 Correct 14 ms 3788 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 0 ms 308 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 137 ms 63336 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 198 ms 62964 KB Output is correct
4 Correct 128 ms 62212 KB Output is correct
5 Correct 135 ms 63480 KB Output is correct
6 Correct 150 ms 65580 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 175 ms 54736 KB Output is correct
2 Correct 155 ms 47980 KB Output is correct
3 Correct 182 ms 47172 KB Output is correct
4 Correct 157 ms 47080 KB Output is correct
5 Correct 158 ms 47144 KB Output is correct
6 Correct 183 ms 55056 KB Output is correct
7 Correct 163 ms 54928 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 175 ms 54736 KB Output is correct
2 Correct 155 ms 47980 KB Output is correct
3 Correct 182 ms 47172 KB Output is correct
4 Correct 157 ms 47080 KB Output is correct
5 Correct 158 ms 47144 KB Output is correct
6 Correct 183 ms 55056 KB Output is correct
7 Correct 163 ms 54928 KB Output is correct
8 Correct 177 ms 55152 KB Output is correct
9 Correct 186 ms 55108 KB Output is correct
10 Correct 135 ms 63652 KB Output is correct
11 Correct 148 ms 63672 KB Output is correct
12 Correct 141 ms 47308 KB Output is correct
13 Correct 127 ms 47272 KB Output is correct
14 Correct 164 ms 47136 KB Output is correct
15 Correct 166 ms 47152 KB Output is correct
16 Correct 153 ms 47140 KB Output is correct
17 Correct 159 ms 47144 KB Output is correct
18 Correct 160 ms 47108 KB Output is correct
19 Correct 145 ms 47924 KB Output is correct
20 Correct 182 ms 55372 KB Output is correct
21 Correct 210 ms 55504 KB Output is correct
22 Correct 158 ms 55368 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 8 ms 3660 KB Output is correct
3 Correct 8 ms 3772 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 9 ms 4680 KB Output is correct
7 Correct 9 ms 3916 KB Output is correct
8 Correct 11 ms 3760 KB Output is correct
9 Correct 8 ms 3780 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 23 ms 3804 KB Output is correct
16 Correct 20 ms 3896 KB Output is correct
17 Correct 23 ms 3892 KB Output is correct
18 Correct 11 ms 4544 KB Output is correct
19 Correct 9 ms 3944 KB Output is correct
20 Correct 21 ms 3924 KB Output is correct
21 Correct 23 ms 3804 KB Output is correct
22 Correct 1 ms 312 KB Output is correct
23 Correct 9 ms 3776 KB Output is correct
24 Correct 8 ms 3764 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 9 ms 4680 KB Output is correct
28 Correct 9 ms 3888 KB Output is correct
29 Correct 8 ms 3788 KB Output is correct
30 Correct 14 ms 3788 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 0 ms 308 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 137 ms 63336 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 198 ms 62964 KB Output is correct
39 Correct 128 ms 62212 KB Output is correct
40 Correct 135 ms 63480 KB Output is correct
41 Correct 150 ms 65580 KB Output is correct
42 Correct 175 ms 54736 KB Output is correct
43 Correct 155 ms 47980 KB Output is correct
44 Correct 182 ms 47172 KB Output is correct
45 Correct 157 ms 47080 KB Output is correct
46 Correct 158 ms 47144 KB Output is correct
47 Correct 183 ms 55056 KB Output is correct
48 Correct 163 ms 54928 KB Output is correct
49 Correct 177 ms 55152 KB Output is correct
50 Correct 186 ms 55108 KB Output is correct
51 Correct 135 ms 63652 KB Output is correct
52 Correct 148 ms 63672 KB Output is correct
53 Correct 141 ms 47308 KB Output is correct
54 Correct 127 ms 47272 KB Output is correct
55 Correct 164 ms 47136 KB Output is correct
56 Correct 166 ms 47152 KB Output is correct
57 Correct 153 ms 47140 KB Output is correct
58 Correct 159 ms 47144 KB Output is correct
59 Correct 160 ms 47108 KB Output is correct
60 Correct 145 ms 47924 KB Output is correct
61 Correct 182 ms 55372 KB Output is correct
62 Correct 210 ms 55504 KB Output is correct
63 Correct 158 ms 55368 KB Output is correct
64 Correct 162 ms 56948 KB Output is correct
65 Correct 165 ms 48864 KB Output is correct
66 Correct 243 ms 48760 KB Output is correct
67 Correct 161 ms 48708 KB Output is correct
68 Correct 131 ms 48596 KB Output is correct
69 Correct 166 ms 48580 KB Output is correct
70 Correct 170 ms 57320 KB Output is correct
71 Correct 179 ms 56512 KB Output is correct
72 Correct 1 ms 204 KB Output is correct
73 Correct 8 ms 3852 KB Output is correct
74 Correct 15 ms 3792 KB Output is correct
75 Correct 1 ms 204 KB Output is correct
76 Correct 1 ms 312 KB Output is correct
77 Correct 10 ms 4760 KB Output is correct
78 Correct 10 ms 3900 KB Output is correct
79 Correct 8 ms 3788 KB Output is correct
80 Correct 8 ms 3788 KB Output is correct
81 Correct 0 ms 204 KB Output is correct
82 Correct 1 ms 204 KB Output is correct
83 Correct 1 ms 204 KB Output is correct
84 Correct 1 ms 308 KB Output is correct
85 Correct 1 ms 204 KB Output is correct
86 Correct 21 ms 4220 KB Output is correct
87 Correct 22 ms 4164 KB Output is correct
88 Correct 28 ms 4292 KB Output is correct
89 Correct 11 ms 4684 KB Output is correct
90 Correct 14 ms 4044 KB Output is correct
91 Correct 32 ms 4368 KB Output is correct
92 Correct 23 ms 4272 KB Output is correct
93 Correct 0 ms 312 KB Output is correct
94 Correct 143 ms 65168 KB Output is correct
95 Correct 146 ms 64768 KB Output is correct
96 Correct 125 ms 63876 KB Output is correct
97 Correct 148 ms 65084 KB Output is correct
98 Correct 152 ms 65588 KB Output is correct
99 Correct 180 ms 48780 KB Output is correct
100 Correct 148 ms 48836 KB Output is correct
101 Correct 190 ms 48988 KB Output is correct
102 Correct 146 ms 49688 KB Output is correct
103 Correct 176 ms 56688 KB Output is correct
104 Correct 159 ms 57284 KB Output is correct
105 Correct 157 ms 56616 KB Output is correct
106 Correct 196 ms 56952 KB Output is correct
107 Correct 174 ms 56772 KB Output is correct
108 Correct 173 ms 65332 KB Output is correct
109 Correct 133 ms 65372 KB Output is correct
110 Correct 148 ms 48580 KB Output is correct
111 Correct 134 ms 48560 KB Output is correct
112 Correct 152 ms 48896 KB Output is correct
113 Correct 161 ms 48884 KB Output is correct