oj.uz

Submission #774180

# Submission time Handle Problem Language Result Execution time Memory
774180 2023-07-05T12:38:39 Z arush_agu Ball Machine (BOI13_ballmachine) C++17
100 / 100
 720 ms 24004 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 <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<pair<int, ii>> viii;
typedef vector<vii> vvii;
typedef vector<viii> vviii;

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;

const int MAXLG = 18;
const int MAXN = 1e5 + 1;
int n, q, root;
int par[MAXN], mn_subtree[MAXN], depth[MAXN], tin[MAXN], tout[MAXN],
    up[MAXLG][MAXN], cnt_cball[MAXN];
vi child[MAXN];
bool is_ball[MAXN], inq[MAXN];
int timer = 0;

void f(int u, int p) {
  tin[u] = ++timer;
  mn_subtree[u] = u;
  for (int &v : child[u]) {
    depth[v] = depth[u] + 1;
    f(v, u);
    mn_subtree[u] = min(mn_subtree[u], mn_subtree[v]);
  }
  tout[u] = ++timer;
}

void solve() {
  cin >> n >> q;
  for (int i = 0; i < n; ++i) {
    cin >> par[i];
    if (--par[i] == -1)
      root = i;
  }

  for (int i = 0; i < n; ++i)
    if (i != root)
      child[par[i]].push_back(i);

  depth[root] = 0;
  f(root, -1);

  for (int i = 0; i < n; ++i)
    up[0][i] = par[i];

  for (int j = 1; j < MAXLG; ++j)
    for (int i = 0; i < n; ++i) {
      if (up[j - 1][i] != -1)
        up[j][i] = up[j - 1][up[j - 1][i]];
      else
        up[j][i] = -1;
    }

  auto is_anc = [&](int u, int v) {
    return tin[v] <= tin[u] && tout[u] <= tout[v];
  };

  auto kth_anc = [&](int u, int k) {
    for (int i = MAXLG - 1; i >= 0; --i)
      if (k & (1 << i)) {
        u = up[i][u];
      }
    return u;
  };

  auto just_lca = [&](int u, int v) -> ii {
    if (depth[u] > depth[v])
      u = kth_anc(u, depth[u] - depth[v]);
    else
      v = kth_anc(v, depth[v] - depth[u]);

    u = kth_anc(u, depth[u] - depth[v]);

    for (int i = MAXLG - 1; i >= 0; --i)
      if (up[i][u] != up[i][v]) {
        u = up[i][u];
        v = up[i][v];
      }

    return {u, v};
  };

  auto s_cmp = [&](int u, int v) -> bool {
    if (u == v)
      return 0;
    if (is_anc(u, v))
      return 0;
    if (is_anc(v, u))
      return 1;
    auto [x, y] = just_lca(u, v);
    return mn_subtree[x] > mn_subtree[y];
  };

  priority_queue<int, vi, decltype(s_cmp)> s(s_cmp);
  for (int i = 0; i < n; ++i)
    if (child[i].empty())
      s.push(i), inq[i] = 1;

  while (q--) {
    int t, x;
    cin >> t >> x;

    if (t == 1) {
      for (int i = 1; i <= x; ++i) {
        int u = s.top();
        s.pop();

        inq[u] = 0;
        is_ball[u] = 1;

        if (u != root)
          if (++cnt_cball[par[u]] == child[par[u]].size() && !inq[par[u]])
            s.push(par[u]), inq[par[u]] = 1;

        if (i == x)
          cout << u + 1 << "\n";
      }
    } else {
      --x;
      int l = 1, r = depth[x], ans = x;
      while (l <= r) {
        int mid = (l + r) / 2;
        int anc = kth_anc(x, mid);
        if (is_ball[anc]) {
          ans = anc;
          l = mid + 1;
        } else
          r = mid - 1;
      }

      is_ball[ans] = 0;
      if (ans != root)
        cnt_cball[par[ans]]--;
      if (!inq[ans])
        s.push(ans), inq[ans] = 1;

      cout << depth[x] - depth[ans] << "\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

ballmachine.cpp: In function 'void solve()':
ballmachine.cpp:197:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  197 |           if (++cnt_cball[par[u]] == child[par[u]].size() && !inq[par[u]])
      |               ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
ballmachine.cpp: In function 'int main()':
ballmachine.cpp:231:11: warning: unused variable 'start' [-Wunused-variable]
  231 |   clock_t start = clock();
      |           ^~~~~

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2772 KB Output is correct
2 Correct 337 ms 11680 KB Output is correct
3 Correct 151 ms 11332 KB Output is correct
4 Correct 2 ms 2772 KB Output is correct
5 Correct 2 ms 2816 KB Output is correct
6 Correct 3 ms 2900 KB Output is correct
7 Correct 3 ms 2900 KB Output is correct
8 Correct 3 ms 2900 KB Output is correct
9 Correct 15 ms 3368 KB Output is correct
10 Correct 65 ms 4988 KB Output is correct
11 Correct 312 ms 11772 KB Output is correct
12 Correct 151 ms 11312 KB Output is correct
13 Correct 267 ms 11672 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 6868 KB Output is correct
2 Correct 629 ms 19340 KB Output is correct
3 Correct 156 ms 14740 KB Output is correct
4 Correct 183 ms 8368 KB Output is correct
5 Correct 244 ms 8316 KB Output is correct
6 Correct 225 ms 8160 KB Output is correct
7 Correct 269 ms 7568 KB Output is correct
8 Correct 30 ms 6940 KB Output is correct
9 Correct 337 ms 19872 KB Output is correct
10 Correct 720 ms 19344 KB Output is correct
11 Correct 474 ms 19256 KB Output is correct
12 Correct 719 ms 17440 KB Output is correct
13 Correct 60 ms 20472 KB Output is correct
14 Correct 158 ms 14764 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 169 ms 11428 KB Output is correct
2 Correct 577 ms 17952 KB Output is correct
3 Correct 124 ms 19560 KB Output is correct
4 Correct 269 ms 16552 KB Output is correct
5 Correct 312 ms 16260 KB Output is correct
6 Correct 308 ms 16284 KB Output is correct
7 Correct 332 ms 14944 KB Output is correct
8 Correct 123 ms 19468 KB Output is correct
9 Correct 431 ms 19924 KB Output is correct
10 Correct 576 ms 19528 KB Output is correct
11 Correct 535 ms 19548 KB Output is correct
12 Correct 612 ms 17916 KB Output is correct
13 Correct 225 ms 24004 KB Output is correct
14 Correct 275 ms 15776 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 430 ms 19920 KB Output is correct
2 Correct 642 ms 17848 KB Output is correct
3 Correct 60 ms 22588 KB Output is correct
4 Correct 501 ms 20076 KB Output is correct
5 Correct 619 ms 19396 KB Output is correct
6 Correct 481 ms 19148 KB Output is correct
7 Correct 646 ms 17816 KB Output is correct
8 Correct 66 ms 22632 KB Output is correct
9 Correct 133 ms 14720 KB Output is correct