# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1093015 | Hacv16 | Klasika (COCI20_klasika) | C++17 | 111 ms | 38116 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 MAX = 2e5 + 15;
const int LOG = 31;
int n = 1, q, x[MAX];
struct Trie
{
int numNodes;
vector<array<int, 2>> trie;
int create()
{
trie.push_back({ 0, 0 });
return numNodes++;
}
Trie(void){ numNodes = 0; create(); }
void add(int x)
{
int cur = 0;
for(int i = LOG - 1; i >= 0; i--)
{
bool id = (x & (1 << i));
if(trie[cur][id] == 0)
# | 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... |