# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
77728 | nxteru | 비밀 (JOI14_secret) | C++14 | 638 ms | 9404 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 <iostream>
#include <vector>
#include "secret.h"
using namespace std;
int n,a[1005][1005];
void bt(int l,int r){
int m=(l+r)/2;
for(int i=m-1;i>=l;i--){
a[i][m]=Secret(a[i][i],a[i+1][m]);
}
for(int i=m+2;i<=r;i++){
a[m+1][i]=Secret(a[m+1][i-1],a[i][i]);
}
if(l+3<=m)bt(l,m);
if(m+4<=r)bt(m+1,r);
}
void Init(int N,int *A){
n=N;
for(int i=0;i<n;i++)a[i][i]=A[i];
bt(0,n-1);
}
int ans(int L,int R,int l,int r){
int m=(l+r)/2;
if(R<m)return ans(L,R,l,m);
if(m+1<L)return ans(L,R,m+1,r);
if(R==m||L==m+1)return a[L][R];
return Secret(a[L][m],a[m+1][R]);
}
int Query(int l,int r){
return ans(l,r,0,n-1);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |