oj.uz

Submission #756827

# Submission time Handle Problem Language Result Execution time Memory
756827 2023-06-12T08:55:03 Z NeroZein Railway (BOI17_railway) C++17
100 / 100
 108 ms 33376 KB 
#include "bits/stdc++.h"
using namespace std;

#ifdef Nero
#include "Deb.h"
#else
#define deb(...)
#endif

template<typename T, class F = function<T(const T&, const T&)>>
struct SparseTable {
  int n; 
  F func; 
  vector<vector<T>> mat;
  SparseTable () {}
  SparseTable (const vector<T>& a, F f) : func(f) {
    n = (int) a.size(); 
    int max_log = 32 - __builtin_clz(n); 
    mat.resize(max_log);
    mat[0] = a; 
    for (int j = 1; j < max_log; ++j) {
      mat[j].resize(n - (1 << j) + 1); 
      for (int i = 0; i <= n - (1 << j); ++i) {
        mat[j][i] = func(mat[j - 1][i], mat[j - 1][i + (1 << (j - 1))]);
      }
    }
  }
  T get (int from, int to) {
    assert(0 <= from && from <= to && to <= n - 1);
    int lg = 31 - __builtin_clz(to - from + 1); 
    return func(mat[lg][from], mat[lg][to - (1 << lg) + 1]);
  }
};

const int N = 100005;

vector<pair<int, int>> g[N]; 

signed main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int n, m, k;
  cin >> n >> m >> k;
  for(int i = 0; i < n - 1; ++i) {
    int u, v;
    cin >> u >> v;
    g[u].emplace_back(v, i);
    g[v].emplace_back(u, i);
  }
  int idd = 0; 
  vector<int> f(n + 1); 
  vector<int> dep(n + 1); 
  vector<int> o(2 * n - 1); 
  function<void(int, int)> Dfs = [&](int v, int p) {
    f[v] = idd;
    o[idd++] = v;
    for (auto [u, i] : g[v]) {
      if (u == p) {
        continue;
      }
      dep[u] = dep[v] + 1; 
      Dfs(u, v); 
      o[idd++] = v; 
    }
  }; 
  Dfs(1, 1); 
  SparseTable<int> spa(o, [&](int x, int y) { return dep[x] < dep[y] ? x : y; });
  auto Lca = [&](int u, int v) {
    u = f[u], v = f[v];
    if (u > v) swap(u, v);
    return spa.get(u, v); 
  };
  vector<int> dp(n + 1); 
  auto Add = [&](int u, int v) {
    dp[u]++;
    dp[v]++;
    dp[Lca(u, v)] -= 2; 
  };
  for (int i = 0; i < m; ++i) {
    int s;
    cin >> s;
    vector<int> a(s);
    for (int j = 0; j < s; ++j) {
      cin >> a[j];
    }
    sort(a.begin(), a.end(), [&](int x, int y) { return f[x] < f[y]; }); 
    for (int j = 1; j <= s; ++j) {
      Add(a[j - 1], a[j % s]); 
    }
  }
  vector<int> ans;
  function<int(int, int)> Dfs2 = [&](int v, int p) {
    int ret = dp[v];
    for (auto [u, i] : g[v]) {
      if (u == p) {
        continue;
      }
      int c = Dfs2(u, v); 
      ret += c;
      if (c / 2 >= k) {
        ans.push_back(i + 1); 
      }
    }
    return ret;
  }; 
  Dfs2(1, 1); 
  sort(ans.begin(), ans.end()); 
  cout << ans.size() << '\n';
  for (int i = 0; i < (int) ans.size(); ++i) {
    cout << ans[i] << " \n"[i == (int) ans.size() - 1]; 
  }
  return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 7 ms 4180 KB Output is correct
