# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
930198 | duckindog | Klasika (COCI20_klasika) | C++17 | 5020 ms | 39652 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.
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include<bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
const int N = 2e5 + 10;
int n;
struct Query {
int a, t;
Query(int a = 0, int t = 0) : a(a), t(t) {}
};
vector<Query> Q[N];
struct trie {
int it;
vector<array<int, 2>> nwt;
vector<int> t;
void add(int val, int time) {
int g = 0;
for (int j = 30; j >= 1; --j) {
int bit = (val >> j - 1 & 1);
while (nwt.size() <= g) nwt.push_back(array<int, 2>());
if (!nwt[g][bit]) nwt[g][bit] = ++it;
g = nwt[g][bit];
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... |