oj.uz

답안 #1032000

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1032000 2024-07-23T09:40:07 Z juicy 비밀 (JOI14_secret) C++17
0 / 100
 303 ms 8312 KB 
#include <bits/stdc++.h>

#include "secret.h"

using namespace std;

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif

int n;
int a[1000], F[1000][1000];

void dc(int l = 0, int r = n - 1) {
	if (l == r) {
		return;
	}
	int md = (l + r) / 2;
	F[md][md] = a[md];
	F[md + 1][md] = a[md + 1]; 
	for (int i = md - 1; i >= l; --i) {
		F[i][md] = Secret(a[i], F[i + 1][md]);
	}
	for (int i = md + 2; i <= r; ++i) {
		F[i][md] = Secret(a[i], F[i - 1][md]);
	}
	dc(l, md);
	dc(md + 1, r);
}

int Query(int L, int R) {
	for (int K = L; K < R; ++K) {
		if (F[L][K] != -1 && F[R][K] != -1) {
			return Secret(F[L][K], F[R][K]);
		}
	} 
	return a[L];
}

void Init(int _n, int *A) {
	n = _n;
	for (int i = 0; i < n; ++i) {
		a[i] = A[i];
	}
	memset(F, -1, sizeof(F));
	dc();
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 80 ms 8016 KB Wrong Answer: Query(222, 254) - expected : 34031541, actual : 809782271.
2 Incorrect 81 ms 8064 KB Wrong Answer: Query(60, 375) - expected : 669221184, actual : 68749376.
3 Incorrect 81 ms 8020 KB Wrong Answer: Query(211, 401) - expected : 674373968, actual : 136349820.
4 Incorrect 303 ms 8276 KB Wrong Answer: Query(90, 497) - expected : 397934825, actual : 650789536.
5 Incorrect 284 ms 8276 KB Wrong Answer: Query(587, 915) - expected : 752404486, actual : 377506838.
6 Incorrect 263 ms 8236 KB Wrong Answer: Query(738, 741) - expected : 983692994, actual : 61461050.
7 Incorrect 272 ms 8248 KB Wrong Answer: Query(84, 976) - expected : 742463504, actual : 687550570.
8 Incorrect 267 ms 8252 KB Wrong Answer: Query(58, 987) - expected : 20022464, actual : 145923264.
9 Incorrect 277 ms 8272 KB Wrong Answer: Query(33, 967) - expected : 676869696, actual : 18757135.
10 Incorrect 277 ms 8312 KB Wrong Answer: Query(116, 961) - expected : 68487362, actual : 70590726.