Function main

Data Structures/Top Tree.cpp:476–540

};

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

  int N; cin >> N;
  vector<top_tree_node> nodes(2*N-1);
  for (int i = 0; i < 2 * N - 1; i++) {
    nodes[i].__id = i;
  }

  for (int i = 0; i < N; i++) {
    top_tree_node* n = &nodes[i];
    n->is_path = n->is_vert = true;
    n->update();
  }

  for (int e = 0; e < N-1; e++) {
    int u, v; cin >> u >> v; u--, v--;
    top_tree_node* a = &nodes[u];
    top_tree_node* b = &nodes[v];
    link(&nodes[N+e], a, b);
  }

  int Q; cin >> Q;
  while (Q--) {
    int op; cin >> op;
    if (op == 1) {
      int u, v; cin >> u >> v; u--, v--;
      auto sub = get_subtree(&nodes[u], &nodes[v]);
      sub->do_subtree_increment();
      sub->downdate();
      sub->update_all();
    } else if (op == 2) {
      int u, v; cin >> u >> v; u--, v--;
      auto pth = get_path(&nodes[u], &nodes[v]);
      pth->do_path_increment();
      pth->downdate();
      pth->update_all();
    } else if (op == 3) {
      int v; cin >> v; v--;
      nodes[v].make_root();
      cout << nodes[v].tot_ans[0] << '\n';
    } else assert(false);

    /*
    cerr << "dumping tree" << '\n';
    for (int z = 0; z < 2*N-1; z++) {
      cerr << "node " << z << '\n';
      cerr << "par: " << (nodes[z].p ? nodes[z].p->__id : -1) << '\n';
      cerr << "subtree_size: " << nodes[z].subtree_size << '\n';
      cerr << "path_size: " << nodes[z].path_size << '\n';
      cerr << "subtree_lazy: " << nodes[z].subtree_lazy << '\n';
      cerr << "path_lazy: " << nodes[z].path_lazy << '\n';
      cerr << "tot_A: " << nodes[z].tot_A << '\n';
      cerr << "own_A: " << nodes[z].own_A << '\n';
      cerr << "tot_sub_d[0]: " << nodes[z].tot_sub_d[0] << '\n';
      cerr << "tot_sub_d[1]: " << nodes[z].tot_sub_d[1] << '\n';
      cerr << "tot_ans[0]: " << nodes[z].tot_ans[0] << '\n';
      cerr << "tot_ans[1]: " << nodes[z].tot_ans[1] << '\n';