oj.uz

Submission #643710

# Submission time Handle Problem Language Result Execution time Memory
643710 2022-09-22T19:26:42 Z ParsaS Railway (BOI17_railway) C++14
100 / 100
 112 ms 25720 KB 
// In the name of God
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define mp make_pair
typedef long long ll;
const int N = 1e5 + 5, MOD = 1e9 + 7, L = 20;
int n, m, k;
vector<pair<int, int> > adj[N];
vector<int> ans;
int dp[N], tin[N], tout[N], up[N][L];
int T;

void dfs(int v, int p) {
    up[v][0] = p;
    for (int l = 1; l < L; l++)
        up[v][l] = up[up[v][l - 1]][l - 1];
    tin[v] = ++T;
    for (auto [u, i] : adj[v]) {
        if (u != p)
            dfs(u, v);
    }
    tout[v] = ++T;
}
bool anc(int v, int u) {
    return tin[v] <= tin[u] && tout[v] >= tin[u];
}
int lca(int v, int u) {
    if (tin[v] > tin[u])
        swap(v, u);
    if (anc(v, u))
        return v;
    for (int l = L - 1; l >= 0; l--)
        if (!anc(up[v][l], u))
            v = up[v][l];
    return up[v][0];
}

void dfs2(int v, int p, int e) {
    for (auto [u, i] : adj[v]) {
        if (u != p) {
            dfs2(u, v, i);
            dp[v] += dp[u];
        }
    }
    if (dp[v] >= k)
        ans.pb(e);
}

void solve() {
    cin >> n >> m >> k;
    for (int i = 0; i < n - 1; i++) {
        int v, u; cin >> v >> u;
        adj[v].pb(mp(u, i + 1)), adj[u].pb(mp(v, i + 1));
    }
    dfs(1, 0);
    tout[0] = 1e9;
    for (int i = 0; i < m; i++) {
        int s; cin >> s;
        vector<pair<int, int> > vec;
        for (int j = 0; j < s; j++) {
            int v; cin >> v;
            vec.pb(mp(tin[v], v));
        }
        sort(vec.begin(), vec.end());
        int l2 = vec[0].se;
        for (int i = 1; i < s; i++) {
            int l = lca(vec[i].se, vec[i - 1].se);
            l2 = lca(l, l2);
            dp[l]--;
            dp[vec[i - 1].se]++;
        }
        dp[l2]--;
        dp[vec.back().se]++;
    }
    dfs2(1, 0, 0);
    cout << ans.size() << '\n';
    sort(ans.begin(), ans.end());
    for (auto x : ans)
        cout << x << ' ';
    cout << '\n';
}

int32_t main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    solve();

    return 0;
}

Compilation message

