oj.uz

답안 #755239

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
755239 2023-06-09T16:04:38 Z penguin133 비밀 (JOI14_secret) C++17
0 / 100
 488 ms 4508 KB 
#include <bits/stdc++.h>
using namespace std;

#include "secret.h"
//#define int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

int a[1005], n, sp[12][1005], cnt;
void Init(int N, int A[]) {
	n = N;
  for(int i=0;i<n;i++)a[i] = A[i];
  while((1 << cnt) < n)cnt++;
  for(int i = 0; i < cnt; i++){
	  int blk = (1 << i);
	  int sz = (n + blk - 1) / blk;
	  for(int j = 1; j <= blk; j++){
		  int lb = (j - 1) * sz, ub = min(n - 1, j * sz - 1);
		  if(lb >= n)break;
		  int mid = (lb + ub) >> 1;
		  for(int k = mid; k >= lb; k--){
			  if(k == mid)sp[i][mid] = a[mid];
			  else sp[i][k] = Secret(a[k], sp[i][k + 1]);
		  }
		  for(int k = mid + 1; k <= ub; k++){
			  if(k == mid + 1)sp[i][k] = a[k];
			  else sp[i][k] = Secret(sp[i][k-1], a[k]);
		  }
	  }
  }
}

int Query(int L, int R) {
  if(L == R)return a[L];
  int brr = L ^ R;
  brr = cnt - (31 - __builtin_clz(brr)) - 1;
  cout << L << ' ' << R << ' ' << brr << '\n';
  return Secret(sp[brr][L], sp[brr][R]);
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 124 ms 2516 KB Do not print anything to standard output
2 Incorrect 152 ms 2528 KB Do not print anything to standard output
3 Incorrect 123 ms 2424 KB Do not print anything to standard output
4 Incorrect 422 ms 4392 KB Do not print anything to standard output
5 Incorrect 446 ms 4392 KB Do not print anything to standard output
6 Incorrect 437 ms 4396 KB Do not print anything to standard output
7 Incorrect 488 ms 4424 KB Do not print anything to standard output
8 Incorrect 437 ms 4452 KB Do not print anything to standard output
9 Incorrect 450 ms 4456 KB Do not print anything to standard output
10 Incorrect 458 ms 4508 KB Do not print anything to standard output