oj.uz

Submission #951141

# Submission time Handle Problem Language Result Execution time Memory
951141 2024-03-21T08:30:19 Z inkvizytor Railway (BOI17_railway) C++14
100 / 100
 173 ms 38352 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;

int k;

int logarytm(int a) {
    int w = 0;
    while (a > 0) {
        w++;
        a /= 2;
    }
    return w+1;
}

int l;
vector<vector<pair<int, int>>> g;
vector<int> o;
vector<int> d;
vector<bool> odw;
vector<vector<int>> p;
vector<vector<int>> w;
vector<vector<int>> sp;
vector<vector<int>> jp;

void dfs (int v) {
    odw[v] = 1;
    for (int x : w[v]) {
        sp[x].push_back(v);
    }
    for (auto u : g[v]) {
        if (!odw[u.fi]) {
            o[u.fi] = v;
            d[u.fi] = d[v]+1;
            dfs(u.fi);
        }
    }
}

int lca (int a, int b) {
    int w;
    w = l-1;
    while (d[a] > d[b]) {
        if (d[jp[a][w]] >= d[b]) {
            a = jp[a][w];
        }
        w--;
    }
    w = l-1;
    while (d[b] > d[a]) {
        if (d[jp[b][w]] >= d[a]) {
            b = jp[b][w];
        }
        w--;
    }
    w = l-1;
    while (w >= 0) {
        if (jp[a][w] != jp[b][w]) {
            a = jp[a][w];
            b = jp[b][w];
        }
        w--;
    }
    if (a != b) {
        return o[a];
    }
    return a;
}

vector<bool> odw2;
vector<int> z;
vector<int> kr;

void dfs2 (int v, int ko) {
    odw2[v] = 1;
    for (auto u : g[v]) {
        if (!odw2[u.first]) {
            dfs2(u.first, u.second);
            z[v] += z[u.first];
        }
    }
    if (z[v] >= 2*k) {
        kr.push_back(ko);
    }
}

int main() {
    //ios_base::sync_with_stdio(0);
    //cin.tie(0);
    int n, m;
    cin >> n >> m >> k;
    g.resize(n+1);
    vector<pair<int, int>> s (n, make_pair(0, 0));
    for (int i = 1; i < n; i++) {
        int a, b;
        cin >> a >> b;
        g[a].push_back(make_pair(b, i));
        g[b].push_back(make_pair(a, i));
        s[i] = make_pair(a, b);
    }
    p.resize(m);
    w.resize(n+1);
    sp.resize(m);
    for (int i = 0; i < m; i++) {
        int s;
        cin >> s;
        p[i].resize(s);
        for (int j = 0; j < s; j++) {
            cin >> p[i][j];
            w[p[i][j]].push_back(i);
        }
    }
    o.resize(n+1, 0);
    d.resize(n+1, 0);
    odw.resize(n+1, 0);
    o[1] = 1;
    d[1] = 0;
    dfs(1);
    l = logarytm(n);
    jp.resize(n+1, vector<int>(l, 0));
    for (int i = 1; i < n+1; i++) {
        jp[i][0] = o[i];
    }
    for (int i = 1; i < l; i++) {
        for (int j = 1; j < n+1; j++) {
            jp[j][i] = jp[jp[j][i-1]][i-1];
        }
    }
    z.resize(n+1, 0);
    for (auto x : sp) {
        for (int i = 0; i < x.size()-1; i++) {
            z[x[i]]++;
            z[x[i+1]]++;
            z[lca(x[i], x[i+1])] -= 2;
        }
        z[x[0]]++;
        z[x[x.size()-1]]++;
        z[lca(x[0], x[x.size()-1])] -= 2;
    }
    odw2.resize(n+1, 0);
    dfs2(1, 0);
    cout << kr.size() << '\n';
    sort(kr.begin(), kr.end());
    for (int x : kr) {
        cout << x << ' ';
    }
}

Compilation message

