# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
770162 | taher | Klasika (COCI20_klasika) | C++17 | 2249 ms | 431452 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;
#ifdef LOCAL
#include "C:\GCC\debug.h"
#else
#define debug(...) void(42)
#endif
const int lg = 31;
struct Trie {
Trie* nxt[2];
set<int> st;
Trie() {
nxt[0] = nullptr;
nxt[1] = nullptr;
}
};
Trie *root;
void add(int x, int ins) {
Trie *t = root;
for (int i = lg - 1; i >= 0; i--) {
int bit = (x >> i) & 1;
# | 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... |