oj.uz

답안 #48655

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
48655 2018-05-17T17:06:02 Z Pajaraja 비밀 (JOI14_secret) C++17
0 / 100
 3934 ms 524288 KB 
#include "secret.h"
#include <bits/stdc++.h>
#define MAXN 1007
using namespace std;
int val[MAXN][MAXN],a[MAXN],n;
void rek(int l,int r)
{
	int s=(l+r)/2;
	val[s][s]=a[s];
	for(int i=s-1;i>=l;i--) val[i][s]=Secret(a[i],val[i+1][s]);
	val[s+1][s+1]=a[s+1];
	for(int i=s+2;i<=r;i++) val[s+1][i]=Secret(val[s+1][i-1],a[i]);
	if(l+1==r) return;
	rek(l,s);
	rek(s+1,r);
}
void Init(int N, int A[]) 
{
	n=N;
	for(int i=0;i<n;i++) a[i]=A[i];
	rek(0,n-1);
}

int ans(int l,int r,int lt,int rt)
{
	if(l==r) return a[l];
	int s=(l+r)/2;
	if(lt<=s && rt>s) return Secret(val[lt][s],val[s+1][rt]);
	if(rt<=s) return ans(l,s,lt,rt);
	return ans(s+1,r,lt,rt);
}
int Query(int L, int R)  {return ans(0,n-1,L,R);}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 3200 ms 524288 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Correct 181 ms 524288 KB Output is correct - number of calls to Secret by Init = 3586, maximum number of calls to Secret by Query = 1
3 Runtime error 3060 ms 524288 KB Execution killed with signal 11 (could be triggered by violating memory limits)
4 Runtime error 3765 ms 524288 KB Execution killed with signal 11 (could be triggered by violating memory limits)
5 Runtime error 3071 ms 524288 KB Execution killed with signal 11 (could be triggered by violating memory limits)
6 Runtime error 3316 ms 524288 KB Execution killed with signal 11 (could be triggered by violating memory limits)
7 Runtime error 3724 ms 524288 KB Execution killed with signal 11 (could be triggered by violating memory limits)
8 Runtime error 3934 ms 524288 KB Execution killed with signal 11 (could be triggered by violating memory limits)
9 Runtime error 3623 ms 524288 KB Execution killed with signal 11 (could be triggered by violating memory limits)
10 Runtime error 3061 ms 524288 KB Execution killed with signal 11 (could be triggered by violating memory limits)