oj.uz

Submission #284340

# Submission time Handle Problem Language Result Execution time Memory
284340 2020-08-27T08:58:43 Z AlexLuchianov Railway (BOI17_railway) C++14
100 / 100
 297 ms 25076 KB 
#include <iostream>
#include <vector>
#include <cassert>
#include <cmath>
#include <algorithm>

using ll = long long;
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define MAX(a, b) (((a) < (b)) ? (b) : (a))

int const nmax = 100000;
int const lgmax = 20;

std::vector<std::pair<int,int>> g[1 + nmax];
int ord[1 + nmax], ptr = 0;
int level[1 + nmax];
int far[1 + lgmax][1 + nmax];

void computefar(int n) {
  for(int h = 1; h <= lgmax; h++)
    for(int i = 1;i <= n; i++)
      far[h][i] = far[h - 1][far[h - 1][i]];
}

int getlca(int x, int y) {
  if(level[x] < level[y])
    std::swap(x, y);
  for(int h = lgmax; 0 <= h; h--)
    if(level[y] + (1 << h) <= level[x])
      x = far[h][x];
  if(x == y)
    return x;
  else
    for(int h = lgmax; 0 <= h; h--)
      if(far[h][x] != far[h][y]) {
        x = far[h][x];
        y = far[h][y];
      }
  return far[0][x];
}

int ref[1 + nmax];

void dfs(int node, int parent) {
  ord[node] = ++ptr;
  level[node] = level[parent] + 1;
  far[0][node] = parent;
 
  for(int h = 0; h < g[node].size(); h++) {
    int to = g[node][h].first;
    if(to != parent) {
      ref[to] = g[node][h].second;
      dfs(to, node);
    }
  }
}

int dp[1 + nmax];
void update(int a, int b) {
  int lca = getlca(a, b);
  dp[a]++;
  dp[b]++;
  dp[lca] -= 2;
}

bool compare(int x, int y) {
  return ord[x] < ord[y];
}

void refresh(int node, int parent) {
  for(int h = 0; h < g[node].size(); h++) {
    int to = g[node][h].first;
    if(to != parent) {
      refresh(to, node);
      dp[node] += dp[to];
    }
  }
}

int main() {
  int n, m, k;
  std::cin >> n >> m >> k;
  for(int i = 1;i < n; i++) {
    int x, y;
    std::cin >> x >> y;
    g[x].push_back({y, i});
    g[y].push_back({x, i});
  }
  dfs(1, 0);
  computefar(n);
  
  for(int i = 1;i <= m; i++) {
    std::vector<int> aux;
    int _count;
    std::cin >> _count;
    for(int i = 0; i < _count; i++) {
      int val;
      std::cin >> val;
      aux.push_back(val);
    }
    std::sort(aux.begin(), aux.end(), compare);
    for(int i = 0; i < aux.size(); i++) 
      update(aux[i], aux[(i + 1) % aux.size()]);
  }

  refresh(1, 0);
  std::vector<int> sol;
  for(int i = 2;i <= n; i++)
    if(k * 2 <= dp[i])
      sol.push_back(ref[i]);
  std::cout << sol.size() << '\n';
  std::sort(sol.begin(), sol.end());
  for(int i = 0; i < sol.size(); i++)
    std::cout << sol[i] << " ";
  return 0;
}

Compilation message

