답안 #111485

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
111485	2019-05-15T13:01:40 Z	vex	비밀 (JOI14_secret)	C++14	0 / 100	580 ms	8716 KB

secret

#include<bits/stdc++.h>
#include<secret.h>
#define maxn 1005
using namespace std;
 
int rez[12][maxn];
int to[maxn];
int tpp[maxn];
int nn;
 
void Init(int n,int a[])
{
  	nn=n;
	for(int i=1;i<=n;i*=2)
	{
		int pos=n-i;
		rez[i][0]=a[i];
		for(int j=1;pos+j<n;j++)
		{
			rez[i][j]=Secret(rez[i][j-1],a[pos+j]);
		}
		
		to[pos-1]=a[pos-1];
		tpp[pos-1]=i;
		for(int j=pos-2;j>max(pos-(1<<i),-1);j--)
		{
			to[j]=Secret(a[j],to[j+1]);
			tpp[j]=i;
		}
	}
}
 
int Query(int l,int r)
{
	if(__builtin_popcount(nn-l)==1)
	{
		int x=log2(r-l+1);
		if((1<<x)!=r-l+1)x++;
		
		return rez[x][r-x];
	}
	else
	{
		return Secret(to[l],rez[tpp[l]][r-(nn-(1<<tpp[l]))]);
	}
}

Subtask #1

0.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	133 ms	4700 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
2	Runtime error	133 ms	4640 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
3	Runtime error	148 ms	4764 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
4	Runtime error	502 ms	8716 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
5	Runtime error	507 ms	8544 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
6	Runtime error	540 ms	8580 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
7	Runtime error	494 ms	8540 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
8	Runtime error	528 ms	8668 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
9	Runtime error	580 ms	8608 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
10	Runtime error	527 ms	8540 KB	Execution killed with signal 11 (could be triggered by violating memory limits)