oj.uz

답안 #824377

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
824377 2023-08-14T04:52:32 Z arush_agu Railway (BOI17_railway) C++17
100 / 100
 83 ms 60548 KB 
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

#ifdef DEBUG
#include <time.h>
#endif

#define all(a) (a).begin(), (a).end()
#define rev(a) (a).rbegin(), (a).rend()
#define F first
#define S second
int recur_depth = 0;
#ifdef DEBUG
#define dbg(x)                                                                 \
  {                                                                            \
    ++recur_depth;                                                             \
    auto x_ = x;                                                               \
    --recur_depth;                                                             \
    cerr << string(recur_depth, '\t') << "\e[91m" << __func__ << ":"           \
         << __LINE__ << "\t" << #x << " = " << x_ << "\e[39m" << endl;         \
  }
#else
#define dbg(x)
#endif

using namespace std;
using namespace __gnu_pbds;

typedef pair<int, int> ii;

typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> llll;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pair<int, int>> vii;
typedef vector<vii> vvii;

typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pair<ll, ll>> vll;
typedef vector<vll> vvll;

typedef vector<bool> vb;

template <class type1>
using ordered_set = tree<type1, null_type, less<type1>, rb_tree_tag,
                         tree_order_statistics_node_update>;

template <typename A, typename B>
ostream &operator<<(ostream &os, const pair<A, B> &p) {
  return os << '(' << p.first << ", " << p.second << ')';
}
template <typename T_container, typename T = typename enable_if<
                                    !is_same<T_container, string>::value,
                                    typename T_container::value_type>::type>
ostream &operator<<(ostream &os, const T_container &v) {
  os << '{';
  string sep;
  for (const T &x : v)
    os << sep << x, sep = ", ";
  return os << '}';
}

const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll INF = 1e9;
const ld EPS = 1e-9;

struct Edge {
  int u, v, idx;
  int cnt_req;

  Edge(int u, int v, int idx) : u(u), v(v), idx(idx) {}
};

struct ST {
  const int MAXLG = 22;
  int n;
  vi lg2;
  vvii st;

  ST(vii &a) : n(a.size()) {
    st = vvii(MAXLG, vii(n));
    st[0] = a;
    for (int j = 1; j < MAXLG; j++)
      for (int i = 0; i + (1 << j) <= n; i++)
        st[j][i] = min(st[j - 1][i], st[j - 1][i + (1 << (j - 1))]);

    lg2 = vi(n + 1);
    lg2[1] = 0;
    for (int i = 2; i <= n; i++)
      lg2[i] = lg2[i / 2] + 1;
  }

  int query(int l, int r) {
    if (l > r)
      swap(l, r);
    int k = lg2[r - l + 1];
    return min(st[k][l], st[k][r - (1 << k) + 1]).second;
  }
};

void solve() {
  int n, m, k;
  cin >> n >> m >> k;
  vvii adj(n);
  vector<Edge> eds;
  for (int i = 0; i < n - 1; i++) {
    int u, v;
    cin >> u >> v;
    u--, v--;
    adj[u].push_back({v, i});
    adj[v].push_back({u, i});
    eds.push_back(Edge(u, v, i));
  }

  int timer = 0;
  vi depth(n), first_occ(n);
  vii par(n, {-1, -1}), euler;
  function<void(int, int)> f = [&](int u, int p) {
    first_occ[u] = euler.size();
    euler.push_back({depth[u], u});

    for (auto [v, i] : adj[u])
      if (v != p) {
        depth[v] = depth[u] + 1;
        par[v] = {u, i};
        f(v, u);
        euler.push_back({depth[u], u});
      }
  };
  f(0, -1);

  ST st(euler);

  vi cnt(n);
  for (int i = 0; i < m; i++) {
    int s;
    cin >> s;
    vi us(s);
    for (int &x : us)
      cin >> x, x--;

    sort(all(us), [&](int x, int y) { return first_occ[x] < first_occ[y]; });
    us.push_back(us[0]);

    for (int i = 0; i < s; i++) {
      int u = us[i], v = us[i + 1];
      cnt[u]++, cnt[v]++;
      cnt[st.query(first_occ[u], first_occ[v])] -= 2;
    }
  }

  function<void(int, int)> g = [&](int u, int p) {
    for (auto [v, i] : adj[u])
      if (v != p) {
        g(v, u);
        cnt[u] += cnt[v];
      }
  };
  g(0, -1);

  assert(cnt[0] == 0);
  for (int i = 1; i < n; i++) {
    eds[par[i].second].cnt_req = cnt[i];
  }

  vi res;
  for (int i = 0; i < n - 1; i++)
    if (eds[i].cnt_req >= 2 * k)
      res.push_back(i);

  cout << res.size() << "\n";
  for (int &x : res)
    cout << x + 1 << " ";
  cout << "\n";
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);

  clock_t start = clock();

  int test_cases = 1;
  // cin >> test_cases;

  while (test_cases--)
    solve();

