제출 #637117

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
637117	2022-08-31 15:20:17	Blobo2_Blobo2	비밀 (JOI14_secret)	C++17	0 / 100	443 ms	4432 KiB

secret

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 "secret.h"
using namespace std;
int seg[4000],n,arr[1000],cnt=0;
void update(int idx=0,int l=0,int r = n-1){
  if(l == r){
    seg[idx] = arr[l];
    return;
  }
  int mid = (l+r)>>1;
  update(idx>>1,mid+1,r);
  update(idx>>1|1,l,mid);
  seg[idx] = Secret(seg[idx>>1], seg[idx>>1|1]);
}
int query(int L,int R,int idx=0,int l=0,int r=n-1){
  if(l >= L && r <= R)return seg[idx];
  if(r < L || l > R)return -1;
  int mid = (l+r)>>1;
  int first = query(L,R,idx>>1,mid+1,r);
  int second = query(L,R,idx>>1|1,l,mid);
  if(first != -1 && second != -1){
    cnt++;
    return Secret(first,second);
  }
  else if(first != -1)
    return first;
  else if(second != -1)
    return second;
  else return -1;
}
void Init(int N,int A[]){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 100