oj.uz

Submission #766648

# Submission time Handle Problem Language Result Execution time Memory
766648 2023-06-26T03:35:58 Z asdfgrace Railway (BOI17_railway) C++17
100 / 100
 74 ms 20676 KB 
#include <bits/stdc++.h>
using namespace std;
#define DEBUG(x) //x
#define A(x) DEBUG(assert(x))
#define PRINT(x) DEBUG(cerr << x)
#define PV(x) DEBUG(cerr << #x << " = " << x << '\n')
#define PV2(x) DEBUG(cerr << #x << " = " << x.first << ',' << x.second << '\n')
#define PAR(x) DEBUG(PRINT(#x << " = { "); for (auto y : x) PRINT(y << ' '); PRINT("}\n");)
#define PAR2(x) DEBUG(PRINT(#x << " = { "); for (auto [y, z] : x) PRINT(y << ',' << z << "  "); PRINT("}\n");)
typedef long long i64;
const int INF = 1000000007; //998244353;
 
struct S {
  int n, m, k, t;
  constexpr static int N = 100000, LOG = 20;
  array<vector<pair<int, int>>, N> edges;
  array<array<int, N>, LOG> anc;
  array<int, N> dep{}, ord, pos, subtree, val{}, in{};
 
  void run() {
    cin >> n >> m >> k;
    for (int i = 1; i < n; ++i) {
      int a, b;
      cin >> a >> b;
      --a; --b;
      edges[a].push_back({b, i});
      edges[b].push_back({a, i});
    }
    anc[0][0] = 0;
    for (int i = 0; i < n; ++i) subtree[i] = 1;
    t = 0;
    dfs(0);
    for (int jump = 1; jump < LOG; ++jump) {
      for (int i = 0; i < n; ++i) {
        anc[jump][i] = anc[jump - 1][anc[jump - 1][i]];
      }
    }
    
    for (int j = 0; j < m; ++j) {
      int x; cin >> x;
      vector<int> nodes(x + 1);
      for (int i = 0; i < x; ++i) {
        cin >> nodes[i]; --nodes[i];
      }
      sort(nodes.begin(), nodes.begin() + x, [&](int a, int b) {
        return pos[a] < pos[b];
      });
      nodes[x] = nodes[0];
      for (int i = 0; i < x; ++i) {
        int lca = LCA(nodes[i], nodes[i + 1]);
        ++val[nodes[i]];
        ++val[nodes[i + 1]];
        val[lca] -= 2;
      }
    }
    dfs2(0);
    vector<int> ans;
    for (int i = 1; i < n; ++i) {
      if (val[i] >= 2 * k) {
        ans.push_back(in[i]);
      }
    }
    sort(ans.begin(), ans.end());
    cout << ans.size() << '\n';
    for (int i = 0; i < ans.size(); ++i) {
      cout << ans[i] << (i + 1 == ans.size() ? '\n' : ' ');
    }
  }
  
  void dfs(int node) {
    pos[node] = t;
    ord[t++] = node;
    for (auto [next, id] : edges[node]) {
      if (next != anc[0][node]) {
        anc[0][next] = node;
        dep[next] = dep[node] + 1;
        in[next] = id;
        dfs(next);
        subtree[node] += subtree[next];
      }
    }
  }
  
  void dfs2(int node) {
    for (auto [next, id] : edges[node]) {
      if (next != anc[0][node]) {
        dfs2(next);
        val[node] += val[next];
      }
    }
  }
  
  int kth_anc(int k, int a) {
    for (int jump = LOG - 1; jump >= 0; --jump) {
      if (1 << jump <= k) {
        a = anc[jump][a];
        k -= 1 << jump;
      }
    }
    return a;
  }
  
  int LCA(int a, int b) {
    if (dep[a] < dep[b]) swap(a, b);
    a = kth_anc(dep[a] - dep[b], a);
    if (a == b) return a;
    for (int jump = LOG - 1; jump >= 0; --jump) {
      if (anc[jump][a] != anc[jump][b]) {
        a = anc[jump][a];
        b = anc[jump][b];
      }
    }
    return anc[0][a];
  }
};
 
int main() {
  ios::sync_with_stdio(0); cin.tie(0);
  auto sol = make_unique<S>();
  sol->run();
}

Compilation message

