algorithms/bor.cpp at main · MironBaratelia/algorithms · 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
#include <iostream>
#include <vector>
#include <fstream>
#include <algorithm>
#include <string>

using namespace std;

struct Node {
	int cnt;
	int sum;
	vector<Node*> kids;
	Node() {
		cnt = 0;
		sum = 0;
		kids.resize(26, nullptr);
	}
};

void add(Node* v, const string& s, int pos) {
	if (pos == s.size()) {
		v->cnt++;
		v->sum++;
		return;
	}
	v->sum++;
	int kid = s[pos] - 'a';
	if (v->kids[kid] == nullptr) {
		v->kids[kid] = new Node();
	}
	add(v->kids[kid], s, pos + 1);
}


bool del(Node* v, const string& s, int pos) {
	if (pos == s.size()) {
		if (v->cnt == 0) {
			return 0;
		}
		else {
			v->cnt--;
			v->sum--;
			return 1;
		}
	}
	int kid = s[pos] - 'a';
	if (v->kids[kid] == nullptr) {
		return 0;
	}
	bool res = del(v->kids[kid], s, pos + 1);
	if (res) {
		v->sum--;
	}
	if (v->kids[kid]->sum == 0) {
		delete v->kids[kid];
		v->kids[kid] = nullptr;
	}
	return res;
}

int main() {
	Node* root = new Node();

	string s;
	cin >> s;

	add(root, s, 0);
}