oj.uz

답안 #751904

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
751904 2023-06-01T18:37:02 Z Markomafko972 비밀 (JOI14_secret) C++14
0 / 100
 474 ms 8328 KB 
#include "secret.h"
#include <bits/stdc++.h>
using namespace std;
 
int n;
int a[1005];
int val[1005][1005];
 
void rek(int l, int r) {
	if (l >= r) return;
	
	int mid = (l+r)/2;
	for (int j = mid-1; j >= l; j--) {
		val[j][mid] = Secret(val[j+1][mid], a[j]);
	}
	for (int j = mid+2; j <= r; j++) {
		val[mid+1][j] = Secret(val[mid+1][j-1], a[j]);
	}
 
	rek(l, mid);
	rek(mid+1, r);
}
 
void Init(int N, int A[]) {
	n = N;
	memset(val, -1, sizeof val);
	for (int i = 0; i < n; i++) {
		a[i] = A[i];
		val[i][i] = a[i];
	}
	rek(0, n-1);
}
 
int Query(int l, int r) {
	if (val[l][r] != -1) return val[l][r];
	for (int i = l; i < r; i++) {
		if (val[l][i] != -1 && val[i+1][r] != -1) return Secret(val[l][i], val[i+1][r]);
	}
	return -1;
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 121 ms 6432 KB Wrong Answer: Query(113, 206) - expected : 536899947, actual : 538256673.
2 Incorrect 122 ms 6312 KB Wrong Answer: Query(60, 375) - expected : 669221184, actual : 311474560.
3 Incorrect 120 ms 6280 KB Wrong Answer: Query(211, 401) - expected : 674373968, actual : 353554500.
4 Incorrect 443 ms 8224 KB Wrong Answer: Query(90, 497) - expected : 397934825, actual : 343081568.
5 Incorrect 474 ms 8184 KB Wrong Answer: Query(587, 915) - expected : 752404486, actual : 957013316.
6 Incorrect 462 ms 8172 KB Wrong Answer: Query(653, 654) - expected : 227441904, actual : 93182529.
7 Incorrect 453 ms 8140 KB Wrong Answer: Query(84, 976) - expected : 742463504, actual : 675449873.
8 Incorrect 426 ms 8328 KB Wrong Answer: Query(58, 987) - expected : 20022464, actual : 273091792.
9 Incorrect 461 ms 8328 KB Wrong Answer: Query(33, 967) - expected : 676869696, actual : 827853577.
10 Incorrect 437 ms 8240 KB Wrong Answer: Query(116, 961) - expected : 68487362, actual : 337854787.