forked from Dev-XYS/Algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Splay(Single-Rotation).cpp
93 lines (86 loc) · 1.22 KB
/
Splay(Single-Rotation).cpp
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
#include <cstdio>
#define NIL 0
using namespace std;
struct node
{
int key, value;
node *ch[2];
node(int _key = 0, int _value = 0) : key(_key), value(_value) { ch[0] = ch[1] = NIL; }
}*root;
void rotate(node *&u, int dir)
{
node *o = u->ch[dir];
u->ch[dir] = o->ch[dir ^ 1];
o->ch[dir ^ 1] = u;
u = o;
}
void insert(node *&u, int key, int value)
{
if (u == NIL)
{
u = new node(key, value);
return;
}
if (key < u->key)
{
insert(u->ch[0], key, value);
rotate(u, 0);
}
else if (key > u->key)
{
insert(u->ch[1], key, value);
rotate(u, 1);
}
}
int find(node *&u, int key)
{
if (u == NIL)
{
return -1;
}
if (u->key == key)
{
return u->value;
}
int res;
if (key < u->key)
{
res = find(u->ch[0], key);
if (u->ch[0] != NIL)
rotate(u, 0);
}
else if (key > u->key)
{
res = find(u->ch[1], key);
if (u->ch[1] != NIL)
rotate(u, 1);
}
return res;
}
int main()
{
int in, key, value;
while (true)
{
scanf("%d", &in);
if (in == 1)
{
scanf("%d%d", &key, &value);
insert(root, key, value);
}
else if (in == 2)
{
scanf("%d", &key);
printf("%d\n", find(root, key));
}
else if (in == 0)
{
return 0;
}
else
{
printf("No such command!\n");
}
}
return 0;
}