oj.uz

Submission #878328

# Submission time Handle Problem Language Result Execution time Memory
878328 2023-11-24T08:17:30 Z Erfan1386Y Railway (BOI17_railway) C++14
100 / 100
 92 ms 26572 KB 
#include <bits/stdc++.h>
#define file_io freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
#define fast_io ios::sync_with_stdio(false);cin.tie(0);
#define what(x) cerr << #x << " is " << x << '\n';
#define kill(x) {cout << x << '\n'; return 0;}
#define all(x) (x).begin(), (x).end()
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define ll long long
#define F first
#define S second
const ll inf = 1e18, mod = 1e9 + 7, delta = 1e9 + 9, SQ = 450, P = 6065621;
 
using namespace std;
 
const ll N = 1e5 + 10, LG = 20;
int h[N], par[N][LG], f[N], cnt[N], k, st[N], ft[N], tmp;
vector<pii> adj[N];
vector<int> ans;
 
void pre (int v, int p = -1, int e = -1) {
  par[v][0] = p;
  f[v] = e;
  st[v] = tmp++;
  if (p != -1) h[v] = h[p] + 1;
  for (int i = 1; i < LG; i++) 
    if (par[v][i - 1] != -1) 
      par[v][i] = par[par[v][i - 1]][i - 1];
  for (auto u: adj[v])
    if (p != u.F) 
      pre(u.F, v, u.S);
  ft[v] = tmp;
}
 
int lca (int u, int v) {
  if (h[u] < h[v]) swap(u, v);
  for (int i = LG - 1; i >= 0; i--)
    if (par[u][i] != -1 && h[par[u][i]] >= h[v])
      u = par[u][i];
  if (u == v) return u;
  for (int i = LG - 1; i >= 0; i--)
    if (par[u][i] != par[v][i])
      u = par[u][i], v = par[v][i];
  return par[u][0];
}
 
void dfs (int v, int p = -1) {
  for (auto u: adj[v]) {
    if (u.F != p) {
      dfs(u.F, v);
      if (cnt[u.F] >= 2 * k) {
        ans.pb(u.S);
      }
      cnt[v] += cnt[u.F];
    }
  }
}
 
bool cmp (int i, int j) {
  return st[i] < st[j];
}
 