railway.cpp: In function 'void dfs(int, int)':
railway.cpp:21:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   21 |     for (auto [u, i] : adj[v]) {
      |               ^
railway.cpp: In function 'void dfs2(int, int, int)':
railway.cpp:42:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   42 |     for (auto [u, i] : adj[v]) {
      |               ^

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 6 ms 3968 KB Output is correct
3 Correct 6 ms 4028 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 8 ms 4516 KB Output is correct
7 Correct 6 ms 4164 KB Output is correct
8 Correct 5 ms 3968 KB Output is correct
9 Correct 5 ms 4052 KB Output is correct
10 Correct 2 ms 2676 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 1 ms 2676 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 6 ms 3968 KB Output is correct
3 Correct 6 ms 4028 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 8 ms 4516 KB Output is correct
7 Correct 6 ms 4164 KB Output is correct
8 Correct 5 ms 3968 KB Output is correct
9 Correct 5 ms 4052 KB Output is correct
10 Correct 2 ms 2676 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 1 ms 2676 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 23 ms 4416 KB Output is correct
16 Correct 23 ms 4428 KB Output is correct
17 Correct 24 ms 4408 KB Output is correct
18 Correct 7 ms 4436 KB Output is correct
19 Correct 6 ms 4052 KB Output is correct
20 Correct 29 ms 4500 KB Output is correct
21 Correct 30 ms 4492 KB Output is correct
22 Correct 1 ms 2644 KB Output is correct
23 Correct 5 ms 4052 KB Output is correct
24 Correct 6 ms 3968 KB Output is correct
25 Correct 2 ms 2644 KB Output is correct
26 Correct 1 ms 2644 KB Output is correct
27 Correct 7 ms 4436 KB Output is correct
28 Correct 7 ms 4096 KB Output is correct
29 Correct 6 ms 4052 KB Output is correct
30 Correct 6 ms 4092 KB Output is correct
31 Correct 2 ms 2644 KB Output is correct
32 Correct 2 ms 2644 KB Output is correct
33 Correct 2 ms 2644 KB Output is correct
34 Correct 1 ms 2644 KB Output is correct
35 Correct 2 ms 2644 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 25280 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 60 ms 24944 KB Output is correct
4 Correct 59 ms 24356 KB Output is correct
5 Correct 59 ms 25212 KB Output is correct
6 Correct 63 ms 25672 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 20980 KB Output is correct
2 Correct 81 ms 17580 KB Output is correct
3 Correct 83 ms 17084 KB Output is correct
4 Correct 93 ms 17100 KB Output is correct
5 Correct 78 ms 17096 KB Output is correct
6 Correct 65 ms 21084 KB Output is correct
7 Correct 68 ms 20940 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 20980 KB Output is correct
2 Correct 81 ms 17580 KB Output is correct
3 Correct 83 ms 17084 KB Output is correct
4 Correct 93 ms 17100 KB Output is correct
5 Correct 78 ms 17096 KB Output is correct
6 Correct 65 ms 21084 KB Output is correct
7 Correct 68 ms 20940 KB Output is correct
8 Correct 76 ms 21068 KB Output is correct
9 Correct 85 ms 21276 KB Output is correct
10 Correct 59 ms 25384 KB Output is correct
11 Correct 80 ms 25324 KB Output is correct
12 Correct 72 ms 16884 KB Output is correct
13 Correct 66 ms 16956 KB Output is correct
14 Correct 89 ms 17068 KB Output is correct
15 Correct 85 ms 17076 KB Output is correct
16 Correct 81 ms 17140 KB Output is correct
17 Correct 82 ms 17100 KB Output is correct
18 Correct 83 ms 17100 KB Output is correct
19 Correct 82 ms 17500 KB Output is correct
20 Correct 67 ms 21388 KB Output is correct
21 Correct 71 ms 21364 KB Output is correct
22 Correct 66 ms 21288 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 6 ms 3968 KB Output is correct
3 Correct 6 ms 4028 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 8 ms 4516 KB Output is correct
7 Correct 6 ms 4164 KB Output is correct
8 Correct 5 ms 3968 KB Output is correct
9 Correct 5 ms 4052 KB Output is correct
10 Correct 2 ms 2676 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 1 ms 2676 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 23 ms 4416 KB Output is correct
16 Correct 23 ms 4428 KB Output is correct
17 Correct 24 ms 4408 KB Output is correct
18 Correct 7 ms 4436 KB Output is correct
19 Correct 6 ms 4052 KB Output is correct
20 Correct 29 ms 4500 KB Output is correct
21 Correct 30 ms 4492 KB Output is correct
22 Correct 1 ms 2644 KB Output is correct
23 Correct 5 ms 4052 KB Output is correct
24 Correct 6 ms 3968 KB Output is correct
25 Correct 2 ms 2644 KB Output is correct
26 Correct 1 ms 2644 KB Output is correct
27 Correct 7 ms 4436 KB Output is correct
28 Correct 7 ms 4096 KB Output is correct
29 Correct 6 ms 4052 KB Output is correct
30 Correct 6 ms 4092 KB Output is correct
31 Correct 2 ms 2644 KB Output is correct
32 Correct 2 ms 2644 KB Output is correct
33 Correct 2 ms 2644 KB Output is correct
34 Correct 1 ms 2644 KB Output is correct
35 Correct 2 ms 2644 KB Output is correct
36 Correct 75 ms 25280 KB Output is correct
37 Correct 2 ms 2644 KB Output is correct
38 Correct 60 ms 24944 KB Output is correct
39 Correct 59 ms 24356 KB Output is correct
40 Correct 59 ms 25212 KB Output is correct
41 Correct 63 ms 25672 KB Output is correct
42 Correct 70 ms 20980 KB Output is correct
43 Correct 81 ms 17580 KB Output is correct
44 Correct 83 ms 17084 KB Output is correct
45 Correct 93 ms 17100 KB Output is correct
46 Correct 78 ms 17096 KB Output is correct
47 Correct 65 ms 21084 KB Output is correct
48 Correct 68 ms 20940 KB Output is correct
49 Correct 76 ms 21068 KB Output is correct
50 Correct 85 ms 21276 KB Output is correct
51 Correct 59 ms 25384 KB Output is correct
52 Correct 80 ms 25324 KB Output is correct
53 Correct 72 ms 16884 KB Output is correct
54 Correct 66 ms 16956 KB Output is correct
55 Correct 89 ms 17068 KB Output is correct
56 Correct 85 ms 17076 KB Output is correct
57 Correct 81 ms 17140 KB Output is correct
58 Correct 82 ms 17100 KB Output is correct
59 Correct 83 ms 17100 KB Output is correct
60 Correct 82 ms 17500 KB Output is correct
61 Correct 67 ms 21388 KB Output is correct
62 Correct 71 ms 21364 KB Output is correct
63 Correct 66 ms 21288 KB Output is correct
64 Correct 70 ms 21308 KB Output is correct
65 Correct 91 ms 17164 KB Output is correct
66 Correct 112 ms 17096 KB Output is correct
67 Correct 90 ms 17100 KB Output is correct
68 Correct 62 ms 16824 KB Output is correct
69 Correct 60 ms 16884 KB Output is correct
70 Correct 75 ms 21564 KB Output is correct
71 Correct 84 ms 20944 KB Output is correct
72 Correct 2 ms 2644 KB Output is correct
73 Correct 6 ms 3968 KB Output is correct
74 Correct 6 ms 4052 KB Output is correct
75 Correct 2 ms 2676 KB Output is correct
76 Correct 2 ms 2644 KB Output is correct
77 Correct 6 ms 4436 KB Output is correct
78 Correct 7 ms 4052 KB Output is correct
79 Correct 5 ms 4052 KB Output is correct
80 Correct 5 ms 4052 KB Output is correct
81 Correct 2 ms 2644 KB Output is correct
82 Correct 2 ms 2644 KB Output is correct
83 Correct 2 ms 2644 KB Output is correct
84 Correct 2 ms 2672 KB Output is correct
85 Correct 2 ms 2680 KB Output is correct
86 Correct 25 ms 4340 KB Output is correct
87 Correct 24 ms 4428 KB Output is correct
88 Correct 23 ms 4432 KB Output is correct
89 Correct 7 ms 4436 KB Output is correct
90 Correct 6 ms 4052 KB Output is correct
91 Correct 27 ms 4636 KB Output is correct
92 Correct 29 ms 4480 KB Output is correct
93 Correct 2 ms 2644 KB Output is correct
94 Correct 70 ms 25284 KB Output is correct
95 Correct 70 ms 24952 KB Output is correct
96 Correct 58 ms 24356 KB Output is correct
97 Correct 62 ms 25304 KB Output is correct
98 Correct 69 ms 25720 KB Output is correct
99 Correct 81 ms 17116 KB Output is correct
100 Correct 81 ms 17100 KB Output is correct
101 Correct 85 ms 17404 KB Output is correct
102 Correct 84 ms 17516 KB Output is correct
103 Correct 67 ms 21008 KB Output is correct
104 Correct 67 ms 21392 KB Output is correct
105 Correct 65 ms 20988 KB Output is correct
106 Correct 75 ms 21180 KB Output is correct
107 Correct 94 ms 21064 KB Output is correct
108 Correct 60 ms 25360 KB Output is correct
109 Correct 57 ms 25332 KB Output is correct
110 Correct 68 ms 16880 KB Output is correct
111 Correct 69 ms 16876 KB Output is correct
112 Correct 95 ms 17128 KB Output is correct
113 Correct 81 ms 17036 KB Output is correct