# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
671099 | GusterGoose27 | Selling RNA Strands (JOI16_selling_rna) | C++11 | 577 ms | 671136 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5;
int ans[MAXN];
vector<int> queries[MAXN];
int n, m;
map<char, int> conv({{'A', 0}, {'U', 1}, {'G', 2}, {'C', 3}});
class Trie {
public:
Trie *nxt[4];
int sz;
Trie *rev_t;
int term = 0; // num ending at this position
vector<int> rev_queries;
vector<int> seq;
Trie() {
sz = 0;
for (int i = 0; i < 4; i++) nxt[i] = nullptr;
}
void merge(Trie *oth) {
sz += oth->sz;
for (int i = 0; i < 4; i++) {
if (nxt[i] == nullptr) nxt[i] = oth->nxt[i];
else if (oth->nxt[i] != nullptr) nxt[i]->merge(oth->nxt[i]);
}
// delete oth;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |