# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1086677 | LeonidCuk | Secret (JOI14_secret) | C++17 | 340 ms | 8984 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>
#include "secret.h"
using namespace std;
vector<int>v,dp[20];
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(dp[i][j+1],v[j]);
}
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)
{
if(l==r)
{
return v[l];
}
int m=(l+r)/2;
if(l<=m&&m<r)
{
return Secret(dp[i][l],dp[i][r]);
}
else if(r<=m)
{
return najdi(i+1,l,m);
}
else
{
return najdi(i+1,m+1,r);
}
}
void Init(int N,int A[])
{
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);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |