# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
487908 | hoanghq2004 | Klasika (COCI20_klasika) | C++14 | 2474 ms | 466948 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>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
using namespace std;
const int Nmax = 2e5 + 10;
int sz;
struct node {
int to[2];
set <int> s;
};
vector <node> trie;
void add(int x, int ti) {
int u = 0;
for (int i = 29; i >= 0; --i) {
if (!trie[u].to[x >> i & 1]) {
trie.push_back(node());
trie[u].to[x >> i & 1] = trie.size() - 1;
}
u = trie[u].to[x >> i & 1];
trie[u].s.insert(ti);
}
}
int get(int x, int L, int R) {
int u = 0;
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... |