-
Notifications
You must be signed in to change notification settings - Fork 1
/
main.cpp
279 lines (226 loc) · 6.28 KB
/
main.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
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
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
#include <iostream>
#include <string>
#include <vector>
#include <fstream>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <algorithm>
using namespace std;
class DNA {
public:
int first;
int last;
string d;
DNA(int f, int l, string dna):first(f),last(l),d(dna) {}
};
class Gene {
public:
int position;
int health;
Gene(int p, int h):position(p),health(h) {}
long long getHealth(int first, int last) {
if (first <= position && position <= last) {
return health;
}
return 0;
}
long long getHealth(DNA& dna) {
return getHealth(dna.first, dna.last);
}
};
class GeneTreeNode {
public:
int min;
long long health = 0; // undefined unless leaf
GeneTreeNode* left;
GeneTreeNode* right;
GeneTreeNode() {
left = nullptr;
right = nullptr;
}
GeneTreeNode(int p, long long h):min(p),health(h) {
left = nullptr;
right = nullptr;
}
GeneTreeNode(GeneTreeNode* l, GeneTreeNode* r):left(l),right(r) {
min = left->min;
}
long long getHealth(int position) {
if (left == nullptr) {
if (position < min) {
return 0;
} else {
return health;
}
} else {
if (position < right->min) {
return left->getHealth(position);
} else {
return right->getHealth(position);
}
}
}
};
GeneTreeNode* convert(vector<Gene*>& genes) {
if (genes.empty()) {
return new GeneTreeNode(0, 0);
}
long long sum = 0;
vector<GeneTreeNode*>* nodes = new vector<GeneTreeNode*>;
for (int i = 0; i < genes.size(); i++) {
sum += genes[i]->health;
nodes->push_back(new GeneTreeNode(genes[i]->position, sum));
}
vector<GeneTreeNode*>* nextNodes = new vector<GeneTreeNode*>;
while (nodes->size() != 1) {
for (int i = 0; i+1 < nodes->size(); i+=2) {
GeneTreeNode* node1 = nodes->at(i);
GeneTreeNode* node2 = nodes->at(i+1);
nextNodes->push_back(new GeneTreeNode(node1, node2));
}
if(!nodes->empty()) {
GeneTreeNode* node1 = nextNodes->back();
nextNodes->pop_back();
GeneTreeNode* node2 = nodes->back();
nextNodes->push_back(new GeneTreeNode(node1, node2));
}
vector<GeneTreeNode*>* temp = nextNodes;
nextNodes = nodes;
nodes = temp;
nextNodes->clear();
}
return nodes->front();
}
class TreeNode {
private:
TreeNode* children[26]; // Null pointer if no genes
public:
vector<Gene*> genes;
GeneTreeNode* geneTree;
TreeNode() {
for (int i = 0; i < 26; i++) {
children[i] = nullptr;
}
geneTree = nullptr;
}
bool hasChild(char c) {
return children[c-'a'] != nullptr;
}
TreeNode* getChild(char c) {
if (!hasChild(c)) {
children[c-'a'] = new TreeNode;
}
return children[c-'a'];
}
long long getHealth(DNA& dna) {
return geneTree->getHealth(dna.last) - geneTree->getHealth(dna.first - 1);
}
};
long long getHealth(TreeNode* root, DNA& dna) {
long long health = 0;
TreeNode* node;
for (int i = 0; i < dna.d.length(); i++) {
node = root;
for (int j = i; j < dna.d.length(); j++) {
if (node->hasChild(dna.d[j])) {
node = node->getChild(dna.d[j]);
health += node->getHealth(dna);
} else {
break;
}
}
}
return health;
}
string process(vector<DNA>& dna, vector<string>& genes, vector<int>& healths) {
cout << "Creating Tree" << endl;
TreeNode* root = new TreeNode;
set<TreeNode*> nodeSet;
for (int i = 0; i < genes.size(); i++) {
TreeNode* node = root;
for (int j = 0; j < genes[i].length(); j++) {
node = node->getChild(genes[i][j]);
nodeSet.insert(node);
}
node->genes.push_back(new Gene(i, healths[i]));
}
cout << "Tree created" << endl;
cout << "Creating Gene Trees" << endl;
vector<TreeNode*> nodes(nodeSet.begin(), nodeSet.end());
cout << "Conversion to vector complete" << endl;
for (vector<TreeNode*>::iterator it = nodes.begin(); it != nodes.end(); it++) {
TreeNode* node = *it;
node->geneTree = convert(node->genes);
}
cout << "Gene Trees created" << endl;
long long minHealth, maxHealth;
minHealth = maxHealth = getHealth(root, dna[0]);
for (int i = 1; i < dna.size(); i++) {
long long h = getHealth(root, dna[i]);
if (h < minHealth) {
minHealth = h;
} else if (h > maxHealth) {
maxHealth = h;
}
}
return to_string(minHealth) + " " + to_string(maxHealth);
}
int testCase(int testcase)
{
cout << "Starting" << endl;
// n
// genes
// health
// test cases
// first last d
ifstream file;
file.open("testcase_" + to_string(testcase) + ".txt");
int n;
file >> n;
vector<string> genes;
for (int i = 0; i < n; i++) {
string gene;
file >> gene;
genes.push_back(gene);
}
vector<int> healths;
for (int i = 0; i < n; i++) {
int health;
file >> health;
healths.push_back(health);
}
int s;
file >> s;
vector<DNA> dna;
for (int s_itr = 0; s_itr < s; s_itr++) {
int first, last;
string d;
file >> first >> last >> d;
dna.push_back(DNA(first, last, d));
}
cout << "Processing" << endl;
string result = process(dna, genes, healths);
cout << "Done Processing" << endl;
long long min, max;
file.close();
file.open("testcase_" + to_string(testcase) + "_output.txt");
file >> min >> max;
string answer = to_string(min) + " " + to_string(max);
cout << "Result: " << result << endl;
cout << "Answer: " << answer << endl;
if (result == answer) {
cout << "Correct answer" << endl;
} else {
cout << "Incorrect answer" << endl;
}
return 0;
}
int main() {
testCase(0);
testCase(13);
testCase(26);
testCase(31);
return 0;
}