oj.uz

답안 #403270

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
403270 2021-05-13T01:03:10 Z thomas_li 비밀 (JOI14_secret) C++17
0 / 100
 518 ms 4376 KB 
#include <bits/stdc++.h>
#include "secret.h"
using namespace std;
typedef long long ll;
typedef pair<int,int> pi;
const int MM = 1e3+5;
int n,a[MM],pre[11][MM],mask[MM];

void rec(int l, int r, int d){
	if(l == r) return;
	int mid = (l+r)/2;
	pre[d][mid] = a[mid];
	for(int i = mid-1; i >= l; i--) pre[d][i] = Secret(pre[d][i+1],a[i]);
	pre[d][mid+1] = a[mid+1];
	for(int i = mid+2; i <= r; i++) pre[d][i] = Secret(pre[d][i-1],a[i]);
	for(int i = mid+1; i <= r; i++) mask[i] ^= (1<<d);
	rec(l,mid,d+1); rec(mid+1,r,d+1);
}

void Init(int N, int A[]){
	n = N;
	for(int i = 0; i < n; i++) a[i] = A[i];
	rec(0,n-1,0);
}

int Query(int L, int R){
	if(L == R) return a[L];
	int d = __builtin_ctz(mask[L]^mask[R]);
	return Secret(pre[d][L],pre[d][R]);
}

/*
int main(){
	cin.tie(0)->sync_with_stdio(0);
	
}*/

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 137 ms 2372 KB Wrong Answer: Query(222, 254) - expected : 34031541, actual : 268854015.
2 Incorrect 138 ms 2384 KB Wrong Answer: Query(60, 375) - expected : 669221184, actual : 311474560.
3 Incorrect 140 ms 2416 KB Wrong Answer: Query(211, 401) - expected : 674373968, actual : 353554500.
4 Incorrect 518 ms 4292 KB Wrong Answer: Query(90, 497) - expected : 397934825, actual : 343081568.
5 Incorrect 508 ms 4264 KB Wrong Answer: Query(587, 915) - expected : 752404486, actual : 957013316.
6 Incorrect 517 ms 4232 KB Wrong Answer: Query(200, 208) - expected : 277813445, actual : 154975445.
7 Incorrect 514 ms 4376 KB Wrong Answer: Query(84, 976) - expected : 742463504, actual : 675449873.
8 Incorrect 512 ms 4272 KB Wrong Answer: Query(58, 987) - expected : 20022464, actual : 273091792.
9 Incorrect 514 ms 4300 KB Wrong Answer: Query(33, 967) - expected : 676869696, actual : 827853577.
10 Incorrect 516 ms 4288 KB Wrong Answer: Query(116, 961) - expected : 68487362, actual : 337854787.