oj.uz

답안 #543175

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
543175 2022-03-29T16:04:15 Z _karan_gandhi 비밀 (JOI14_secret) C++17
0 / 100
 459 ms 5444 KB 
#include "secret.h"
#include <bits/stdc++.h>

using namespace std;

int MX_lv = 20;
int n;
vector<int> arr;
vector<vector<vector<int>>> dat;
int inf = 1e9 + 11;

void divi(int l, int r, int level) {
	if (l == r) return;
	assert(level < MX_lv);

	int mid = (l + r) / 2;
	dat[mid][level][0] = arr[mid];
	dat[mid + 1][level][1] = arr[mid + 1];

	for (int i = mid - 1; i >= l; i--) {
		dat[i][level][0] = Secret(arr[i], dat[i + 1][level][0]);
	}

	for (int i = mid + 2; i <= r; i++) {
		dat[i][level][1] = Secret(arr[i], dat[i - 1][level][1]);
	}

	divi(l, mid, level + 1);
	divi(mid + 1, r, level + 1);
}

void Init(int N, int A[]) {
	n = N;
	arr.resize(n);
	dat = vector<vector<vector<int>>>(N, vector<vector<int>>(MX_lv, vector<int>(2)));

	for (int i = 0; i < n; i++) {
		arr[i] = A[i];
	}

	divi(0, n - 1, 0);

	// for (int k = 0; k < 2; k++) {
	// 	for (int i = 0; i < MX_lv; i++) {
	// 		for (int j = 0; j < n; j++) {
	// 			cout << dat[j][i][k] << ' ';
	// 		}
	// 		cout << endl;
	// 	}
	// 	cout << endl;
	// }
}

int Query(int L, int R) { // do something
	if (L == R) return arr[L];
	// now somehow figure out the level -> binary search

	int hi = n - 1, lo = 0;
	int lv = 0;

	while (hi >= lo) {
		int mid = (hi + lo) / 2;

		if (L <= mid && mid < R) {
			return Secret(dat[L][lv][0], dat[R][lv][1]);
		} else if (R == mid) {
			return dat[L][lv][0];
		} else if (R <= mid) {
			hi = mid;
		} else {
			lo = mid + 1;
		}
		lv++;
	}
	assert(0);

	return 0;
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 113 ms 2908 KB Wrong Answer: Query(222, 254) - expected : 34031541, actual : 809782271.
2 Incorrect 116 ms 2840 KB Wrong Answer: Query(60, 375) - expected : 669221184, actual : 68749376.
3 Incorrect 117 ms 2916 KB Wrong Answer: Query(211, 401) - expected : 674373968, actual : 136349820.
4 Incorrect 445 ms 5388 KB Wrong Answer: Query(90, 497) - expected : 397934825, actual : 650789536.
5 Incorrect 445 ms 5348 KB Wrong Answer: Query(587, 915) - expected : 752404486, actual : 377506838.
6 Incorrect 432 ms 5364 KB Wrong Answer: Query(738, 741) - expected : 983692994, actual : 61461050.
7 Incorrect 459 ms 5444 KB Wrong Answer: Query(84, 976) - expected : 742463504, actual : 687550570.
8 Incorrect 435 ms 5408 KB Wrong Answer: Query(58, 987) - expected : 20022464, actual : 145923264.
9 Incorrect 445 ms 5412 KB Wrong Answer: Query(33, 967) - expected : 676869696, actual : 18757135.
10 Incorrect 430 ms 5324 KB Wrong Answer: Query(116, 961) - expected : 68487362, actual : 70590726.