railway.cpp: In function 'int main()':
railway.cpp:132:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  132 |         for (int i = 0; i < x.size()-1; i++) {
      |                         ~~^~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 7 ms 2652 KB Output is correct
3 Correct 8 ms 2652 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 9 ms 2908 KB Output is correct
7 Correct 8 ms 2652 KB Output is correct
8 Correct 7 ms 2652 KB Output is correct
9 Correct 7 ms 2904 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 440 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 600 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 7 ms 2652 KB Output is correct
3 Correct 8 ms 2652 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 9 ms 2908 KB Output is correct
7 Correct 8 ms 2652 KB Output is correct
8 Correct 7 ms 2652 KB Output is correct
9 Correct 7 ms 2904 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 440 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 600 KB Output is correct
15 Correct 31 ms 4440 KB Output is correct
16 Correct 32 ms 4488 KB Output is correct
17 Correct 32 ms 4440 KB Output is correct
18 Correct 9 ms 3164 KB Output is correct
19 Correct 8 ms 2648 KB Output is correct
20 Correct 36 ms 4904 KB Output is correct
21 Correct 37 ms 4700 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 8 ms 2652 KB Output is correct
24 Correct 7 ms 2648 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 8 ms 2908 KB Output is correct
28 Correct 7 ms 2652 KB Output is correct
29 Correct 6 ms 2652 KB Output is correct
30 Correct 6 ms 2652 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 344 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 155 ms 36972 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 170 ms 38104 KB Output is correct
4 Correct 157 ms 37512 KB Output is correct
5 Correct 146 ms 34352 KB Output is correct
6 Correct 173 ms 34464 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 31172 KB Output is correct
2 Correct 126 ms 29228 KB Output is correct
3 Correct 126 ms 28720 KB Output is correct
4 Correct 141 ms 29012 KB Output is correct
5 Correct 125 ms 28988 KB Output is correct
6 Correct 122 ms 32840 KB Output is correct
7 Correct 119 ms 32708 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 31172 KB Output is correct
2 Correct 126 ms 29228 KB Output is correct
3 Correct 126 ms 28720 KB Output is correct
4 Correct 141 ms 29012 KB Output is correct
5 Correct 125 ms 28988 KB Output is correct
6 Correct 122 ms 32840 KB Output is correct
7 Correct 119 ms 32708 KB Output is correct
8 Correct 124 ms 31316 KB Output is correct
9 Correct 135 ms 31316 KB Output is correct
10 Correct 128 ms 33632 KB Output is correct
11 Correct 143 ms 33588 KB Output is correct
12 Correct 93 ms 25168 KB Output is correct
13 Correct 93 ms 25176 KB Output is correct
14 Correct 114 ms 24776 KB Output is correct
15 Correct 116 ms 24748 KB Output is correct
16 Correct 127 ms 28960 KB Output is correct
17 Correct 124 ms 28752 KB Output is correct
18 Correct 133 ms 29016 KB Output is correct
19 Correct 139 ms 29028 KB Output is correct
20 Correct 123 ms 32848 KB Output is correct
21 Correct 124 ms 32980 KB Output is correct
22 Correct 133 ms 33156 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 7 ms 2652 KB Output is correct
3 Correct 8 ms 2652 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 9 ms 2908 KB Output is correct
7 Correct 8 ms 2652 KB Output is correct
8 Correct 7 ms 2652 KB Output is correct
9 Correct 7 ms 2904 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 440 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 600 KB Output is correct
15 Correct 31 ms 4440 KB Output is correct
16 Correct 32 ms 4488 KB Output is correct
17 Correct 32 ms 4440 KB Output is correct
18 Correct 9 ms 3164 KB Output is correct
19 Correct 8 ms 2648 KB Output is correct
20 Correct 36 ms 4904 KB Output is correct
21 Correct 37 ms 4700 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 8 ms 2652 KB Output is correct
24 Correct 7 ms 2648 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 8 ms 2908 KB Output is correct
28 Correct 7 ms 2652 KB Output is correct
29 Correct 6 ms 2652 KB Output is correct
30 Correct 6 ms 2652 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 155 ms 36972 KB Output is correct
37 Correct 0 ms 344 KB Output is correct
38 Correct 170 ms 38104 KB Output is correct
39 Correct 157 ms 37512 KB Output is correct
40 Correct 146 ms 34352 KB Output is correct
41 Correct 173 ms 34464 KB Output is correct
42 Correct 120 ms 31172 KB Output is correct
43 Correct 126 ms 29228 KB Output is correct
44 Correct 126 ms 28720 KB Output is correct
45 Correct 141 ms 29012 KB Output is correct
46 Correct 125 ms 28988 KB Output is correct
47 Correct 122 ms 32840 KB Output is correct
48 Correct 119 ms 32708 KB Output is correct
49 Correct 124 ms 31316 KB Output is correct
50 Correct 135 ms 31316 KB Output is correct
51 Correct 128 ms 33632 KB Output is correct
52 Correct 143 ms 33588 KB Output is correct
53 Correct 93 ms 25168 KB Output is correct
54 Correct 93 ms 25176 KB Output is correct
55 Correct 114 ms 24776 KB Output is correct
56 Correct 116 ms 24748 KB Output is correct
57 Correct 127 ms 28960 KB Output is correct
58 Correct 124 ms 28752 KB Output is correct
59 Correct 133 ms 29016 KB Output is correct
60 Correct 139 ms 29028 KB Output is correct
61 Correct 123 ms 32848 KB Output is correct
62 Correct 124 ms 32980 KB Output is correct
63 Correct 133 ms 33156 KB Output is correct
64 Correct 137 ms 33620 KB Output is correct
65 Correct 142 ms 30220 KB Output is correct
66 Correct 127 ms 26028 KB Output is correct
67 Correct 120 ms 25964 KB Output is correct
68 Correct 83 ms 24468 KB Output is correct
69 Correct 85 ms 24452 KB Output is correct
70 Correct 134 ms 33744 KB Output is correct
71 Correct 125 ms 31316 KB Output is correct
72 Correct 1 ms 348 KB Output is correct
73 Correct 7 ms 2660 KB Output is correct
74 Correct 7 ms 2648 KB Output is correct
75 Correct 0 ms 348 KB Output is correct
76 Correct 0 ms 348 KB Output is correct
77 Correct 8 ms 2908 KB Output is correct
78 Correct 7 ms 2652 KB Output is correct
79 Correct 6 ms 2652 KB Output is correct
80 Correct 7 ms 2648 KB Output is correct
81 Correct 1 ms 348 KB Output is correct
82 Correct 0 ms 348 KB Output is correct
83 Correct 0 ms 348 KB Output is correct
84 Correct 1 ms 348 KB Output is correct
85 Correct 0 ms 348 KB Output is correct
86 Correct 31 ms 4484 KB Output is correct
87 Correct 33 ms 4444 KB Output is correct
88 Correct 32 ms 4444 KB Output is correct
89 Correct 9 ms 3160 KB Output is correct
90 Correct 10 ms 2648 KB Output is correct
91 Correct 36 ms 4692 KB Output is correct
92 Correct 36 ms 4692 KB Output is correct
93 Correct 0 ms 348 KB Output is correct
94 Correct 157 ms 38352 KB Output is correct
95 Correct 152 ms 37844 KB Output is correct
96 Correct 152 ms 37456 KB Output is correct
97 Correct 152 ms 34184 KB Output is correct
98 Correct 139 ms 34508 KB Output is correct
99 Correct 138 ms 28976 KB Output is correct
100 Correct 127 ms 28728 KB Output is correct
101 Correct 124 ms 28852 KB Output is correct
102 Correct 121 ms 29248 KB Output is correct
103 Correct 132 ms 32728 KB Output is correct
104 Correct 130 ms 33072 KB Output is correct
105 Correct 121 ms 32596 KB Output is correct
106 Correct 127 ms 31500 KB Output is correct
107 Correct 125 ms 31172 KB Output is correct
108 Correct 131 ms 33736 KB Output is correct
109 Correct 130 ms 33620 KB Output is correct
110 Correct 104 ms 25564 KB Output is correct
111 Correct 98 ms 25240 KB Output is correct
112 Correct 112 ms 24656 KB Output is correct
113 Correct 112 ms 24744 KB Output is correct