#ifdef DEBUG
  cerr << fixed << setprecision(10)
       << "\nTime Taken: " << (double)(clock() - start) / CLOCKS_PER_SEC
       << "s\n";
#endif
  return 0;
}

Compilation message

railway.cpp: In function 'void solve()':
railway.cpp:140:7: warning: unused variable 'timer' [-Wunused-variable]
  140 |   int timer = 0;
      |       ^~~~~
railway.cpp: In function 'int main()':
railway.cpp:206:11: warning: unused variable 'start' [-Wunused-variable]
  206 |   clock_t start = clock();
      |           ^~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 6 ms 5204 KB Output is correct
3 Correct 5 ms 5328 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 6 ms 5836 KB Output is correct
7 Correct 6 ms 5328 KB Output is correct
8 Correct 6 ms 5324 KB Output is correct
9 Correct 5 ms 5328 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 216 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 6 ms 5204 KB Output is correct
3 Correct 5 ms 5328 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 6 ms 5836 KB Output is correct
7 Correct 6 ms 5328 KB Output is correct
8 Correct 6 ms 5324 KB Output is correct
9 Correct 5 ms 5328 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 216 KB Output is correct
15 Correct 13 ms 5456 KB Output is correct
16 Correct 13 ms 5572 KB Output is correct
17 Correct 14 ms 5552 KB Output is correct
18 Correct 6 ms 5856 KB Output is correct
19 Correct 6 ms 5328 KB Output is correct
20 Correct 12 ms 5680 KB Output is correct
21 Correct 14 ms 5552 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 5 ms 5224 KB Output is correct
24 Correct 5 ms 5320 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 8 ms 5808 KB Output is correct
28 Correct 5 ms 5332 KB Output is correct
29 Correct 5 ms 5328 KB Output is correct
30 Correct 5 ms 5328 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 1 ms 316 KB Output is correct
35 Correct 0 ms 212 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 67 ms 58272 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 68 ms 57752 KB Output is correct
4 Correct 66 ms 57536 KB Output is correct
5 Correct 64 ms 58432 KB Output is correct
6 Correct 66 ms 58504 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 61 ms 52536 KB Output is correct
2 Correct 66 ms 47820 KB Output is correct
3 Correct 66 ms 47228 KB Output is correct
4 Correct 65 ms 47196 KB Output is correct
5 Correct 65 ms 47172 KB Output is correct
6 Correct 66 ms 52548 KB Output is correct
7 Correct 76 ms 52600 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 61 ms 52536 KB Output is correct
2 Correct 66 ms 47820 KB Output is correct
3 Correct 66 ms 47228 KB Output is correct
4 Correct 65 ms 47196 KB Output is correct
5 Correct 65 ms 47172 KB Output is correct
6 Correct 66 ms 52548 KB Output is correct
7 Correct 76 ms 52600 KB Output is correct
8 Correct 63 ms 52504 KB Output is correct
9 Correct 62 ms 52604 KB Output is correct
10 Correct 64 ms 58556 KB Output is correct
11 Correct 62 ms 58512 KB Output is correct
12 Correct 66 ms 47436 KB Output is correct
13 Correct 55 ms 48460 KB Output is correct
14 Correct 63 ms 48452 KB Output is correct
15 Correct 83 ms 48468 KB Output is correct
16 Correct 69 ms 48544 KB Output is correct
17 Correct 70 ms 48520 KB Output is correct
18 Correct 66 ms 48456 KB Output is correct
19 Correct 64 ms 49024 KB Output is correct
20 Correct 64 ms 54304 KB Output is correct
21 Correct 64 ms 54524 KB Output is correct
22 Correct 76 ms 54264 KB Output is correct