railway.cpp: In member function 'void S::run()':
railway.cpp:65:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |     for (int i = 0; i < ans.size(); ++i) {
      |                     ~~^~~~~~~~~~~~
railway.cpp:66:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |       cout << ans[i] << (i + 1 == ans.size() ? '\n' : ' ');
      |                          ~~~~~~^~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 12756 KB Output is correct
2 Correct 8 ms 13140 KB Output is correct
3 Correct 8 ms 13140 KB Output is correct
4 Correct 5 ms 12756 KB Output is correct
5 Correct 5 ms 12756 KB Output is correct
6 Correct 8 ms 13396 KB Output is correct
7 Correct 7 ms 13168 KB Output is correct
8 Correct 7 ms 13268 KB Output is correct
9 Correct 7 ms 13268 KB Output is correct
10 Correct 5 ms 12756 KB Output is correct
11 Correct 5 ms 12756 KB Output is correct
12 Correct 5 ms 12756 KB Output is correct
13 Correct 6 ms 12756 KB Output is correct
14 Correct 5 ms 12756 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 12756 KB Output is correct
2 Correct 8 ms 13140 KB Output is correct
3 Correct 8 ms 13140 KB Output is correct
4 Correct 5 ms 12756 KB Output is correct
5 Correct 5 ms 12756 KB Output is correct
6 Correct 8 ms 13396 KB Output is correct
7 Correct 7 ms 13168 KB Output is correct
8 Correct 7 ms 13268 KB Output is correct
9 Correct 7 ms 13268 KB Output is correct
10 Correct 5 ms 12756 KB Output is correct
11 Correct 5 ms 12756 KB Output is correct
12 Correct 5 ms 12756 KB Output is correct
13 Correct 6 ms 12756 KB Output is correct
14 Correct 5 ms 12756 KB Output is correct
15 Correct 17 ms 13140 KB Output is correct
16 Correct 18 ms 13192 KB Output is correct
17 Correct 18 ms 13288 KB Output is correct
18 Correct 8 ms 13396 KB Output is correct
19 Correct 8 ms 13184 KB Output is correct
20 Correct 16 ms 13268 KB Output is correct
21 Correct 19 ms 13228 KB Output is correct
22 Correct 5 ms 12756 KB Output is correct
23 Correct 7 ms 13140 KB Output is correct
24 Correct 7 ms 13216 KB Output is correct
25 Correct 5 ms 12756 KB Output is correct
26 Correct 6 ms 12820 KB Output is correct
27 Correct 8 ms 13396 KB Output is correct
28 Correct 8 ms 13156 KB Output is correct
29 Correct 7 ms 13168 KB Output is correct
30 Correct 7 ms 13268 KB Output is correct
31 Correct 5 ms 12756 KB Output is correct
32 Correct 5 ms 12756 KB Output is correct
33 Correct 6 ms 12756 KB Output is correct
34 Correct 5 ms 12756 KB Output is correct
35 Correct 5 ms 12756 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 20512 KB Output is correct
2 Correct 5 ms 12756 KB Output is correct
3 Correct 51 ms 20172 KB Output is correct
4 Correct 46 ms 19568 KB Output is correct
5 Correct 52 ms 20596 KB Output is correct
6 Correct 51 ms 20644 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 18288 KB Output is correct
2 Correct 49 ms 16736 KB Output is correct
3 Correct 50 ms 16556 KB Output is correct
4 Correct 50 ms 16496 KB Output is correct
5 Correct 50 ms 16460 KB Output is correct
6 Correct 46 ms 18404 KB Output is correct
7 Correct 44 ms 18260 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 18288 KB Output is correct
2 Correct 49 ms 16736 KB Output is correct
3 Correct 50 ms 16556 KB Output is correct
4 Correct 50 ms 16496 KB Output is correct
5 Correct 50 ms 16460 KB Output is correct
6 Correct 46 ms 18404 KB Output is correct
7 Correct 44 ms 18260 KB Output is correct
8 Correct 52 ms 18364 KB Output is correct
9 Correct 47 ms 18464 KB Output is correct
10 Correct 48 ms 20596 KB Output is correct
11 Correct 48 ms 20652 KB Output is correct
12 Correct 44 ms 16788 KB Output is correct
13 Correct 50 ms 16788 KB Output is correct
14 Correct 50 ms 16500 KB Output is correct
15 Correct 54 ms 16588 KB Output is correct
16 Correct 60 ms 16584 KB Output is correct
17 Correct 51 ms 16596 KB Output is correct
18 Correct 49 ms 16492 KB Output is correct
19 Correct 48 ms 16696 KB Output is correct
20 Correct 45 ms 18540 KB Output is correct
21 Correct 50 ms 18752 KB Output is correct
22 Correct 49 ms 18676 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 12756 KB Output is correct
2 Correct 8 ms 13140 KB Output is correct
3 Correct 8 ms 13140 KB Output is correct
4 Correct 5 ms 12756 KB Output is correct
5 Correct 5 ms 12756 KB Output is correct
6 Correct 8 ms 13396 KB Output is correct
7 Correct 7 ms 13168 KB Output is correct
8 Correct 7 ms 13268 KB Output is correct
9 Correct 7 ms 13268 KB Output is correct
10 Correct 5 ms 12756 KB Output is correct
11 Correct 5 ms 12756 KB Output is correct
12 Correct 5 ms 12756 KB Output is correct
13 Correct 6 ms 12756 KB Output is correct
14 Correct 5 ms 12756 KB Output is correct
15 Correct 17 ms 13140 KB Output is correct
16 Correct 18 ms 13192 KB Output is correct
17 Correct 18 ms 13288 KB Output is correct
18 Correct 8 ms 13396 KB Output is correct
19 Correct 8 ms 13184 KB Output is correct
20 Correct 16 ms 13268 KB Output is correct
21 Correct 19 ms 13228 KB Output is correct
22 Correct 5 ms 12756 KB Output is correct
23 Correct 7 ms 13140 KB Output is correct
24 Correct 7 ms 13216 KB Output is correct
25 Correct 5 ms 12756 KB Output is correct
26 Correct 6 ms 12820 KB Output is correct
27 Correct 8 ms 13396 KB Output is correct
28 Correct 8 ms 13156 KB Output is correct
29 Correct 7 ms 13168 KB Output is correct
30 Correct 7 ms 13268 KB Output is correct
31 Correct 5 ms 12756 KB Output is correct
32 Correct 5 ms 12756 KB Output is correct
33 Correct 6 ms 12756 KB Output is correct
34 Correct 5 ms 12756 KB Output is correct
35 Correct 5 ms 12756 KB Output is correct
36 Correct 53 ms 20512 KB Output is correct
37 Correct 5 ms 12756 KB Output is correct
38 Correct 51 ms 20172 KB Output is correct
39 Correct 46 ms 19568 KB Output is correct
40 Correct 52 ms 20596 KB Output is correct
41 Correct 51 ms 20644 KB Output is correct
42 Correct 42 ms 18288 KB Output is correct
43 Correct 49 ms 16736 KB Output is correct
44 Correct 50 ms 16556 KB Output is correct
45 Correct 50 ms 16496 KB Output is correct
46 Correct 50 ms 16460 KB Output is correct
47 Correct 46 ms 18404 KB Output is correct
48 Correct 44 ms 18260 KB Output is correct
49 Correct 52 ms 18364 KB Output is correct
50 Correct 47 ms 18464 KB Output is correct
51 Correct 48 ms 20596 KB Output is correct
52 Correct 48 ms 20652 KB Output is correct
53 Correct 44 ms 16788 KB Output is correct
54 Correct 50 ms 16788 KB Output is correct
55 Correct 50 ms 16500 KB Output is correct
56 Correct 54 ms 16588 KB Output is correct
57 Correct 60 ms 16584 KB Output is correct
58 Correct 51 ms 16596 KB Output is correct
59 Correct 49 ms 16492 KB Output is correct
60 Correct 48 ms 16696 KB Output is correct
61 Correct 45 ms 18540 KB Output is correct
62 Correct 50 ms 18752 KB Output is correct
63 Correct 49 ms 18676 KB Output is correct
64 Correct 60 ms 18552 KB Output is correct
65 Correct 52 ms 16484 KB Output is correct
66 Correct 55 ms 16596 KB Output is correct
67 Correct 51 ms 16516 KB Output is correct
68 Correct 42 ms 16852 KB Output is correct
69 Correct 40 ms 16808 KB Output is correct
70 Correct 54 ms 18788 KB Output is correct
71 Correct 48 ms 18276 KB Output is correct
72 Correct 5 ms 12756 KB Output is correct
73 Correct 8 ms 13228 KB Output is correct
74 Correct 7 ms 13140 KB Output is correct
75 Correct 5 ms 12756 KB Output is correct
76 Correct 6 ms 12792 KB Output is correct
77 Correct 8 ms 13396 KB Output is correct
78 Correct 8 ms 13268 KB Output is correct
79 Correct 7 ms 13140 KB Output is correct
80 Correct 7 ms 13232 KB Output is correct
81 Correct 4 ms 12756 KB Output is correct
82 Correct 6 ms 12756 KB Output is correct
83 Correct 5 ms 12756 KB Output is correct
84 Correct 5 ms 12756 KB Output is correct
85 Correct 5 ms 12756 KB Output is correct
86 Correct 18 ms 13180 KB Output is correct
87 Correct 18 ms 13240 KB Output is correct
88 Correct 19 ms 13252 KB Output is correct
89 Correct 8 ms 13396 KB Output is correct
90 Correct 8 ms 13148 KB Output is correct
91 Correct 22 ms 13268 KB Output is correct
92 Correct 19 ms 13140 KB Output is correct
93 Correct 5 ms 12756 KB Output is correct
94 Correct 53 ms 20516 KB Output is correct
95 Correct 54 ms 20120 KB Output is correct
96 Correct 47 ms 19540 KB Output is correct
97 Correct 50 ms 20532 KB Output is correct
98 Correct 51 ms 20584 KB Output is correct
99 Correct 74 ms 16536 KB Output is correct
100 Correct 67 ms 16468 KB Output is correct
101 Correct 49 ms 16460 KB Output is correct
102 Correct 51 ms 16720 KB Output is correct
103 Correct 42 ms 18276 KB Output is correct
104 Correct 45 ms 18636 KB Output is correct
105 Correct 44 ms 18232 KB Output is correct
106 Correct 60 ms 18576 KB Output is correct
107 Correct 47 ms 18408 KB Output is correct
108 Correct 48 ms 20652 KB Output is correct
109 Correct 47 ms 20676 KB Output is correct
110 Correct 41 ms 16736 KB Output is correct
111 Correct 54 ms 16784 KB Output is correct
112 Correct 51 ms 16460 KB Output is correct
113 Correct 52 ms 16492 KB Output is correct