int main() {
  fast_io;
  int n, m;
  cin >> n >> m >> k;
  memset(par, -1, sizeof par);
  for (int i = 1; i < n; i++) {
    int u, v;
    cin >> u >> v;
    adj[u].pb({v, i});
    adj[v].pb({u, i});
  }
  pre(1);
  for (int i = 1; i <= m; i++) {
    int x;
    cin >> x;
    vector<int> d(x);
    for (int j = 0; j < x; j++)
      cin >> d[j];
    sort(all(d), cmp);
    for (int j = 0; j < x - 1; j++) {
      int v = d[j], u = d[j + 1];
      int l = lca(u, v);
      if (l == v) {
        cnt[u]++;
        cnt[v]--;
        continue;
      }
      else cnt[v]++, cnt[u]++, cnt[l] -= 2;
    }
    int v = d[0], u = d[x - 1];
    int l = lca(u, v);
    if (l == v) {
        cnt[u]++;
        cnt[v]--;
        continue;
      }
    else cnt[v]++, cnt[u]++, cnt[l] -= 2;
  }
  dfs(1);
  // for (int i = 1; i <= n; i++)
  //   cout << cnt[i] << ' ';
  // cout << endl;
  cout << ans.size() << '\n';
  sort(all(ans));
  for (auto u: ans) cout << u << ' ';
  cout << '\n';
  return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12120 KB Output is correct
2 Correct 5 ms 12684 KB Output is correct
3 Correct 5 ms 12636 KB Output is correct
4 Correct 3 ms 12120 KB Output is correct
5 Correct 2 ms 12056 KB Output is correct
6 Correct 6 ms 13148 KB Output is correct
7 Correct 5 ms 12636 KB Output is correct
8 Correct 5 ms 12636 KB Output is correct
9 Correct 4 ms 12636 KB Output is correct
10 Correct 2 ms 12120 KB Output is correct
11 Correct 3 ms 12120 KB Output is correct
12 Correct 3 ms 12120 KB Output is correct
13 Correct 2 ms 12124 KB Output is correct
14 Correct 3 ms 12124 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12120 KB Output is correct
2 Correct 5 ms 12684 KB Output is correct
3 Correct 5 ms 12636 KB Output is correct
4 Correct 3 ms 12120 KB Output is correct
5 Correct 2 ms 12056 KB Output is correct
6 Correct 6 ms 13148 KB Output is correct
7 Correct 5 ms 12636 KB Output is correct
8 Correct 5 ms 12636 KB Output is correct
9 Correct 4 ms 12636 KB Output is correct
10 Correct 2 ms 12120 KB Output is correct
11 Correct 3 ms 12120 KB Output is correct
12 Correct 3 ms 12120 KB Output is correct
13 Correct 2 ms 12124 KB Output is correct
14 Correct 3 ms 12124 KB Output is correct
15 Correct 21 ms 12988 KB Output is correct
16 Correct 19 ms 12888 KB Output is correct
17 Correct 17 ms 13144 KB Output is correct
18 Correct 8 ms 12972 KB Output is correct
19 Correct 8 ms 12644 KB Output is correct
20 Correct 16 ms 13148 KB Output is correct
21 Correct 18 ms 13200 KB Output is correct
22 Correct 3 ms 12120 KB Output is correct
23 Correct 6 ms 12636 KB Output is correct
24 Correct 6 ms 12636 KB Output is correct
25 Correct 2 ms 12124 KB Output is correct
26 Correct 2 ms 12124 KB Output is correct
27 Correct 5 ms 13148 KB Output is correct
28 Correct 5 ms 12636 KB Output is correct
29 Correct 4 ms 12648 KB Output is correct
30 Correct 5 ms 12688 KB Output is correct
31 Correct 3 ms 12124 KB Output is correct
32 Correct 2 ms 12124 KB Output is correct
33 Correct 2 ms 12124 KB Output is correct
34 Correct 3 ms 12120 KB Output is correct
35 Correct 2 ms 12120 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 26060 KB Output is correct
2 Correct 2 ms 12120 KB Output is correct
3 Correct 61 ms 25928 KB Output is correct
4 Correct 78 ms 25112 KB Output is correct
5 Correct 85 ms 25996 KB Output is correct
6 Correct 68 ms 26572 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 21840 KB Output is correct
2 Correct 55 ms 18260 KB Output is correct
3 Correct 62 ms 17964 KB Output is correct
4 Correct 63 ms 18004 KB Output is correct
5 Correct 76 ms 18000 KB Output is correct
6 Correct 60 ms 22052 KB Output is correct
7 Correct 57 ms 21736 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 21840 KB Output is correct
2 Correct 55 ms 18260 KB Output is correct
3 Correct 62 ms 17964 KB Output is correct
4 Correct 63 ms 18004 KB Output is correct
5 Correct 76 ms 18000 KB Output is correct
6 Correct 60 ms 22052 KB Output is correct
7 Correct 57 ms 21736 KB Output is correct
8 Correct 58 ms 22092 KB Output is correct
9 Correct 58 ms 21840 KB Output is correct
10 Correct 87 ms 26264 KB Output is correct
11 Correct 92 ms 26060 KB Output is correct
12 Correct 42 ms 17748 KB Output is correct
13 Correct 41 ms 17756 KB Output is correct
14 Correct 54 ms 18004 KB Output is correct
15 Correct 62 ms 18004 KB Output is correct
16 Correct 71 ms 18100 KB Output is correct
17 Correct 71 ms 18088 KB Output is correct
18 Correct 78 ms 17884 KB Output is correct
19 Correct 74 ms 18256 KB Output is correct
20 Correct 79 ms 22224 KB Output is correct
21 Correct 59 ms 22284 KB Output is correct
22 Correct 68 ms 22096 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12120 KB Output is correct
2 Correct 5 ms 12684 KB Output is correct
3 Correct 5 ms 12636 KB Output is correct
4 Correct 3 ms 12120 KB Output is correct
5 Correct 2 ms 12056 KB Output is correct
6 Correct 6 ms 13148 KB Output is correct
7 Correct 5 ms 12636 KB Output is correct
8 Correct 5 ms 12636 KB Output is correct
9 Correct 4 ms 12636 KB Output is correct
10 Correct 2 ms 12120 KB Output is correct
11 Correct 3 ms 12120 KB Output is correct
12 Correct 3 ms 12120 KB Output is correct
13 Correct 2 ms 12124 KB Output is correct
14 Correct 3 ms 12124 KB Output is correct
15 Correct 21 ms 12988 KB Output is correct
16 Correct 19 ms 12888 KB Output is correct
17 Correct 17 ms 13144 KB Output is correct
18 Correct 8 ms 12972 KB Output is correct
19 Correct 8 ms 12644 KB Output is correct
20 Correct 16 ms 13148 KB Output is correct
21 Correct 18 ms 13200 KB Output is correct
22 Correct 3 ms 12120 KB Output is correct
23 Correct 6 ms 12636 KB Output is correct
24 Correct 6 ms 12636 KB Output is correct
25 Correct 2 ms 12124 KB Output is correct
26 Correct 2 ms 12124 KB Output is correct
27 Correct 5 ms 13148 KB Output is correct
28 Correct 5 ms 12636 KB Output is correct
29 Correct 4 ms 12648 KB Output is correct
30 Correct 5 ms 12688 KB Output is correct
31 Correct 3 ms 12124 KB Output is correct
32 Correct 2 ms 12124 KB Output is correct
33 Correct 2 ms 12124 KB Output is correct
34 Correct 3 ms 12120 KB Output is correct
35 Correct 2 ms 12120 KB Output is correct
36 Correct 73 ms 26060 KB Output is correct
37 Correct 2 ms 12120 KB Output is correct
38 Correct 61 ms 25928 KB Output is correct
39 Correct 78 ms 25112 KB Output is correct
40 Correct 85 ms 25996 KB Output is correct
41 Correct 68 ms 26572 KB Output is correct
42 Correct 53 ms 21840 KB Output is correct
43 Correct 55 ms 18260 KB Output is correct
44 Correct 62 ms 17964 KB Output is correct
45 Correct 63 ms 18004 KB Output is correct
46 Correct 76 ms 18000 KB Output is correct
47 Correct 60 ms 22052 KB Output is correct
48 Correct 57 ms 21736 KB Output is correct
49 Correct 58 ms 22092 KB Output is correct
50 Correct 58 ms 21840 KB Output is correct
51 Correct 87 ms 26264 KB Output is correct
52 Correct 92 ms 26060 KB Output is correct
53 Correct 42 ms 17748 KB Output is correct
54 Correct 41 ms 17756 KB Output is correct
55 Correct 54 ms 18004 KB Output is correct
56 Correct 62 ms 18004 KB Output is correct
57 Correct 71 ms 18100 KB Output is correct
58 Correct 71 ms 18088 KB Output is correct
59 Correct 78 ms 17884 KB Output is correct
60 Correct 74 ms 18256 KB Output is correct
61 Correct 79 ms 22224 KB Output is correct
62 Correct 59 ms 22284 KB Output is correct
63 Correct 68 ms 22096 KB Output is correct
64 Correct 61 ms 22128 KB Output is correct
65 Correct 72 ms 18000 KB Output is correct
66 Correct 78 ms 18004 KB Output is correct
67 Correct 65 ms 17960 KB Output is correct
68 Correct 44 ms 17744 KB Output is correct
69 Correct 38 ms 17744 KB Output is correct
70 Correct 63 ms 22476 KB Output is correct
71 Correct 61 ms 21708 KB Output is correct
72 Correct 2 ms 12124 KB Output is correct
73 Correct 5 ms 12636 KB Output is correct
74 Correct 5 ms 12636 KB Output is correct
75 Correct 2 ms 12124 KB Output is correct
76 Correct 2 ms 12064 KB Output is correct
77 Correct 6 ms 13152 KB Output is correct
78 Correct 5 ms 12636 KB Output is correct
79 Correct 5 ms 12632 KB Output is correct
80 Correct 5 ms 12636 KB Output is correct
81 Correct 2 ms 12124 KB Output is correct
82 Correct 2 ms 12124 KB Output is correct
83 Correct 2 ms 12180 KB Output is correct
84 Correct 2 ms 12132 KB Output is correct
85 Correct 2 ms 12124 KB Output is correct
86 Correct 17 ms 12892 KB Output is correct
87 Correct 17 ms 12888 KB Output is correct
88 Correct 18 ms 13136 KB Output is correct
89 Correct 6 ms 13148 KB Output is correct
90 Correct 5 ms 12636 KB Output is correct
91 Correct 16 ms 13200 KB Output is correct
92 Correct 18 ms 13148 KB Output is correct
93 Correct 2 ms 12120 KB Output is correct
94 Correct 70 ms 26060 KB Output is correct
95 Correct 67 ms 25924 KB Output is correct
96 Correct 59 ms 25172 KB Output is correct
97 Correct 64 ms 26056 KB Output is correct
98 Correct 66 ms 26464 KB Output is correct
99 Correct 55 ms 18004 KB Output is correct
100 Correct 55 ms 18104 KB Output is correct
101 Correct 54 ms 17888 KB Output is correct
102 Correct 67 ms 18256 KB Output is correct
103 Correct 59 ms 21892 KB Output is correct
104 Correct 61 ms 22224 KB Output is correct
105 Correct 56 ms 21892 KB Output is correct
106 Correct 59 ms 22096 KB Output is correct
107 Correct 58 ms 21844 KB Output is correct
108 Correct 66 ms 26100 KB Output is correct
109 Correct 65 ms 26156 KB Output is correct
110 Correct 47 ms 17656 KB Output is correct
111 Correct 45 ms 17748 KB Output is correct
112 Correct 81 ms 17956 KB Output is correct
113 Correct 65 ms 17840 KB Output is correct