Algorithms-Library/Treap on implicit keys.cpp at main · Alextz307/Algorithms-Library · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
#include <bits/stdc++.h>

using namespace std;

ifstream fin("grid.in");
ofstream fout("grid.out");

struct treapNode {
  treapNode* l;
  treapNode* r;
  int key, prior, sz;
};

using ptr = treapNode*;
using pt = pair<ptr, ptr>;
const int mod = 1610612741;
ptr emptyNode = new treapNode{nullptr, nullptr, 0, -1, 0};
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int n, k;

void updateNode(ptr node) {
  if (node != emptyNode) {
    node->sz = node->l->sz + 1 + node->r->sz;
  }
}

void heapify(ptr node) {
  if (node == emptyNode) {
    return;
  }
  ptr best = node;
  if (best->prior < node->l->prior) {
    best = node->l;
  }
  if (best->prior < node->r->prior) {
    best = node->r;
  }
  if (best != node) {
    swap(node->prior, best->prior);
    heapify(best);
  }
}

treapNode* build(int st, int dr, int lin) {
  int mid = (st + dr) / 2;
  treapNode* node = new treapNode{emptyNode, emptyNode, mid + lin * n, rng() % mod, 1};
  if (st < mid) {
    node->l = build(st, mid - 1, lin);
  }
  if (mid < dr) {
    node->r = build(mid + 1, dr, lin);
  }
  heapify(node);
  updateNode(node);
  return node;
}

pt split(ptr node, int k) {
  if (node == emptyNode) {
    return {emptyNode, emptyNode};
  }
  if (node->l->sz < k) {
    pt p = split(node->r, k - node->l->sz - 1);
    node->r = p.first;
    updateNode(node);
    return {node, p.second};
  }
  pt p = split(node->l, k);
  node->l = p.second;
  updateNode(node);
  return {p.first, node};
}

ptr join(ptr A, ptr B) {
  if (A == emptyNode) {
    return B;
  }
  if (B == emptyNode) {
    return A;
  }
  if (B->prior < A->prior) {
    A->r = join(A->r, B);
    updateNode(A);
    return A;
  }
  B->l = join(A, B->l);
  updateNode(B);
  return B;
}

int getElement(ptr node, int k) {
  if (node->l->sz + 1 == k) {
    return node->key;
  }
  if (k <= node->l->sz) {
    return getElement(node->l, k);
  }
  return getElement(node->r, k - node->l->sz - 1);
}

ptr ins(ptr node, int k, ptr newNode) {
  pt p = split(node, k - 1);
  return join(join(p.first, newNode), p.second);
}

ptr del(ptr node, int k) {
  pt p1 = split(node, k - 1);
  pt p2 = split(p1.second, 1);
  return join(p1.first, p2.second);
}

void dfs(ptr node) {
  if (node == emptyNode) {
    return;
  }
  dfs(node->l);
  fout << node->key << ' ';
  dfs(node->r);
}

void testCase() {
  fin >> n >> k;
  ptr roots[3];
  for (int i = 0; i < 3; ++i) {
    roots[i] = build(1, n, i);
  }
  for (int i = 0; i < k; ++i) {
    int x1, y1, x2, y2;
    fin >> x1 >> y1 >> x2 >> y2;
    y1 += 1, y2 += 1;
    int key = getElement(roots[x1], y1);
    roots[x1] = del(roots[x1], y1);
    roots[x2] = ins(roots[x2], y2, new treapNode{emptyNode, emptyNode, key, rng() % mod, 1});
  }
  for (int i = 0; i < 3; ++i) {
    dfs(roots[i]);
    fout << '\n';
  }
}

int main() {
  int tests = 1;
  for (int tc = 0; tc < tests; ++tc) {
    testCase();
  }
  fin.close();
  fout.close();
  return 0;
}