oj.uz

Submission #884765

# Submission time Handle Problem Language Result Execution time Memory
884765 2023-12-08T11:35:37 Z nima_aryan Railway (BOI17_railway) C++17
100 / 100
 165 ms 26336 KB 
#include <bits/stdc++.h>

using namespace std;

class Tree {
 public:
  int n;
  vector<vector<int>> adj;
  vector<vector<int>> up;
  vector<int> dep;
  vector<int> tin;
  vector<int> tout;

  Tree(int n) : n(n) {
    adj.resize(n);
    up.resize(n);
    dep.resize(n);
    tin.resize(n);
    tout.resize(n);
  }

  void add_edge(int x, int y) {
    adj[x].push_back(y);
    adj[y].push_back(x);
  }

  void dfs(int x, int p) {
    static int T = 0;
    tin[x] = T++;
    up[x].resize(20);
    up[x][0] = p;
    for (int i = 1; i < 20; ++i) {
      up[x][i] = up[up[x][i - 1]][i - 1];
    }
    for (int y : adj[x]) {
      if (y != p) {
        dep[y] = dep[x] + 1;
        dfs(y, x);
      }
    }
    tout[x] = T;
  }
  void work() {
    dfs(0, 0);
  }

  void jump(int& at, int k) {
    for (int i = 0; i < 20; ++i) {
      if (k >> i & 1) {
        at = up[at][i];
      }
    }
  }
  int lca(int x, int y) {
    if (dep[x] < dep[y]) {
      swap(x, y);
    }
    jump(x, dep[x] - dep[y]);
    if (x == y) {
      return x;
    }
    for (int i = 20 - 1; i >= 0; --i) {
      int new_x = up[x][i];
      int new_y = up[y][i];
      if (new_x != new_y) {
        x = new_x;
        y = new_y;
      }
    }
    return up[x][0];
  }
  bool anc(int x, int y) {
    return tin[x] <= tin[y] && tout[y] <= tout[x];
  }
};

int main() {
  int n, m, k;
  cin >> n >> m >> k;

  Tree t(n);
  vector<pair<int, int>> e;
  for (int i = 0; i < n - 1; ++i) {
    int a, b;
    cin >> a >> b;
    --a, --b;
    t.add_edge(a, b);
    e.emplace_back(a, b);
  }
  t.work();
  
  vector<int> id(n);
  for (int i = 0; i < n - 1; ++i) {
    auto [x, y] = e[i];
    if (t.dep[x] > t.dep[y]) {
      swap(x, y);
    }
    id[y] = i;
  }

  vector<int> val(n);
  while (m--) {
    int s;
    cin >> s;
    vector<int> a(s);
    for (int i = 0; i < s; ++i) {
      cin >> a[i];
      --a[i];
    }
    sort(a.begin(), a.end(), [&](int x, int y) {
      return t.tin[x] < t.tin[y];
    });
    for (int i = 1; i < s; ++i) {
      a.push_back(t.lca(a[i - 1], a[i]));
    }
    sort(a.begin(), a.end(), [&](int x, int y) {
      return t.tin[x] < t.tin[y];
    });
    a.resize(unique(a.begin(), a.end()) - a.begin());
    for (int i = 1; i < a.size(); ++i) {
      val[t.lca(a[i - 1], a[i])] -= 1;
      val[a[i]] += 1;
    }
  }
  auto dfs = [&](auto self, int x, int p) -> void {
    for (int y : t.adj[x]) {
      if (y != p) {
        self(self, y, x);
        val[x] += val[y];
      }
    }
  };
  dfs(dfs, 0, -1);
  vector<int> ans;
  for (int x = 1; x < n; ++x) {
    if (val[x] >= k) {
      ans.push_back(id[x]);
    }
  }
  cout << ans.size() << "\n";
  sort(ans.begin(), ans.end());
  for (int x : ans) {
    cout << x + 1 << " ";
  }
  cout << "\n";
}

Compilation message

