# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1015728 |
2024-07-06T17:07:34 Z |
mnbvcxz123 |
Secret (JOI14_secret) |
C++17 |
|
14289 ms |
8784 KB |
#include<bits/stdc++.h>
#include"secret.h"
using namespace std;
using ll=long long;
using pi=pair<int,int>;
#define pb push_back
#define fi first
#define se second
constexpr int N=1e3+5;
constexpr int lg=11;
int res[lg][N];
int mask[N];
int a[N];
void build(int l, int r, int pw){
if(l==r)return;
int m=(l+r)>>1;
res[pw][m]=a[m];
for(int i=m-1;i>=l;--i)
res[pw][i]=Secret(a[i],res[pw][i+1]);
res[pw][m+1]=a[m+1];
for(int i=m+2;i<=r;++i)
res[pw][i]=Secret(res[pw][i-1],a[i]);
for(int i=m+1;i<=r;++r)
mask[i]^=1<<pw;
build(l,m,pw+1);
build(m+1,r,pw+1);
}
void Init(int n, int t[]){
for(int i=0;i<n;++i)
a[i]=t[i];
build(0,n-1,0);
}
int Query(int l, int r){
if(l==r)return a[l];
int x=__builtin_ctz(mask[l]^mask[r]);
return Secret(res[x][l],res[x][r]);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
11510 ms |
4692 KB |
Execution killed with signal 11 |
2 |
Runtime error |
11374 ms |
4880 KB |
Execution killed with signal 11 |
3 |
Runtime error |
12678 ms |
4924 KB |
Execution killed with signal 11 |
4 |
Runtime error |
13349 ms |
8716 KB |
Execution killed with signal 11 |
5 |
Runtime error |
14289 ms |
8632 KB |
Execution killed with signal 11 |
6 |
Runtime error |
13517 ms |
8600 KB |
Execution killed with signal 11 |
7 |
Runtime error |
13456 ms |
8644 KB |
Execution killed with signal 11 |
8 |
Runtime error |
13078 ms |
8784 KB |
Execution killed with signal 11 |
9 |
Runtime error |
13186 ms |
8628 KB |
Execution killed with signal 11 |
10 |
Runtime error |
12542 ms |
8600 KB |
Execution killed with signal 11 |