# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
308337 | ErdosSzekeres | Klasika (COCI20_klasika) | C++14 | 3616 ms | 499944 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;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define pii pair<int,int>
const int MAXN = 3e5+7;
int q;
int tp[MAXN], a[MAXN], b[MAXN], d[MAXN], t=0, ent[MAXN], sai[MAXN];
int fe[8*MAXN], fd[8*MAXN], node_counter = 0;
set<int> aux[8*MAXN];//entry times
int create(){
node_counter++;
fe[node_counter] = -1;
fd[node_counter] = -1;
aux[node_counter].insert(1<<30+1);
return node_counter;
}
vector<pii> G[MAXN];
void inserir(int idx, int depth, int val, int et){
aux[idx].insert(et);
if(depth < 0)return;
if((val&(1<<depth))){//go right
if(fd[idx] == -1)fd[idx] = create();
inserir(fd[idx], depth-1, val, et);
}else{
if(fe[idx] == -1)fe[idx] = create();
inserir(fe[idx], depth-1, val, et);
}
}
void dfs(int u){
t++; ent[u] = t;
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... |