oj.uz

답안 #656732

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
656732 2022-11-08T06:43:08 Z anhduc2701 비밀 (JOI14_secret) C++17
0 / 100
 20000 ms 12208 KB 
#include<bits/stdc++.h>
#include "secret.h"
using namespace std;
typedef long long ll;
const ll INF=1e18;
const int maxn=1e6+5;
const int mod=1e9+7;
const int mo=998244353;
using pi=pair<ll,ll>;
using vi=vector<ll>;
using pii=pair<pair<ll,ll>,ll>;
#define all(x) x.begin(), x.end()
#define len(x) ll(x.size())
#define eb emplace_back
#define PI 3.14159265359
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int pre[1005][1005];
int suf[1005][1005];
int n;
int a[1005];
void bu1(int l,int r){
	if(r-l+1>=2){
		int mid=(l+r)/2;
		pre[mid+1][mid+1]=a[mid+1];
		for(int i=mid+2;i<=r;i++){
			pre[mid+1][i]=Secret(pre[mid+1][i-1],a[i]);
		}
		suf[mid][mid]=a[mid];
		for(int i=mid-1;i>=l;i--){
			suf[mid][i]=Secret(suf[mid][i+1],a[i]);
		}
	}
}
void build(int id,int l,int r){
	if(l==r){
		pre[l][l]=a[l];
		suf[l][l]=a[r];
		return;
	}
	int mid=(l+r)/2;
	bu1(l,r);
	build(id*2,l,mid);
	build(id*2+1,mid+1,r);
}
int que(int id,int l,int r,int u,int v){
	int mid=(l+r)/2;
	if(u<=mid && v>mid){
		return Secret(suf[mid][u],pre[mid+1][v]);
	}
	else if( v<=mid){
		return que(id*2,l,mid,u,v);
	}
	else{
		return que(id*2+1,mid+1,r,u,v);
	}
}
int Query(int l,int r){
    l++;
    r++;
    if(l==r)return a[l];
    else if(l==r-1)return Secret(a[l],a[r]);
    else return que(1,1,n,l,r);
}
void Init(int n,int A[]){
    for(int i=1;i<=n;i++){
        a[i]=A[i-1];
    }
	build(1,1,n);
}
//main(){}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 20092 ms 6348 KB Time limit exceeded
2 Execution timed out 20060 ms 6432 KB Time limit exceeded
3 Execution timed out 20009 ms 6360 KB Time limit exceeded
4 Execution timed out 20097 ms 12028 KB Time limit exceeded
5 Execution timed out 20086 ms 12208 KB Time limit exceeded
6 Execution timed out 20095 ms 12072 KB Time limit exceeded
7 Execution timed out 20065 ms 12108 KB Time limit exceeded
8 Execution timed out 20043 ms 12108 KB Time limit exceeded
9 Execution timed out 20090 ms 12060 KB Time limit exceeded
10 Execution timed out 20093 ms 12092 KB Time limit exceeded