oj.uz

답안 #787523

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
787523 2023-07-19T09:01:08 Z mgl_diamond Railway (BOI17_railway) C++17
100 / 100
 85 ms 26040 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
 
#define foru(i, l, r) for(int i=(l); i<=(r); ++i)
#define ford(i, l, r) for(int i=(l); i>=(r); --i)
#define fore(x, v) for(auto &x : v)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define fi first
#define se second
#define file "input"
 
void setIO() {
  ios::sync_with_stdio(0);
  cin.tie(0); cout.tie(0);
  if (fopen(file".in", "r")) {
    freopen(file".in", "r", stdin);
    freopen(file".out", "w", stdout);
  }
}

const int N = 1e5+5, LOG = 17;

int n, m, k, add[N], par[N];
vector<pair<int, int>> e;
vector<int> graph[N], ret;
int cnt, st[N], en[N], anc[N][LOG];

void prep(int u, int p) {
  st[u] = ++cnt;
  anc[u][0] = p;
  foru(i, 1, LOG-1) anc[u][i] = anc[anc[u][i-1]][i-1];
  fore(i, graph[u]) {
    int v = e[i].fi ^ e[i].se ^ u;
    if (v == p) continue;
    par[v] = i;
    prep(v, u);
  }
  en[u] = cnt;
}

bool isAnc(int u, int v) {
  return st[u] <= st[v] && st[v] <= en[u];
}

int lca(int u, int v) {
  if (isAnc(u, v)) return u;
  ford(j, LOG-1, 0) if (!isAnc(anc[u][j], v)) u = anc[u][j];
  return anc[u][0];
}

int dfs(int u, int p) {
  int sum = 0;
  fore(i, graph[u]) { 
    int v = e[i].fi ^ e[i].se ^ u;
    if (v == p) continue;
    int value = dfs(v, u) + add[i];
    if (value >= k) ret.push_back(i);
    sum += value;
  }
  return sum;
}

int main() {
  setIO();

  cin >> n >> m >> k;

  foru(i, 2, n) {
    int u, v;
    cin >> u >> v;
    graph[u].push_back(sz(e));
    graph[v].push_back(sz(e));
    e.emplace_back(u, v);
  }

  par[1] = n+1;
  en[0] = n+1;
  prep(1, 0);

  foru(i, 1, m) {
    int k; 
    cin >> k;

    vector<int> node;
    foru(j, 1, k) {
      int u;
      cin >> u;
      node.push_back(u);
    }

    sort(all(node), [&](int u, int v){
      return st[u] < st[v];
    });

    int lst = lca(node[0], node.back());
    // cout << lst << "\n";
    foru(j, 0, k-1) {
      int cur = node[j];
      lst = lca(lst, cur);
      add[par[cur]] += 1;
      add[par[lst]] -= 1;
      // cout << cur << " " << lst << "\n";
      lst = cur;
    }
    // cout << "-----------\n";
  }

  dfs(1, 0);
  sort(all(ret));
  cout << sz(ret) << "\n";
  fore(x, ret) cout << x+1 << " ";
}

Compilation message

railway.cpp: In function 'void setIO()':
railway.cpp:18:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |     freopen(file".in", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
railway.cpp:19:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   19 |     freopen(file".out", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 5 ms 3996 KB Output is correct
3 Correct 5 ms 3980 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 5 ms 4436 KB Output is correct
7 Correct 5 ms 4052 KB Output is correct
8 Correct 4 ms 4052 KB Output is correct
9 Correct 4 ms 4052 KB Output is correct
10 Correct 1 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 1 ms 2684 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 5 ms 3996 KB Output is correct
3 Correct 5 ms 3980 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 5 ms 4436 KB Output is correct
7 Correct 5 ms 4052 KB Output is correct
8 Correct 4 ms 4052 KB Output is correct
9 Correct 4 ms 4052 KB Output is correct
10 Correct 1 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 1 ms 2684 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 19 ms 4396 KB Output is correct
16 Correct 16 ms 4404 KB Output is correct
17 Correct 17 ms 4440 KB Output is correct
18 Correct 5 ms 4436 KB Output is correct
19 Correct 5 ms 4116 KB Output is correct
20 Correct 17 ms 4552 KB Output is correct
21 Correct 19 ms 4468 KB Output is correct
22 Correct 1 ms 2644 KB Output is correct
23 Correct 5 ms 3924 KB Output is correct
24 Correct 5 ms 4052 KB Output is correct
25 Correct 2 ms 2644 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 5 ms 4504 KB Output is correct
28 Correct 5 ms 4108 KB Output is correct
29 Correct 4 ms 3972 KB Output is correct
30 Correct 5 ms 3976 KB Output is correct
31 Correct 2 ms 2644 KB Output is correct
32 Correct 1 ms 2644 KB Output is correct
33 Correct 2 ms 2644 KB Output is correct
34 Correct 2 ms 2680 KB Output is correct
35 Correct 2 ms 2644 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 51 ms 23872 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 53 ms 23240 KB Output is correct
4 Correct 45 ms 22588 KB Output is correct
5 Correct 49 ms 24008 KB Output is correct
6 Correct 50 ms 24008 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 64 ms 18432 KB Output is correct
2 Correct 69 ms 16940 KB Output is correct
3 Correct 75 ms 16684 KB Output is correct
4 Correct 61 ms 16696 KB Output is correct
5 Correct 69 ms 16692 KB Output is correct
6 Correct 53 ms 20316 KB Output is correct
7 Correct 50 ms 20436 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 64 ms 18432 KB Output is correct
2 Correct 69 ms 16940 KB Output is correct
3 Correct 75 ms 16684 KB Output is correct
4 Correct 61 ms 16696 KB Output is correct
5 Correct 69 ms 16692 KB Output is correct
6 Correct 53 ms 20316 KB Output is correct
7 Correct 50 ms 20436 KB Output is correct
8 Correct 64 ms 20628 KB Output is correct
9 Correct 55 ms 20628 KB Output is correct
10 Correct 51 ms 25780 KB Output is correct
11 Correct 50 ms 25692 KB Output is correct
12 Correct 57 ms 16564 KB Output is correct
13 Correct 48 ms 16536 KB Output is correct
14 Correct 70 ms 16556 KB Output is correct
15 Correct 80 ms 16560 KB Output is correct
16 Correct 81 ms 16688 KB Output is correct
17 Correct 85 ms 16692 KB Output is correct
18 Correct 79 ms 16640 KB Output is correct
19 Correct 63 ms 16928 KB Output is correct
20 Correct 75 ms 20524 KB Output is correct
21 Correct 60 ms 20772 KB Output is correct
22 Correct 55 ms 20576 KB Output is correct

Subtask #6
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 5 ms 3996 KB Output is correct
3 Correct 5 ms 3980 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 5 ms 4436 KB Output is correct
7 Correct 5 ms 4052 KB Output is correct
8 Correct 4 ms 4052 KB Output is correct
9 Correct 4 ms 4052 KB Output is correct
10 Correct 1 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 1 ms 2684 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 19 ms 4396 KB Output is correct
16 Correct 16 ms 4404 KB Output is correct
17 Correct 17 ms 4440 KB Output is correct
18 Correct 5 ms 4436 KB Output is correct
19 Correct 5 ms 4116 KB Output is correct
20 Correct 17 ms 4552 KB Output is correct
21 Correct 19 ms 4468 KB Output is correct
22 Correct 1 ms 2644 KB Output is correct
23 Correct 5 ms 3924 KB Output is correct
24 Correct 5 ms 4052 KB Output is correct
25 Correct 2 ms 2644 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 5 ms 4504 KB Output is correct
28 Correct 5 ms 4108 KB Output is correct
29 Correct 4 ms 3972 KB Output is correct
30 Correct 5 ms 3976 KB Output is correct
31 Correct 2 ms 2644 KB Output is correct
32 Correct 1 ms 2644 KB Output is correct
33 Correct 2 ms 2644 KB Output is correct
34 Correct 2 ms 2680 KB Output is correct
35 Correct 2 ms 2644 KB Output is correct
36 Correct 51 ms 23872 KB Output is correct
37 Correct 1 ms 2644 KB Output is correct
38 Correct 53 ms 23240 KB Output is correct
39 Correct 45 ms 22588 KB Output is correct
40 Correct 49 ms 24008 KB Output is correct
41 Correct 50 ms 24008 KB Output is correct
42 Correct 64 ms 18432 KB Output is correct
43 Correct 69 ms 16940 KB Output is correct
44 Correct 75 ms 16684 KB Output is correct
45 Correct 61 ms 16696 KB Output is correct
46 Correct 69 ms 16692 KB Output is correct
47 Correct 53 ms 20316 KB Output is correct
48 Correct 50 ms 20436 KB Output is correct
49 Correct 64 ms 20628 KB Output is correct
50 Correct 55 ms 20628 KB Output is correct
51 Correct 51 ms 25780 KB Output is correct
52 Correct 50 ms 25692 KB Output is correct
53 Correct 57 ms 16564 KB Output is correct
54 Correct 48 ms 16536 KB Output is correct
55 Correct 70 ms 16556 KB Output is correct
56 Correct 80 ms 16560 KB Output is correct
57 Correct 81 ms 16688 KB Output is correct
58 Correct 85 ms 16692 KB Output is correct
59 Correct 79 ms 16640 KB Output is correct
60 Correct 63 ms 16928 KB Output is correct
61 Correct 75 ms 20524 KB Output is correct
62 Correct 60 ms 20772 KB Output is correct
63 Correct 55 ms 20576 KB Output is correct
64 Correct 58 ms 20760 KB Output is correct
65 Correct 62 ms 16576 KB Output is correct
66 Correct 74 ms 16592 KB Output is correct
67 Correct 80 ms 16576 KB Output is correct
68 Correct 53 ms 16400 KB Output is correct
69 Correct 40 ms 16436 KB Output is correct
70 Correct 79 ms 21272 KB Output is correct
71 Correct 67 ms 20492 KB Output is correct
72 Correct 2 ms 2644 KB Output is correct
73 Correct 5 ms 3976 KB Output is correct
74 Correct 6 ms 3972 KB Output is correct
75 Correct 2 ms 2684 KB Output is correct
76 Correct 2 ms 2644 KB Output is correct
77 Correct 5 ms 4488 KB Output is correct
78 Correct 6 ms 4052 KB Output is correct
79 Correct 5 ms 3980 KB Output is correct
80 Correct 5 ms 4052 KB Output is correct
81 Correct 2 ms 2688 KB Output is correct
82 Correct 1 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 16 ms 4404 KB Output is correct
87 Correct 19 ms 4396 KB Output is correct
88 Correct 17 ms 4476 KB Output is correct
89 Correct 5 ms 4436 KB Output is correct
90 Correct 8 ms 4104 KB Output is correct
91 Correct 27 ms 4488 KB Output is correct
92 Correct 20 ms 4464 KB Output is correct
93 Correct 1 ms 2644 KB Output is correct
94 Correct 66 ms 25660 KB Output is correct
95 Correct 48 ms 25064 KB Output is correct
96 Correct 53 ms 24424 KB Output is correct
97 Correct 50 ms 25652 KB Output is correct
98 Correct 68 ms 26040 KB Output is correct
99 Correct 78 ms 16832 KB Output is correct
100 Correct 76 ms 16684 KB Output is correct
101 Correct 63 ms 16616 KB Output is correct
102 Correct 77 ms 16936 KB Output is correct
103 Correct 53 ms 20356 KB Output is correct
104 Correct 54 ms 20696 KB Output is correct
105 Correct 58 ms 20260 KB Output is correct
106 Correct 54 ms 20856 KB Output is correct
107 Correct 54 ms 20592 KB Output is correct
108 Correct 49 ms 25720 KB Output is correct
109 Correct 60 ms 25772 KB Output is correct
110 Correct 46 ms 16528 KB Output is correct
111 Correct 58 ms 16564 KB Output is correct
112 Correct 59 ms 16588 KB Output is correct
113 Correct 68 ms 16564 KB Output is correct