oj.uz

답안 #766647

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
766647 2023-06-26T03:31:31 Z asdfgrace Railway (BOI17_railway) C++17
100 / 100
 58 ms 21028 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;
  vector<vector<pair<int, int>>> edges;
  array<array<int, 100000>, 20> anc;
  vector<int> dep, ord, pos, subtree, val, in;
  constexpr static int LOG = 20;
 
  void run() {
    cin >> n >> m >> k;
    edges.resize(n);
    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;
    dep.resize(n, 0); subtree.resize(n, 1);
    pos.resize(n, 0); ord.resize(n, 0);
    in.resize(n, 0);
    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]];
      }
    }
    
    val.resize(n, 0);
    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:69:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |     for (int i = 0; i < ans.size(); ++i) {
      |                     ~~^~~~~~~~~~~~
railway.cpp:70:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |       cout << ans[i] << (i + 1 == ans.size() ? '\n' : ' ');
      |                          ~~~~~~^~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8148 KB Output is correct
2 Correct 6 ms 8916 KB Output is correct
3 Correct 6 ms 8916 KB Output is correct
4 Correct 4 ms 8148 KB Output is correct
5 Correct 3 ms 8148 KB Output is correct
6 Correct 6 ms 9172 KB Output is correct
7 Correct 6 ms 9044 KB Output is correct
8 Correct 7 ms 9044 KB Output is correct
9 Correct 5 ms 9044 KB Output is correct
10 Correct 3 ms 8148 KB Output is correct
11 Correct 3 ms 8148 KB Output is correct
12 Correct 3 ms 8148 KB Output is correct
13 Correct 3 ms 8148 KB Output is correct
14 Correct 3 ms 8148 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8148 KB Output is correct
2 Correct 6 ms 8916 KB Output is correct
3 Correct 6 ms 8916 KB Output is correct
4 Correct 4 ms 8148 KB Output is correct
5 Correct 3 ms 8148 KB Output is correct
6 Correct 6 ms 9172 KB Output is correct
7 Correct 6 ms 9044 KB Output is correct
8 Correct 7 ms 9044 KB Output is correct
9 Correct 5 ms 9044 KB Output is correct
10 Correct 3 ms 8148 KB Output is correct
11 Correct 3 ms 8148 KB Output is correct
12 Correct 3 ms 8148 KB Output is correct
13 Correct 3 ms 8148 KB Output is correct
14 Correct 3 ms 8148 KB Output is correct
15 Correct 17 ms 9008 KB Output is correct
16 Correct 18 ms 8956 KB Output is correct
17 Correct 17 ms 9000 KB Output is correct
18 Correct 6 ms 9172 KB Output is correct
19 Correct 6 ms 9044 KB Output is correct
20 Correct 15 ms 9032 KB Output is correct
21 Correct 18 ms 8916 KB Output is correct
22 Correct 3 ms 8084 KB Output is correct
23 Correct 6 ms 8916 KB Output is correct
24 Correct 6 ms 8916 KB Output is correct
25 Correct 3 ms 8148 KB Output is correct
26 Correct 3 ms 8148 KB Output is correct
27 Correct 6 ms 9172 KB Output is correct
28 Correct 6 ms 9044 KB Output is correct
29 Correct 5 ms 8992 KB Output is correct
30 Correct 6 ms 8992 KB Output is correct
31 Correct 3 ms 8148 KB Output is correct
32 Correct 3 ms 8148 KB Output is correct
33 Correct 3 ms 8148 KB Output is correct
34 Correct 3 ms 8148 KB Output is correct
35 Correct 3 ms 8148 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 20860 KB Output is correct
2 Correct 3 ms 8148 KB Output is correct
3 Correct 52 ms 20484 KB Output is correct
4 Correct 55 ms 19848 KB Output is correct
5 Correct 51 ms 20852 KB Output is correct
6 Correct 52 ms 20932 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 49 ms 18456 KB Output is correct
2 Correct 48 ms 16724 KB Output is correct
3 Correct 53 ms 16596 KB Output is correct
4 Correct 52 ms 16476 KB Output is correct
5 Correct 52 ms 16516 KB Output is correct
6 Correct 44 ms 18508 KB Output is correct
7 Correct 44 ms 18460 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 49 ms 18456 KB Output is correct
2 Correct 48 ms 16724 KB Output is correct
3 Correct 53 ms 16596 KB Output is correct
4 Correct 52 ms 16476 KB Output is correct
5 Correct 52 ms 16516 KB Output is correct
6 Correct 44 ms 18508 KB Output is correct
7 Correct 44 ms 18460 KB Output is correct
8 Correct 49 ms 18588 KB Output is correct
9 Correct 52 ms 18632 KB Output is correct
10 Correct 56 ms 21008 KB Output is correct
11 Correct 49 ms 21016 KB Output is correct
12 Correct 43 ms 16756 KB Output is correct
13 Correct 43 ms 16800 KB Output is correct
14 Correct 50 ms 16540 KB Output is correct
15 Correct 57 ms 16584 KB Output is correct
16 Correct 52 ms 16612 KB Output is correct
17 Correct 51 ms 16464 KB Output is correct
18 Correct 50 ms 16588 KB Output is correct
19 Correct 55 ms 16780 KB Output is correct
20 Correct 47 ms 18848 KB Output is correct
21 Correct 47 ms 18912 KB Output is correct
22 Correct 46 ms 18900 KB Output is correct

Subtask #6
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8148 KB Output is correct
2 Correct 6 ms 8916 KB Output is correct
3 Correct 6 ms 8916 KB Output is correct
4 Correct 4 ms 8148 KB Output is correct
5 Correct 3 ms 8148 KB Output is correct
6 Correct 6 ms 9172 KB Output is correct
7 Correct 6 ms 9044 KB Output is correct
8 Correct 7 ms 9044 KB Output is correct
9 Correct 5 ms 9044 KB Output is correct
10 Correct 3 ms 8148 KB Output is correct
11 Correct 3 ms 8148 KB Output is correct
12 Correct 3 ms 8148 KB Output is correct
13 Correct 3 ms 8148 KB Output is correct
14 Correct 3 ms 8148 KB Output is correct
15 Correct 17 ms 9008 KB Output is correct
16 Correct 18 ms 8956 KB Output is correct
17 Correct 17 ms 9000 KB Output is correct
18 Correct 6 ms 9172 KB Output is correct
19 Correct 6 ms 9044 KB Output is correct
20 Correct 15 ms 9032 KB Output is correct
21 Correct 18 ms 8916 KB Output is correct
22 Correct 3 ms 8084 KB Output is correct
23 Correct 6 ms 8916 KB Output is correct
24 Correct 6 ms 8916 KB Output is correct
25 Correct 3 ms 8148 KB Output is correct
26 Correct 3 ms 8148 KB Output is correct
27 Correct 6 ms 9172 KB Output is correct
28 Correct 6 ms 9044 KB Output is correct
29 Correct 5 ms 8992 KB Output is correct
30 Correct 6 ms 8992 KB Output is correct
31 Correct 3 ms 8148 KB Output is correct
32 Correct 3 ms 8148 KB Output is correct
33 Correct 3 ms 8148 KB Output is correct
34 Correct 3 ms 8148 KB Output is correct
35 Correct 3 ms 8148 KB Output is correct
36 Correct 54 ms 20860 KB Output is correct
37 Correct 3 ms 8148 KB Output is correct
38 Correct 52 ms 20484 KB Output is correct
39 Correct 55 ms 19848 KB Output is correct
40 Correct 51 ms 20852 KB Output is correct
41 Correct 52 ms 20932 KB Output is correct
42 Correct 49 ms 18456 KB Output is correct
43 Correct 48 ms 16724 KB Output is correct
44 Correct 53 ms 16596 KB Output is correct
45 Correct 52 ms 16476 KB Output is correct
46 Correct 52 ms 16516 KB Output is correct
47 Correct 44 ms 18508 KB Output is correct
48 Correct 44 ms 18460 KB Output is correct
49 Correct 49 ms 18588 KB Output is correct
50 Correct 52 ms 18632 KB Output is correct
51 Correct 56 ms 21008 KB Output is correct
52 Correct 49 ms 21016 KB Output is correct
53 Correct 43 ms 16756 KB Output is correct
54 Correct 43 ms 16800 KB Output is correct
55 Correct 50 ms 16540 KB Output is correct
56 Correct 57 ms 16584 KB Output is correct
57 Correct 52 ms 16612 KB Output is correct
58 Correct 51 ms 16464 KB Output is correct
59 Correct 50 ms 16588 KB Output is correct
60 Correct 55 ms 16780 KB Output is correct
61 Correct 47 ms 18848 KB Output is correct
62 Correct 47 ms 18912 KB Output is correct
63 Correct 46 ms 18900 KB Output is correct
64 Correct 49 ms 18728 KB Output is correct
65 Correct 58 ms 16584 KB Output is correct
66 Correct 57 ms 16512 KB Output is correct
67 Correct 57 ms 16592 KB Output is correct
68 Correct 37 ms 16852 KB Output is correct
69 Correct 36 ms 16880 KB Output is correct
70 Correct 52 ms 19032 KB Output is correct
71 Correct 49 ms 18440 KB Output is correct
72 Correct 3 ms 8148 KB Output is correct
73 Correct 6 ms 8916 KB Output is correct
74 Correct 6 ms 8916 KB Output is correct
75 Correct 3 ms 8148 KB Output is correct
76 Correct 4 ms 8148 KB Output is correct
77 Correct 6 ms 9172 KB Output is correct
78 Correct 6 ms 9044 KB Output is correct
79 Correct 5 ms 8916 KB Output is correct
80 Correct 5 ms 9044 KB Output is correct
81 Correct 3 ms 8148 KB Output is correct
82 Correct 3 ms 8148 KB Output is correct
83 Correct 3 ms 8148 KB Output is correct
84 Correct 3 ms 8148 KB Output is correct
85 Correct 3 ms 8148 KB Output is correct
86 Correct 17 ms 9008 KB Output is correct
87 Correct 16 ms 9044 KB Output is correct
88 Correct 17 ms 9104 KB Output is correct
89 Correct 6 ms 9172 KB Output is correct
90 Correct 6 ms 9044 KB Output is correct
91 Correct 15 ms 9044 KB Output is correct
92 Correct 17 ms 9020 KB Output is correct
93 Correct 3 ms 8148 KB Output is correct
94 Correct 53 ms 20772 KB Output is correct
95 Correct 55 ms 20484 KB Output is correct
96 Correct 49 ms 19976 KB Output is correct
97 Correct 50 ms 20932 KB Output is correct
98 Correct 51 ms 20932 KB Output is correct
99 Correct 51 ms 16472 KB Output is correct
100 Correct 50 ms 16512 KB Output is correct
101 Correct 50 ms 16556 KB Output is correct
102 Correct 48 ms 16708 KB Output is correct
103 Correct 44 ms 18508 KB Output is correct
104 Correct 46 ms 18840 KB Output is correct
105 Correct 44 ms 18484 KB Output is correct
106 Correct 49 ms 18724 KB Output is correct
107 Correct 49 ms 18588 KB Output is correct
108 Correct 49 ms 21028 KB Output is correct
109 Correct 48 ms 20956 KB Output is correct
110 Correct 49 ms 16868 KB Output is correct
111 Correct 43 ms 16764 KB Output is correct
112 Correct 51 ms 16596 KB Output is correct
113 Correct 52 ms 16488 KB Output is correct