railway.cpp: In function 'int main()':
railway.cpp:120:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  120 |     for (int i = 1; i < a.size(); ++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 2308 KB Output is correct
3 Correct 7 ms 2424 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 8 ms 2648 KB Output is correct
7 Correct 8 ms 2396 KB Output is correct
8 Correct 6 ms 2396 KB Output is correct
9 Correct 7 ms 2396 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 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 2308 KB Output is correct
3 Correct 7 ms 2424 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 8 ms 2648 KB Output is correct
7 Correct 8 ms 2396 KB Output is correct
8 Correct 6 ms 2396 KB Output is correct
9 Correct 7 ms 2396 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 38 ms 2356 KB Output is correct
16 Correct 38 ms 2396 KB Output is correct
17 Correct 37 ms 2396 KB Output is correct
18 Correct 9 ms 2652 KB Output is correct
19 Correct 10 ms 2396 KB Output is correct
20 Correct 35 ms 2500 KB Output is correct
21 Correct 37 ms 2396 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 7 ms 2396 KB Output is correct
24 Correct 7 ms 2396 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 8 ms 2652 KB Output is correct
28 Correct 8 ms 2396 KB Output is correct
29 Correct 7 ms 2448 KB Output is correct
30 Correct 7 ms 2396 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 131 ms 26048 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 127 ms 25588 KB Output is correct
4 Correct 135 ms 24672 KB Output is correct
5 Correct 128 ms 26052 KB Output is correct
6 Correct 155 ms 26312 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 118 ms 22468 KB Output is correct
2 Correct 120 ms 20932 KB Output is correct
3 Correct 118 ms 20432 KB Output is correct
4 Correct 128 ms 20420 KB Output is correct
5 Correct 119 ms 20424 KB Output is correct
6 Correct 121 ms 23044 KB Output is correct
7 Correct 116 ms 22956 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 118 ms 22468 KB Output is correct
2 Correct 120 ms 20932 KB Output is correct
3 Correct 118 ms 20432 KB Output is correct
4 Correct 128 ms 20420 KB Output is correct
5 Correct 119 ms 20424 KB Output is correct
6 Correct 121 ms 23044 KB Output is correct
7 Correct 116 ms 22956 KB Output is correct
8 Correct 128 ms 22832 KB Output is correct
9 Correct 133 ms 22688 KB Output is correct
10 Correct 165 ms 26336 KB Output is correct
11 Correct 128 ms 26236 KB Output is correct
12 Correct 104 ms 20676 KB Output is correct
13 Correct 101 ms 20676 KB Output is correct
14 Correct 127 ms 20508 KB Output is correct
15 Correct 119 ms 20424 KB Output is correct
16 Correct 115 ms 20456 KB Output is correct
17 Correct 116 ms 20368 KB Output is correct
18 Correct 116 ms 20420 KB Output is correct
19 Correct 120 ms 20680 KB Output is correct
20 Correct 114 ms 22940 KB Output is correct
21 Correct 116 ms 23236 KB Output is correct
22 Correct 119 ms 22960 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 2308 KB Output is correct
3 Correct 7 ms 2424 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 8 ms 2648 KB Output is correct
7 Correct 8 ms 2396 KB Output is correct
8 Correct 6 ms 2396 KB Output is correct
9 Correct 7 ms 2396 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 38 ms 2356 KB Output is correct
16 Correct 38 ms 2396 KB Output is correct
17 Correct 37 ms 2396 KB Output is correct
18 Correct 9 ms 2652 KB Output is correct
19 Correct 10 ms 2396 KB Output is correct
20 Correct 35 ms 2500 KB Output is correct
21 Correct 37 ms 2396 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 7 ms 2396 KB Output is correct
24 Correct 7 ms 2396 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 8 ms 2652 KB Output is correct
28 Correct 8 ms 2396 KB Output is correct
29 Correct 7 ms 2448 KB Output is correct
30 Correct 7 ms 2396 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 131 ms 26048 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 127 ms 25588 KB Output is correct
39 Correct 135 ms 24672 KB Output is correct
40 Correct 128 ms 26052 KB Output is correct
41 Correct 155 ms 26312 KB Output is correct
42 Correct 118 ms 22468 KB Output is correct
43 Correct 120 ms 20932 KB Output is correct
44 Correct 118 ms 20432 KB Output is correct
45 Correct 128 ms 20420 KB Output is correct
46 Correct 119 ms 20424 KB Output is correct
47 Correct 121 ms 23044 KB Output is correct
48 Correct 116 ms 22956 KB Output is correct
49 Correct 128 ms 22832 KB Output is correct
50 Correct 133 ms 22688 KB Output is correct
51 Correct 165 ms 26336 KB Output is correct
52 Correct 128 ms 26236 KB Output is correct
53 Correct 104 ms 20676 KB Output is correct
54 Correct 101 ms 20676 KB Output is correct
55 Correct 127 ms 20508 KB Output is correct
56 Correct 119 ms 20424 KB Output is correct
57 Correct 115 ms 20456 KB Output is correct
58 Correct 116 ms 20368 KB Output is correct
59 Correct 116 ms 20420 KB Output is correct
60 Correct 120 ms 20680 KB Output is correct
61 Correct 114 ms 22940 KB Output is correct
62 Correct 116 ms 23236 KB Output is correct
63 Correct 119 ms 22960 KB Output is correct
64 Correct 121 ms 22840 KB Output is correct
65 Correct 124 ms 20424 KB Output is correct
66 Correct 130 ms 20424 KB Output is correct
67 Correct 121 ms 20420 KB Output is correct
68 Correct 89 ms 20860 KB Output is correct
69 Correct 91 ms 21104 KB Output is correct
70 Correct 124 ms 23244 KB Output is correct
71 Correct 124 ms 22468 KB Output is correct
72 Correct 0 ms 344 KB Output is correct
73 Correct 7 ms 2396 KB Output is correct
74 Correct 7 ms 2396 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 2684 KB Output is correct
78 Correct 7 ms 2392 KB Output is correct
79 Correct 7 ms 2396 KB Output is correct
80 Correct 7 ms 2388 KB Output is correct
81 Correct 0 ms 344 KB Output is correct
82 Correct 0 ms 348 KB Output is correct
83 Correct 0 ms 348 KB Output is correct
84 Correct 0 ms 348 KB Output is correct
85 Correct 0 ms 348 KB Output is correct
86 Correct 36 ms 2456 KB Output is correct
87 Correct 36 ms 2392 KB Output is correct
88 Correct 37 ms 2448 KB Output is correct
89 Correct 9 ms 2648 KB Output is correct
90 Correct 7 ms 2396 KB Output is correct
91 Correct 35 ms 2496 KB Output is correct
92 Correct 38 ms 2392 KB Output is correct
93 Correct 0 ms 348 KB Output is correct
94 Correct 130 ms 26000 KB Output is correct
95 Correct 132 ms 25552 KB Output is correct
96 Correct 128 ms 24772 KB Output is correct
97 Correct 143 ms 26072 KB Output is correct
98 Correct 137 ms 26280 KB Output is correct
99 Correct 119 ms 20424 KB Output is correct
100 Correct 119 ms 20452 KB Output is correct
101 Correct 124 ms 20680 KB Output is correct
102 Correct 123 ms 20612 KB Output is correct
103 Correct 113 ms 22688 KB Output is correct
104 Correct 116 ms 23236 KB Output is correct
105 Correct 113 ms 22472 KB Output is correct
106 Correct 128 ms 22984 KB Output is correct
107 Correct 125 ms 22680 KB Output is correct
108 Correct 141 ms 26308 KB Output is correct
109 Correct 128 ms 26320 KB Output is correct
110 Correct 99 ms 20676 KB Output is correct
111 Correct 102 ms 20676 KB Output is correct
112 Correct 117 ms 20420 KB Output is correct
113 Correct 119 ms 20360 KB Output is correct