3 Correct 7 ms 4352 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2616 KB Output is correct
6 Correct 7 ms 4820 KB Output is correct
7 Correct 7 ms 4400 KB Output is correct
8 Correct 6 ms 4348 KB Output is correct
9 Correct 6 ms 4308 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2644 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 7 ms 4180 KB Output is correct
3 Correct 7 ms 4352 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2616 KB Output is correct
6 Correct 7 ms 4820 KB Output is correct
7 Correct 7 ms 4400 KB Output is correct
8 Correct 6 ms 4348 KB Output is correct
9 Correct 6 ms 4308 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 17 ms 4736 KB Output is correct
16 Correct 18 ms 4692 KB Output is correct
17 Correct 20 ms 4812 KB Output is correct
18 Correct 7 ms 4868 KB Output is correct
19 Correct 6 ms 4480 KB Output is correct
20 Correct 19 ms 4912 KB Output is correct
21 Correct 22 ms 4852 KB Output is correct
22 Correct 3 ms 2612 KB Output is correct
23 Correct 9 ms 4460 KB Output is correct
24 Correct 7 ms 4308 KB Output is correct
25 Correct 3 ms 2668 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 7 ms 4860 KB Output is correct
28 Correct 7 ms 4436 KB Output is correct
29 Correct 6 ms 4308 KB Output is correct
30 Correct 6 ms 4308 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 2 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 80 ms 31184 KB Output is correct
2 Correct 1 ms 2668 KB Output is correct
3 Correct 80 ms 32548 KB Output is correct
4 Correct 79 ms 32044 KB Output is correct
5 Correct 86 ms 32924 KB Output is correct
6 Correct 90 ms 33308 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 26044 KB Output is correct
2 Correct 97 ms 23756 KB Output is correct
3 Correct 100 ms 23208 KB Output is correct
4 Correct 87 ms 23264 KB Output is correct
5 Correct 94 ms 23200 KB Output is correct
6 Correct 79 ms 28052 KB Output is correct
7 Correct 71 ms 27856 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 26044 KB Output is correct
2 Correct 97 ms 23756 KB Output is correct
3 Correct 100 ms 23208 KB Output is correct
4 Correct 87 ms 23264 KB Output is correct
5 Correct 94 ms 23200 KB Output is correct
6 Correct 79 ms 28052 KB Output is correct
7 Correct 71 ms 27856 KB Output is correct
8 Correct 78 ms 28008 KB Output is correct
9 Correct 82 ms 28008 KB Output is correct
10 Correct 90 ms 33012 KB Output is correct
11 Correct 84 ms 32988 KB Output is correct
12 Correct 77 ms 23016 KB Output is correct
13 Correct 72 ms 22948 KB Output is correct
14 Correct 83 ms 23252 KB Output is correct
15 Correct 79 ms 23080 KB Output is correct
16 Correct 88 ms 23156 KB Output is correct
17 Correct 95 ms 23264 KB Output is correct
18 Correct 102 ms 23312 KB Output is correct
19 Correct 87 ms 23756 KB Output is correct
20 Correct 74 ms 28140 KB Output is correct
21 Correct 81 ms 28280 KB Output is correct
22 Correct 108 ms 28236 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 7 ms 4180 KB Output is correct
3 Correct 7 ms 4352 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2616 KB Output is correct
6 Correct 7 ms 4820 KB Output is correct
7 Correct 7 ms 4400 KB Output is correct
8 Correct 6 ms 4348 KB Output is correct
9 Correct 6 ms 4308 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 17 ms 4736 KB Output is correct
16 Correct 18 ms 4692 KB Output is correct
17 Correct 20 ms 4812 KB Output is correct
18 Correct 7 ms 4868 KB Output is correct
19 Correct 6 ms 4480 KB Output is correct
20 Correct 19 ms 4912 KB Output is correct
21 Correct 22 ms 4852 KB Output is correct
22 Correct 3 ms 2612 KB Output is correct
23 Correct 9 ms 4460 KB Output is correct
24 Correct 7 ms 4308 KB Output is correct
25 Correct 3 ms 2668 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 7 ms 4860 KB Output is correct
28 Correct 7 ms 4436 KB Output is correct
29 Correct 6 ms 4308 KB Output is correct
30 Correct 6 ms 4308 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 2 ms 2644 KB Output is correct
35 Correct 2 ms 2644 KB Output is correct
36 Correct 80 ms 31184 KB Output is correct
37 Correct 1 ms 2668 KB Output is correct
38 Correct 80 ms 32548 KB Output is correct
39 Correct 79 ms 32044 KB Output is correct
40 Correct 86 ms 32924 KB Output is correct
41 Correct 90 ms 33308 KB Output is correct
42 Correct 74 ms 26044 KB Output is correct
43 Correct 97 ms 23756 KB Output is correct
44 Correct 100 ms 23208 KB Output is correct
45 Correct 87 ms 23264 KB Output is correct
46 Correct 94 ms 23200 KB Output is correct
47 Correct 79 ms 28052 KB Output is correct
48 Correct 71 ms 27856 KB Output is correct
49 Correct 78 ms 28008 KB Output is correct
50 Correct 82 ms 28008 KB Output is correct
51 Correct 90 ms 33012 KB Output is correct
52 Correct 84 ms 32988 KB Output is correct
53 Correct 77 ms 23016 KB Output is correct
54 Correct 72 ms 22948 KB Output is correct
55 Correct 83 ms 23252 KB Output is correct
56 Correct 79 ms 23080 KB Output is correct
57 Correct 88 ms 23156 KB Output is correct
58 Correct 95 ms 23264 KB Output is correct
59 Correct 102 ms 23312 KB Output is correct
60 Correct 87 ms 23756 KB Output is correct
61 Correct 74 ms 28140 KB Output is correct
62 Correct 81 ms 28280 KB Output is correct
63 Correct 108 ms 28236 KB Output is correct
64 Correct 88 ms 28100 KB Output is correct
65 Correct 92 ms 23180 KB Output is correct
66 Correct 102 ms 23116 KB Output is correct
67 Correct 107 ms 23192 KB Output is correct
68 Correct 72 ms 22884 KB Output is correct
69 Correct 67 ms 22928 KB Output is correct
70 Correct 88 ms 28364 KB Output is correct
71 Correct 84 ms 27780 KB Output is correct
72 Correct 2 ms 2644 KB Output is correct
73 Correct 8 ms 4308 KB Output is correct
74 Correct 7 ms 4352 KB Output is correct
75 Correct 2 ms 2672 KB Output is correct
76 Correct 2 ms 2772 KB Output is correct
77 Correct 7 ms 4864 KB Output is correct
78 Correct 7 ms 4436 KB Output is correct
79 Correct 6 ms 4308 KB Output is correct
80 Correct 7 ms 4392 KB Output is correct
81 Correct 2 ms 2656 KB Output is correct
82 Correct 3 ms 2644 KB Output is correct
83 Correct 2 ms 2644 KB Output is correct
84 Correct 2 ms 2644 KB Output is correct
85 Correct 2 ms 2644 KB Output is correct
86 Correct 19 ms 4692 KB Output is correct
87 Correct 18 ms 4820 KB Output is correct
88 Correct 19 ms 4732 KB Output is correct
89 Correct 7 ms 4820 KB Output is correct
90 Correct 8 ms 4436 KB Output is correct
91 Correct 18 ms 4864 KB Output is correct
92 Correct 21 ms 4816 KB Output is correct
93 Correct 2 ms 2644 KB Output is correct
94 Correct 104 ms 32948 KB Output is correct
95 Correct 75 ms 32628 KB Output is correct
96 Correct 71 ms 32068 KB Output is correct
97 Correct 82 ms 32948 KB Output is correct
98 Correct 81 ms 33376 KB Output is correct
99 Correct 106 ms 23268 KB Output is correct
100 Correct 84 ms 23328 KB Output is correct
101 Correct 93 ms 23240 KB Output is correct
102 Correct 100 ms 23660 KB Output is correct
103 Correct 73 ms 27936 KB Output is correct
104 Correct 80 ms 28212 KB Output is correct
105 Correct 76 ms 27884 KB Output is correct
106 Correct 84 ms 28056 KB Output is correct
107 Correct 90 ms 27900 KB Output is correct
108 Correct 81 ms 33048 KB Output is correct
109 Correct 83 ms 32964 KB Output is correct
110 Correct 69 ms 22936 KB Output is correct
111 Correct 69 ms 22988 KB Output is correct
112 Correct 89 ms 23060 KB Output is correct
113 Correct 107 ms 23308 KB Output is correct