Submission #68179086

---

Source Code Expand

#include <bits/stdc++.h>
#define SZ(x) ((int)(x).size())
#define ALL(x) begin(x), end(x)
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define REP1(i, a, b) for (int i = (a); i <= int(b); i++)

#if __has_include("shik/dump.h")
#include "shik/dump.h"  // IWYU pragma: keep
#else
#define dump(...) 0
#endif

using namespace std;

using i64 = int64_t;

const int Q = 5e5 + 10;
const int L = 19;
const i64 INF = 1e18;

struct Jump {
  int to;
  i64 off;
};

i64 len[Q];
int lc[Q], rc[Q];
Jump jump[Q][L];

void build(int id, int l, int r) {
  len[id] = min(INF, len[l] + len[r]);
  lc[id] = l;
  rc[id] = r;

  jump[id][0] = (len[l] >= len[r]) ? Jump{l, 0} : Jump{r, len[l]};
  for (int i = 1; i < L; i++) {
    auto j1 = jump[id][i - 1];
    auto j2 = jump[j1.to][i - 1];
    jump[id][i] = {j2.to, min(INF, j1.off + j2.off)};
  }
}

int solve(int id, int l, int r, i64 x) {
  while (id >= 2) {
    for (int i = L - 1; i >= 0 && id >= 2; i--) {
      auto& j = jump[id][i];
      if (x > j.off && x <= j.off + len[j.to]) {
        x -= j.off;
        id = j.to;
      }
    }
    if (id < 2) return id;
    if (x > len[lc[id]]) {
      x -= len[lc[id]];
      id = rc[id];
    } else {
      id = lc[id];
    }
  }
  return id;
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  len[0] = len[1] = 1;
  for (int i = 0; i < L; i++) {
    jump[0][i] = {0, 0};
    jump[1][i] = {1, 0};
  }

  int q;
  cin >> q;
  for (int i = 2; i < q + 2; i++) {
    int l, r;
    i64 x;
    cin >> l >> r >> x;
    build(i, l, r);
    cout << solve(i, l, r, x) << '\n';
  }
}

Submission Info

Compile Error

Main.cpp: In function ‘int solve(int, int, int, i64)’:
Main.cpp:43:23: warning: unused parameter ‘l’ [-Wunused-parameter]
   43 | int solve(int id, int l, int r, i64 x) {
      |                   ~~~~^
Main.cpp:43:30: warning: unused parameter ‘r’ [-Wunused-parameter]
   43 | int solve(int id, int l, int r, i64 x) {
      |                          ~~~~^

Judge Result