Subtask #6
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 6 ms 5204 KB Output is correct
3 Correct 5 ms 5328 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 6 ms 5836 KB Output is correct
7 Correct 6 ms 5328 KB Output is correct
8 Correct 6 ms 5324 KB Output is correct
9 Correct 5 ms 5328 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 216 KB Output is correct
15 Correct 13 ms 5456 KB Output is correct
16 Correct 13 ms 5572 KB Output is correct
17 Correct 14 ms 5552 KB Output is correct
18 Correct 6 ms 5856 KB Output is correct
19 Correct 6 ms 5328 KB Output is correct
20 Correct 12 ms 5680 KB Output is correct
21 Correct 14 ms 5552 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 5 ms 5224 KB Output is correct
24 Correct 5 ms 5320 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 8 ms 5808 KB Output is correct
28 Correct 5 ms 5332 KB Output is correct
29 Correct 5 ms 5328 KB Output is correct
30 Correct 5 ms 5328 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 1 ms 316 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 67 ms 58272 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 68 ms 57752 KB Output is correct
39 Correct 66 ms 57536 KB Output is correct
40 Correct 64 ms 58432 KB Output is correct
41 Correct 66 ms 58504 KB Output is correct
42 Correct 61 ms 52536 KB Output is correct
43 Correct 66 ms 47820 KB Output is correct
44 Correct 66 ms 47228 KB Output is correct
45 Correct 65 ms 47196 KB Output is correct
46 Correct 65 ms 47172 KB Output is correct
47 Correct 66 ms 52548 KB Output is correct
48 Correct 76 ms 52600 KB Output is correct
49 Correct 63 ms 52504 KB Output is correct
50 Correct 62 ms 52604 KB Output is correct
51 Correct 64 ms 58556 KB Output is correct
52 Correct 62 ms 58512 KB Output is correct
53 Correct 66 ms 47436 KB Output is correct
54 Correct 55 ms 48460 KB Output is correct
55 Correct 63 ms 48452 KB Output is correct
56 Correct 83 ms 48468 KB Output is correct
57 Correct 69 ms 48544 KB Output is correct
58 Correct 70 ms 48520 KB Output is correct
59 Correct 66 ms 48456 KB Output is correct
60 Correct 64 ms 49024 KB Output is correct
61 Correct 64 ms 54304 KB Output is correct
62 Correct 64 ms 54524 KB Output is correct
63 Correct 76 ms 54264 KB Output is correct
64 Correct 63 ms 54180 KB Output is correct
65 Correct 77 ms 48556 KB Output is correct
66 Correct 68 ms 48456 KB Output is correct
67 Correct 64 ms 48456 KB Output is correct
68 Correct 52 ms 48576 KB Output is correct
69 Correct 51 ms 48448 KB Output is correct
70 Correct 66 ms 54636 KB Output is correct
71 Correct 61 ms 53980 KB Output is correct
72 Correct 1 ms 212 KB Output is correct
73 Correct 5 ms 5316 KB Output is correct
74 Correct 5 ms 5328 KB Output is correct
75 Correct 1 ms 212 KB Output is correct
76 Correct 0 ms 320 KB Output is correct
77 Correct 5 ms 5844 KB Output is correct
78 Correct 5 ms 5328 KB Output is correct
79 Correct 8 ms 5336 KB Output is correct
80 Correct 5 ms 5344 KB Output is correct
81 Correct 0 ms 212 KB Output is correct
82 Correct 1 ms 212 KB Output is correct
83 Correct 0 ms 212 KB Output is correct
84 Correct 0 ms 212 KB Output is correct
85 Correct 0 ms 212 KB Output is correct
86 Correct 13 ms 5540 KB Output is correct
87 Correct 13 ms 5552 KB Output is correct
88 Correct 13 ms 5552 KB Output is correct
89 Correct 6 ms 5844 KB Output is correct
90 Correct 6 ms 5328 KB Output is correct
91 Correct 12 ms 5624 KB Output is correct
92 Correct 14 ms 5608 KB Output is correct
93 Correct 0 ms 212 KB Output is correct
94 Correct 70 ms 60160 KB Output is correct
95 Correct 65 ms 59576 KB Output is correct
96 Correct 62 ms 58932 KB Output is correct
97 Correct 62 ms 60128 KB Output is correct
98 Correct 72 ms 60548 KB Output is correct
99 Correct 65 ms 48532 KB Output is correct
100 Correct 67 ms 48596 KB Output is correct
101 Correct 66 ms 48536 KB Output is correct
102 Correct 63 ms 49060 KB Output is correct
103 Correct 62 ms 53996 KB Output is correct
104 Correct 72 ms 54416 KB Output is correct
105 Correct 62 ms 54016 KB Output is correct
106 Correct 63 ms 54168 KB Output is correct
107 Correct 63 ms 54000 KB Output is correct
108 Correct 74 ms 60208 KB Output is correct
109 Correct 64 ms 60196 KB Output is correct
110 Correct 54 ms 48488 KB Output is correct
111 Correct 54 ms 48412 KB Output is correct
112 Correct 69 ms 48512 KB Output is correct
113 Correct 66 ms 48552 KB Output is correct