Submission #1086705

#TimeUsernameProblemLanguageResultExecution timeMemory
1086705LeonidCukSecret (JOI14_secret)C++17
0 / 100
309 ms4488 KiB
#include <bits/stdc++.h> #include "secret.h" using namespace std; vector<int>v,dp[20]; int n; void daq(int i,int l,int r) { if(l==r) { dp[i][l]=v[l]; return; } int m=(l+r)/2; dp[i][m]=v[m]; for(int j=m-1;j>=l;j--) { dp[i][j]=Secret(v[j],dp[i][j+1]); } dp[i][m+1]=v[m+1]; for(int j=m+2;j<=r;j++) { dp[i][j]=Secret(dp[i][j-1],v[j]); } daq(i+1,l,m); daq(i+1,m+1,r); } int najdi(int i,int l,int r,int tl,int tr) { if(tl==tr) { return v[l]; } int m=(tl+tr)/2; if(l<=m&&m<r) { return Secret(dp[i][l],dp[i][r]); } else if(r<m) { return najdi(i+1,l,r,tl,m); } else { return najdi(i+1,l,r,m+1,tr); } } void Init(int N,int A[]) { n=N; for(int i=0;i<N;i++) { v.push_back(A[i]); } for(int i=0;i<20;i++) { dp[i].resize(N); } daq(0,0,N-1); } int Query(int l,int r) { return najdi(0,l,r,0,n-1); }
#Verdict Execution timeMemoryGrader output
Fetching results...