oj.uz

Submission #930304

# Submission time Handle Problem Language Result Execution time Memory
930304 2024-02-19T10:27:12 Z noyancanturk Secret (JOI14_secret) C++17
0 / 100
 358 ms 4532 KB 
#include "secret.h"
#include <cassert>
const int lim=1100;

int n,*a;
int left[15][lim],right[15][lim];

void dnc(int l,int r,int dep=0){
	if(l==r){
		return;
	}
	int mid=(l+r)>>1;
	left[dep][mid]=a[mid];
	for(int i=mid-1;l<=i;i--){
		left[dep][i]=Secret(a[i],left[dep][i+1]);
	}
	right[dep][mid+1]=a[mid+1];
	for(int i=mid+2;i<=r;i++){
		right[dep][i]=Secret(right[dep][i-1],a[i]);
	}
	dnc(l,mid,dep+1),dnc(mid+1,r,dep+1);
}

void Init(int N, int A[]) {
	n=N;
	a=A;
    dnc(0,n-1);
}

int Query(int L, int R) {
	if(L==R){
		return a[L];
	}
	int l=0,r=n-1,dep=0;
	while(l<=r){
		int mid=(l+r)>>1;
		if(L==mid+1)return right[dep][mid+1];
		if(L<=mid&&mid<R){
			return Secret(left[dep][L],right[dep][R]);
		}else if(mid==R){
			return left[dep][L];
		}else if(mid<L){
			l=mid+1;
		}else{
			r=mid-1;
		}
		dep++;
	}
	return -1;
}

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 100 ms 3768 KB Wrong Answer: Query(128, 254) - expected : 576149945, actual : 773931079.
2 Incorrect 94 ms 3664 KB Wrong Answer: Query(236, 238) - expected : 173116186, actual : 102957309.
3 Incorrect 94 ms 3668 KB Wrong Answer: Query(128, 153) - expected : 959658850, actual : 0.
4 Incorrect 352 ms 4532 KB Wrong Answer: Query(172, 187) - expected : 590352579, actual : 590348483.
5 Incorrect 351 ms 4500 KB Wrong Answer: Query(584, 592) - expected : 111053842, actual : 514219292.
6 Incorrect 350 ms 4532 KB Wrong Answer: Query(738, 741) - expected : 983692994, actual : 188307410.
7 Correct 358 ms 4352 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
8 Correct 358 ms 4512 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
9 Correct 355 ms 4436 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
10 Correct 356 ms 4432 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1