Submission #65507569

---

Source Code Expand

#include <bits/extc++.h>
#include <bits/stdc++.h>
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using ti = tuple<int, int, int>;
using tree = tree<int, null_type, less<int>, rb_tree_tag,
                  tree_order_statistics_node_update>;
int A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y,
    Z;
int dx[] = {0, 0, -1, 1}, dy[] = {1, -1, 0, 0};
int chkd[5101010];
class segtree {
public:
  int size;
  vector<ll> tree;
  segtree(int n) {
    size = 1;
    while (size < n)
      size *= 2;
    tree.assign(2 * size, 1);
    init(1, 1, size);
  }
  void init(int node, int l, int r) {
    if (l == r) {
      tree[node] = 1;
    } else {
      int mid = (l + r) / 2;
      init(node * 2, l, mid);
      init(node * 2 + 1, mid + 1, r);
      tree[node] = tree[node * 2] + tree[node * 2 + 1];
    }
  }
  void update(int pos, ll v) {
    pos += size - 1;
    tree[pos] = v;
    while (pos > 1) {
      pos /= 2;
      tree[pos] = tree[2 * pos] + tree[2 * pos + 1];
    }
  }
  ll kth(int n, int s, int e, int k) {
    if (s == e) {
      return s;
    }
    int mid = (s + e) / 2;
    if (tree[2 * n] >= k) {
      return kth(2 * n, s, mid, k);
    } else {
      return kth(2 * n + 1, mid + 1, e, k - tree[2 * n]);
    }
  }
  ll kth(int k) { return kth(1, 1, size, k); }
};
int main() {
  cin.tie(0)->sync_with_stdio(0);
  cin >> T;
  segtree st(3'500'000);
  while (T--) {
    cin >> A >> B;
    if (A <= 3'000'000 && !chkd[A]) {
      // process A
      for (int j = A; j <= 3'000'000; j += A) {
        chkd[j] = 1;
        st.update(j, 0);
      }
    }
    cout << st.kth(B) << '\n';
  }
}

Submission Info

Judge Result