railway.cpp: In function 'void dfs(int, int)':
railway.cpp:49:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |   for(int h = 0; h < g[node].size(); h++) {
      |                  ~~^~~~~~~~~~~~~~~~
railway.cpp: In function 'void refresh(int, int)':
railway.cpp:71:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   71 |   for(int h = 0; h < g[node].size(); h++) {
      |                  ~~^~~~~~~~~~~~~~~~
railway.cpp: In function 'int main()':
railway.cpp:102:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  102 |     for(int i = 0; i < aux.size(); i++)
      |                    ~~^~~~~~~~~~~~
railway.cpp:113:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  113 |   for(int i = 0; i < sol.size(); i++)
      |                  ~~^~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2816 KB Output is correct
2 Correct 20 ms 4224 KB Output is correct
3 Correct 17 ms 4352 KB Output is correct
4 Correct 2 ms 2816 KB Output is correct
5 Correct 2 ms 2816 KB Output is correct
6 Correct 16 ms 4608 KB Output is correct
7 Correct 16 ms 4352 KB Output is correct
8 Correct 13 ms 4224 KB Output is correct
9 Correct 15 ms 4224 KB Output is correct
10 Correct 3 ms 2816 KB Output is correct
11 Correct 2 ms 2816 KB Output is correct
12 Correct 3 ms 2816 KB Output is correct
13 Correct 2 ms 2816 KB Output is correct
14 Correct 2 ms 2816 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2816 KB Output is correct
2 Correct 20 ms 4224 KB Output is correct
3 Correct 17 ms 4352 KB Output is correct
4 Correct 2 ms 2816 KB Output is correct
5 Correct 2 ms 2816 KB Output is correct
6 Correct 16 ms 4608 KB Output is correct
7 Correct 16 ms 4352 KB Output is correct
8 Correct 13 ms 4224 KB Output is correct
9 Correct 15 ms 4224 KB Output is correct
10 Correct 3 ms 2816 KB Output is correct
11 Correct 2 ms 2816 KB Output is correct
12 Correct 3 ms 2816 KB Output is correct
13 Correct 2 ms 2816 KB Output is correct
14 Correct 2 ms 2816 KB Output is correct
15 Correct 68 ms 4600 KB Output is correct
16 Correct 67 ms 4608 KB Output is correct
17 Correct 67 ms 4728 KB Output is correct
18 Correct 18 ms 4608 KB Output is correct
19 Correct 16 ms 4352 KB Output is correct
20 Correct 76 ms 4856 KB Output is correct
21 Correct 77 ms 4728 KB Output is correct
22 Correct 2 ms 2816 KB Output is correct
23 Correct 15 ms 4224 KB Output is correct
24 Correct 15 ms 4224 KB Output is correct
25 Correct 2 ms 2816 KB Output is correct
26 Correct 2 ms 2816 KB Output is correct
27 Correct 16 ms 4648 KB Output is correct
28 Correct 16 ms 4352 KB Output is correct
29 Correct 13 ms 4224 KB Output is correct
30 Correct 19 ms 4224 KB Output is correct
31 Correct 2 ms 2816 KB Output is correct
32 Correct 2 ms 2816 KB Output is correct
33 Correct 2 ms 2816 KB Output is correct
34 Correct 2 ms 2816 KB Output is correct
35 Correct 2 ms 2816 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 297 ms 24564 KB Output is correct
2 Correct 3 ms 2816 KB Output is correct
3 Correct 278 ms 24312 KB Output is correct
4 Correct 277 ms 23672 KB Output is correct
5 Correct 278 ms 24564 KB Output is correct
6 Correct 272 ms 24948 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 237 ms 21112 KB Output is correct
2 Correct 272 ms 18388 KB Output is correct
3 Correct 274 ms 17972 KB Output is correct
4 Correct 271 ms 17996 KB Output is correct
5 Correct 292 ms 18040 KB Output is correct
6 Correct 238 ms 21240 KB Output is correct
7 Correct 244 ms 21156 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 237 ms 21112 KB Output is correct
2 Correct 272 ms 18388 KB Output is correct
3 Correct 274 ms 17972 KB Output is correct
4 Correct 271 ms 17996 KB Output is correct
5 Correct 292 ms 18040 KB Output is correct
6 Correct 238 ms 21240 KB Output is correct
7 Correct 244 ms 21156 KB Output is correct
8 Correct 249 ms 21240 KB Output is correct
9 Correct 263 ms 21192 KB Output is correct
10 Correct 253 ms 24692 KB Output is correct
11 Correct 241 ms 24564 KB Output is correct
12 Correct 214 ms 17796 KB Output is correct
13 Correct 208 ms 17784 KB Output is correct
14 Correct 255 ms 18040 KB Output is correct
15 Correct 245 ms 17912 KB Output is correct
16 Correct 256 ms 18072 KB Output is correct
17 Correct 265 ms 18088 KB Output is correct
18 Correct 247 ms 18040 KB Output is correct
19 Correct 239 ms 18296 KB Output is correct
20 Correct 235 ms 21372 KB Output is correct
21 Correct 234 ms 21644 KB Output is correct
22 Correct 236 ms 21752 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2816 KB Output is correct
2 Correct 20 ms 4224 KB Output is correct
3 Correct 17 ms 4352 KB Output is correct
4 Correct 2 ms 2816 KB Output is correct
5 Correct 2 ms 2816 KB Output is correct
6 Correct 16 ms 4608 KB Output is correct
7 Correct 16 ms 4352 KB Output is correct
8 Correct 13 ms 4224 KB Output is correct
9 Correct 15 ms 4224 KB Output is correct
10 Correct 3 ms 2816 KB Output is correct
11 Correct 2 ms 2816 KB Output is correct
12 Correct 3 ms 2816 KB Output is correct
13 Correct 2 ms 2816 KB Output is correct
14 Correct 2 ms 2816 KB Output is correct
15 Correct 68 ms 4600 KB Output is correct
16 Correct 67 ms 4608 KB Output is correct
17 Correct 67 ms 4728 KB Output is correct
18 Correct 18 ms 4608 KB Output is correct
19 Correct 16 ms 4352 KB Output is correct
20 Correct 76 ms 4856 KB Output is correct
21 Correct 77 ms 4728 KB Output is correct
22 Correct 2 ms 2816 KB Output is correct
23 Correct 15 ms 4224 KB Output is correct
24 Correct 15 ms 4224 KB Output is correct
25 Correct 2 ms 2816 KB Output is correct
26 Correct 2 ms 2816 KB Output is correct
27 Correct 16 ms 4648 KB Output is correct
28 Correct 16 ms 4352 KB Output is correct
29 Correct 13 ms 4224 KB Output is correct
30 Correct 19 ms 4224 KB Output is correct
31 Correct 2 ms 2816 KB Output is correct
32 Correct 2 ms 2816 KB Output is correct
33 Correct 2 ms 2816 KB Output is correct
34 Correct 2 ms 2816 KB Output is correct
35 Correct 2 ms 2816 KB Output is correct
36 Correct 297 ms 24564 KB Output is correct
37 Correct 3 ms 2816 KB Output is correct
38 Correct 278 ms 24312 KB Output is correct
39 Correct 277 ms 23672 KB Output is correct
40 Correct 278 ms 24564 KB Output is correct
41 Correct 272 ms 24948 KB Output is correct
42 Correct 237 ms 21112 KB Output is correct
43 Correct 272 ms 18388 KB Output is correct
44 Correct 274 ms 17972 KB Output is correct
45 Correct 271 ms 17996 KB Output is correct
46 Correct 292 ms 18040 KB Output is correct
47 Correct 238 ms 21240 KB Output is correct
48 Correct 244 ms 21156 KB Output is correct
49 Correct 249 ms 21240 KB Output is correct
50 Correct 263 ms 21192 KB Output is correct
51 Correct 253 ms 24692 KB Output is correct
52 Correct 241 ms 24564 KB Output is correct
53 Correct 214 ms 17796 KB Output is correct
54 Correct 208 ms 17784 KB Output is correct
55 Correct 255 ms 18040 KB Output is correct
56 Correct 245 ms 17912 KB Output is correct
57 Correct 256 ms 18072 KB Output is correct
58 Correct 265 ms 18088 KB Output is correct
59 Correct 247 ms 18040 KB Output is correct
60 Correct 239 ms 18296 KB Output is correct
61 Correct 235 ms 21372 KB Output is correct
62 Correct 234 ms 21644 KB Output is correct
63 Correct 236 ms 21752 KB Output is correct
64 Correct 246 ms 21328 KB Output is correct
65 Correct 280 ms 18040 KB Output is correct
66 Correct 273 ms 17912 KB Output is correct
67 Correct 261 ms 17964 KB Output is correct
68 Correct 190 ms 17680 KB Output is correct
69 Correct 182 ms 17680 KB Output is correct
70 Correct 255 ms 21620 KB Output is correct
71 Correct 262 ms 21112 KB Output is correct
72 Correct 2 ms 2816 KB Output is correct
73 Correct 16 ms 4224 KB Output is correct
74 Correct 16 ms 4224 KB Output is correct
75 Correct 2 ms 2816 KB Output is correct
76 Correct 2 ms 2816 KB Output is correct
77 Correct 18 ms 4736 KB Output is correct
78 Correct 16 ms 4352 KB Output is correct
79 Correct 13 ms 4224 KB Output is correct
80 Correct 15 ms 4224 KB Output is correct
81 Correct 2 ms 2816 KB Output is correct
82 Correct 3 ms 2816 KB Output is correct
83 Correct 2 ms 2816 KB Output is correct
84 Correct 2 ms 2816 KB Output is correct
85 Correct 2 ms 2816 KB Output is correct
86 Correct 66 ms 4696 KB Output is correct
87 Correct 68 ms 4728 KB Output is correct
88 Correct 68 ms 4728 KB Output is correct
89 Correct 17 ms 4608 KB Output is correct
90 Correct 16 ms 4352 KB Output is correct
91 Correct 77 ms 4856 KB Output is correct
92 Correct 76 ms 4728 KB Output is correct
93 Correct 2 ms 2816 KB Output is correct
94 Correct 264 ms 24608 KB Output is correct
95 Correct 262 ms 24312 KB Output is correct
96 Correct 275 ms 23656 KB Output is correct
97 Correct 280 ms 24600 KB Output is correct
98 Correct 271 ms 25076 KB Output is correct
99 Correct 276 ms 18040 KB Output is correct
100 Correct 255 ms 18040 KB Output is correct
101 Correct 255 ms 18076 KB Output is correct
102 Correct 250 ms 18400 KB Output is correct
103 Correct 240 ms 21112 KB Output is correct
104 Correct 243 ms 21492 KB Output is correct
105 Correct 234 ms 21072 KB Output is correct
106 Correct 246 ms 21368 KB Output is correct
107 Correct 246 ms 21112 KB Output is correct
108 Correct 274 ms 24820 KB Output is correct
109 Correct 249 ms 24692 KB Output is correct
110 Correct 213 ms 17784 KB Output is correct
111 Correct 209 ms 17792 KB Output is correct
112 Correct 287 ms 18168 KB Output is correct
113 Correct 251 ms 17912 KB Output is correct