# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1086671 |
2024-09-11T08:54:15 Z |
LeonidCuk |
Secret (JOI14_secret) |
C++17 |
|
304 ms |
8788 KB |
#include <bits/stdc++.h>
#include "secret.h"
using namespace std;
vector<int>v,dp[11];
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<12;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 |
1 |
Runtime error |
78 ms |
4692 KB |
Execution killed with signal 11 |
2 |
Runtime error |
79 ms |
4696 KB |
Execution killed with signal 11 |
3 |
Runtime error |
80 ms |
4792 KB |
Execution killed with signal 11 |
4 |
Runtime error |
300 ms |
8788 KB |
Execution killed with signal 11 |
5 |
Runtime error |
298 ms |
8784 KB |
Execution killed with signal 11 |
6 |
Runtime error |
300 ms |
8744 KB |
Execution killed with signal 11 |
7 |
Runtime error |
304 ms |
8784 KB |
Execution killed with signal 11 |
8 |
Runtime error |
302 ms |
8784 KB |
Execution killed with signal 11 |
9 |
Runtime error |
302 ms |
8788 KB |
Execution killed with signal 11 |
10 |
Runtime error |
303 ms |
8788 KB |
Execution killed with signal 11 |