Timus/1992.cpp at main · Free-Denis/Timus · 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
#include <iostream>
#include <string>
using namespace std;

struct Clons {
	int programm;
	Clons* back;
	Clons* nextpr;
};
Clons* newclon(int p, Clons* b, Clons* r) {
	Clons* node = new Clons;
	node->programm = p;
	node->back = b;
	node->nextpr = r;
	return node;
};
void learn(int prog, Clons*& clone) {
	Clons* updated = newclon(prog, clone, nullptr);
	clone = updated;
}
void rback(Clons*& clone) {
	Clons* updated = newclon(clone->back->programm, clone->back->back, clone);
	clone = updated;
}
void rnext(Clons*& clone) {
	Clons* updated = newclon(clone->nextpr->programm, clone, clone->nextpr->nextpr);
	clone = updated;
}
Clons* cl[500000];
int main()
{
	int n, m;
	cin >> n >> m;
	m = 1;
	cl[1] = newclon(0,NULL,NULL);

	for (int i = 0; i < n; i++) {
		string s;
		int num, prog;
		cin >> s >> num;

		if (s[0] == 'l') {
			cin >> prog;
			learn(prog, cl[num]);
		}
		else
			if (s[0] == 'r' && s[1] == 'o') {
				rback(cl[num]);
			}
			else
				if (s[0] == 'r' && s[1] == 'e') {
					rnext(cl[num]);
				}
				else
					if (s[0] == 'c' && s[1] == 'l') {
						m++;
						cl[m] = newclon(cl[num]->programm, cl[num]->back, cl[num]->nextpr);
					}
					else {
						if (cl[num]->programm == 0)
							cout << "basic"<<endl;
						else
							cout << cl[num]->programm << endl;
					}
	}
	return 0;
}