oj.uz

답안 #415561

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
415561 2021-06-01T08:40:04 Z mbfibat 비밀 (JOI14_secret) C++17
0 / 100
 545 ms 4428 KB 
#include "secret.h"
#include <iostream>

using namespace std;

int a[1001];
int val[1001][11], mask[1001];

int comb(int x, int y) {
	return Secret(x, y);
}

void init(int l, int r, int lev) {
	if (l == r) 
		return;

	int mi = (l + r) / 2;
	val[mi][lev] = a[mi];
	for (int i = mi - 1; i >= l; i--)
		val[i][lev] = comb(a[i], val[i + 1][lev]);

	val[mi + 1][lev] = a[mi + 1];
	for (int i = mi + 2; i <= r; i++)
		val[i][lev] = comb(a[i], val[i - 1][lev]);
	for (int i = mi + 1; i <= r; i++)
		mask[i] |= (1 << lev);
	init(l, mi, lev + 1);
	init(mi + 1, r, lev + 1);
}

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

int Query(int L, int R) {
	L++, R++;
	if (L == R) return a[L];
	else {
		int lev = __builtin_ctz(mask[L] ^ mask[R]);
		return Secret(val[L][lev], val[R][lev]);
	}
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 142 ms 2380 KB Wrong Answer: Query(222, 254) - expected : 34031541, actual : 809782271.
2 Incorrect 140 ms 2452 KB Wrong Answer: Query(60, 375) - expected : 669221184, actual : 68749376.
3 Incorrect 141 ms 2476 KB Wrong Answer: Query(211, 401) - expected : 674373968, actual : 136349820.
4 Incorrect 541 ms 4296 KB Wrong Answer: Query(90, 497) - expected : 397934825, actual : 650789536.
5 Incorrect 545 ms 4428 KB Wrong Answer: Query(587, 915) - expected : 752404486, actual : 377506838.
6 Incorrect 513 ms 4292 KB Wrong Answer: Query(738, 741) - expected : 983692994, actual : 61461050.
7 Incorrect 528 ms 4332 KB Wrong Answer: Query(84, 976) - expected : 742463504, actual : 687550570.
8 Incorrect 526 ms 4320 KB Wrong Answer: Query(58, 987) - expected : 20022464, actual : 145923264.
9 Incorrect 515 ms 4336 KB Wrong Answer: Query(33, 967) - expected : 676869696, actual : 18757135.
10 Incorrect 523 ms 4312 KB Wrong Answer: Query(116, 961) - expected : 68487362, actual : 70590726.