Submission #27977146

---

Source Code Expand

#include <algorithm>
#include <iostream>
#include <vector>

using namespace std;

struct UnionFind {
  std::vector<int> parent_or_size;
  int cnt;

  UnionFind(int n) : parent_or_size(n, -1), cnt(n) {}

  void unite(int x, int y) {
    x = find_root(x);
    y = find_root(y);
    if (x == y) {
      return;
    }
    if (-parent_or_size[x] < -parent_or_size[y]) {
      std::swap(x, y);
    }
    parent_or_size[x] += parent_or_size[y];
    parent_or_size[y] = x;
    cnt--;
  }
  bool is_same_root(int x, int y) { return find_root(x) == find_root(y); }
  int find_root(int x) {
    if (parent_or_size[x] < 0) {
      return x;
    }
    return parent_or_size[x] = find_root(parent_or_size[x]);
  }
  int size(int x) { return -parent_or_size[find_root(x)]; }
};

int main() {
  int L, Q;
  std::cin >> L >> Q;

  std::vector<int> c(Q), x(Q);
  std::vector<int> cuts;

  cuts.push_back(0);
  for (int i = 0; i < Q; i++) {
    std::cin >> c[i] >> x[i];
    if (c[i] == 1) {
      cuts.push_back(x[i]);
    }
  }
  cuts.push_back(L);

  int siz = cuts.size();
  UnionFind uf_tree(siz - 1);

  sort(cuts.begin(), cuts.end());
  for (int i = 0; i < siz - 1; i++) {
    uf_tree.parent_or_size[i] = -(cuts[i + 1] - cuts[i]);
  }

  vector<int> ans;
  for (int i = Q - 1; i >= 0; i--) {
    int idx = std::lower_bound(cuts.begin(), cuts.end(), x[i]) - cuts.begin();

    if (c[i] == 1) {
      uf_tree.unite(idx, idx - 1);
    }
    if (c[i] == 2) {
      ans.push_back(uf_tree.size(idx - 1));
    }
  }

  reverse(ans.begin(), ans.end());
  for (int a : ans) {
    cout << a << "\n";
  }

  return 0;
}

Submission Info

Judge Result