oj.uz

답안 #573976

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
573976 2022-06-07T14:08:38 Z Vanilla 비밀 (JOI14_secret) C++17
0 / 100
 461 ms 12136 KB 
#include <bits/stdc++.h>
#include "secret.h"
using namespace std;
const int maxn = 1005;
long long pref [maxn][maxn];

void build (int l, int r) {
	if (l >= r) return;
	int mid = (l + r) / 2;
	for (int i = mid - 1; i >= l; i--){
		pref[i][mid] = Secret(pref[i + 1][mid], pref[i][i]);
	}
	for (int i = mid + 2; i < r; i++){
		pref[mid + 1][i] = Secret(pref[mid + 1][i-1], pref[i][i]);
	}
	build (l, mid);
	build (mid + 1, r);

}

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

int Query(int L, int R) {
	if (pref[L][R] != -1) return pref[L][R];
	for (int i = L; i < R; i++){
		if (pref[L][i] != -1 && pref[i + 1][R] != -1)
			return Secret(pref[L][i], pref[i + 1][R]);
	}
	assert(0);
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 119 ms 6336 KB Wrong Answer: Query(222, 254) - expected : 34031541, actual : 268854015.
2 Incorrect 122 ms 6300 KB Wrong Answer: Query(60, 375) - expected : 669221184, actual : 747241792.
3 Incorrect 117 ms 6320 KB Wrong Answer: Query(211, 401) - expected : 674373968, actual : 353554500.
4 Incorrect 445 ms 12104 KB Wrong Answer: Query(90, 497) - expected : 397934825, actual : 343081568.
5 Incorrect 431 ms 12128 KB Wrong Answer: Query(587, 915) - expected : 752404486, actual : 497583184.
6 Incorrect 446 ms 12124 KB Wrong Answer: Query(738, 741) - expected : 983692994, actual : 993621889.
7 Incorrect 461 ms 12088 KB Wrong Answer: Query(84, 976) - expected : 742463504, actual : 657493000.
8 Incorrect 434 ms 12136 KB Wrong Answer: Query(58, 987) - expected : 20022464, actual : 764569728.
9 Incorrect 442 ms 12124 KB Wrong Answer: Query(33, 967) - expected : 676869696, actual : 277877441.
10 Incorrect 439 ms 12104 KB Wrong Answer: Query(116, 961) - expected : 68487362, actual : 69725386.