oj.uz

답안 #989284

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
989284 2024-05-27T21:21:53 Z aaaaaarroz 비밀 (JOI14_secret) C++17
0 / 100
 333 ms 4688 KB 
#include <bits/stdc++.h>
using namespace std;
int Secret(int l, int r);
vector<vector<int>>dvc;
vector<int>arr;
void dc(int l, int r, int lvl){
	if(l==r){
		dvc[lvl][l]=arr[l];
	}
	int mid=(l+r)/1;
	dvc[lvl][mid]=arr[mid];
	dvc[lvl][mid+1]=arr[mid+1];
	for(int i=mid-1;i>=l;i--){
		dvc[lvl][i]=Secret(dvc[lvl][i+1],arr[i]);
	}
	for(int i=mid+2;i<=r;i++){
		dvc[lvl][i]=Secret(dvc[lvl][i-1],arr[i]);
	}
	dc(l,mid,lvl+1);
	dc(mid+1,r,lvl+1);
}
void Init(int n, int a[]){
    arr.resize(n);
    for(int i=0;i<n;i++){
        arr[i]=a[i];
	}
    dvc.resize(21,vector<int>(n));
}
int retorno(int a,int b,int l,int r, int lvl){
	int mid=(a+b)/2;
	if(a==b){
		return arr[l];
	}
	if(r<(mid+1)){
		return retorno(l,mid,l,r,lvl+1);
	}
	else if(l>mid){
		return retorno(mid+1,r,l,r,lvl+1);
	}
	return Secret(dvc[lvl][l],dvc[lvl][r]);
}
int Query(int l,int r){ 
    return retorno(0,arr.size()-1,l,r,0);
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 78 ms 2648 KB Wrong Answer: Query(222, 254) - expected : 34031541, actual : 536870912.
2 Incorrect 77 ms 2800 KB Wrong Answer: Query(60, 375) - expected : 669221184, actual : 0.
3 Incorrect 76 ms 2652 KB Wrong Answer: Query(211, 401) - expected : 674373968, actual : 536870912.
4 Incorrect 298 ms 4528 KB Wrong Answer: Query(90, 497) - expected : 397934825, actual : 536870912.
5 Incorrect 293 ms 4436 KB Wrong Answer: Query(587, 915) - expected : 752404486, actual : 536870912.
6 Incorrect 329 ms 4688 KB Wrong Answer: Query(738, 741) - expected : 983692994, actual : 536870912.
7 Incorrect 293 ms 4436 KB Wrong Answer: Query(84, 976) - expected : 742463504, actual : 0.
8 Incorrect 333 ms 4340 KB Wrong Answer: Query(58, 987) - expected : 20022464, actual : 536870912.
9 Incorrect 298 ms 4336 KB Wrong Answer: Query(33, 967) - expected : 676869696, actual : 0.
10 Incorrect 321 ms 4436 KB Wrong Answer: Query(116, 961) - expected : 68487362, actual : 0.