답안 #48656

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
48656 2018-05-17T17:11:05 Z Pajaraja 비밀 (JOI14_secret) C++17
0 / 100
3632 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;
	for(int i=s-1;i>=l;i--) val[i][s]=Secret(a[i],val[i+1][s]);
	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++) val[i][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);}
# 결과 실행 시간 메모리 Grader output
1 Runtime error 3632 ms 524288 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Correct 184 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 2823 ms 524288 KB Execution killed with signal 11 (could be triggered by violating memory limits)
4 Runtime error 2894 ms 524288 KB Execution killed with signal 11 (could be triggered by violating memory limits)
5 Runtime error 3090 ms 524288 KB Execution killed with signal 11 (could be triggered by violating memory limits)
6 Runtime error 3109 ms 524288 KB Execution killed with signal 11 (could be triggered by violating memory limits)
7 Runtime error 3136 ms 524288 KB Execution killed with signal 11 (could be triggered by violating memory limits)
8 Runtime error 3167 ms 524288 KB Execution killed with signal 11 (could be triggered by violating memory limits)
9 Runtime error 3013 ms 524288 KB Execution killed with signal 11 (could be triggered by violating memory limits)
10 Runtime error 3125 ms 524288 KB Execution killed with signal 11 (could be triggered by violating memory limits)