제출 #1292240

#제출 시각아이디문제언어결과실행 시간메모리
1292240FaresSTHSecret (JOI14_secret)C++20
0 / 100
337 ms4296 KiB
#include"bits/stdc++.h" #include "secret.h" using namespace std; using ll=long long; #define S second #define F first const int N=1024; vector<int>tn(N*2,-1); int mrg(int a,int b){ if(a==-1&&b==-1)return -1; if(b==-1)return a; if(a==-1)return b; return Secret(a,b); } void Init(int n,int a[]){ for(int i=0;i<n;i++)tn[i+N]=a[i]; for(int i=N-1;i>0;i--)tn[i]=mrg(tn[i*2],tn[i*2+1]); } int Query(int l,int r){ int res=-1; for(l+=N,r+=N+1;l<r;l/=2,r/=2){ if(l&1)res=mrg(res,tn[l++]); if(r&1)res=mrg(res,tn[--r]); } return res; }
#Verdict Execution timeMemoryGrader output
Fetching results...