# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
476029 | KhaledFarhat | Klasika (COCI20_klasika) | C++14 | 2922 ms | 471308 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;
struct TrieNode {
TrieNode() {
memset(child, 0, sizeof child);
}
int child[2];
set<int> times;
};
struct Trie {
Trie() {
fetchNode();
root = fetchNode();
}
void insert(int number, int inTime) {
int current = root;
for (int bit = 30; bit >= 0; --bit) {
bool value = number & (1 << bit);
if (nodes[current].child[value] == 0) {
int index = fetchNode();
nodes[current].child[value] = index;
}
current = nodes[current].child[value];
# | 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... |