제출 #459656

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
459656	2021-08-08 22:28:34	Antekb	Klasika (COCI20_klasika)	C++14	33 / 110	5060 ms	14572 KiB

klasika

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include<bits/stdc++.h>
#define st first
#define nd second
using namespace std;
const int N = (1<<18), M=6e7;
int pre[N], post[N], xo[N];
vector<int> E[N];
int L[M], R[M];
int wsk;
int root[N+N];
void dfs(int v){
  pre[v]=wsk++;
  for(int u:E[v])dfs(u);
  post[v]=wsk;
}
const int K=31;
void ins(int r, int x){
  //cout<<"+ "<<r<<" "<<x<<"\n";
  for(int i=K-1; i>=0; i--){
    if(x&(1<<i)){
      if(!L[r])L[r]=wsk++;
      r=L[r];
    }
    else{
      if(!R[r])R[r]=wsk++;
      r=R[r];
    }
  }
}
int find(int r, int x){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 11 / 11
• Subtask 2: 22 / 22
• Subtask 3: 0 / 33
• Subtask 4: 0 / 44