oj.uz

답안 #751910

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
751910 2023-06-01T19:22:09 Z Markomafko972 비밀 (JOI14_secret) C++17
0 / 100
 461 ms 12228 KB 
#include <bits/stdc++.h>
#include "secret.h"
using namespace std;

int val[1005][1005];
int sus[1005][1005];

void rek(int l, int r) {
	if (l >= r) return;
	
	int mid = (l+r)/2;
	for (int i = l; i <= mid; i++) {
		for (int j = mid+1; j <= r; j++) {
			sus[i][j] = mid;
		}
	}
	
	for (int j = mid-1; j >= l; j--) {
		val[j][mid] = Secret(val[j+1][mid], val[j][j]);
	}
	for (int j = mid+2; j <= r; j++) {
		val[mid+1][j] = Secret(val[mid+1][j-1], val[j][j]);
	}
 
	rek(l, mid);
	rek(mid+1, r);
}
 
void Init(int N, int A[]) {
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < N; j++) {
			if (i == j) val[i][j] = A[i];
			else val[i][j] = -1;
		}
	}
	
	rek(0, N-1);
}
 
int Query(int L, int R) {
	if (val[L][R] != -1) return val[L][R];
	return Secret(val[L][sus[L][R]], val[sus[L][R]+1][R]);
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 118 ms 6356 KB Wrong Answer: Query(113, 206) - expected : 536899947, actual : 538256673.
2 Incorrect 116 ms 6296 KB Wrong Answer: Query(60, 375) - expected : 669221184, actual : 311474560.
3 Incorrect 118 ms 6416 KB Wrong Answer: Query(211, 401) - expected : 674373968, actual : 353554500.
4 Incorrect 432 ms 12068 KB Wrong Answer: Query(90, 497) - expected : 397934825, actual : 343081568.
5 Incorrect 444 ms 12116 KB Wrong Answer: Query(587, 915) - expected : 752404486, actual : 957013316.
6 Incorrect 437 ms 12096 KB Wrong Answer: Query(653, 654) - expected : 227441904, actual : 93182529.
7 Incorrect 461 ms 12104 KB Wrong Answer: Query(84, 976) - expected : 742463504, actual : 675449873.
8 Incorrect 443 ms 12060 KB Wrong Answer: Query(58, 987) - expected : 20022464, actual : 273091792.
9 Incorrect 453 ms 12140 KB Wrong Answer: Query(33, 967) - expected : 676869696, actual : 827853577.
10 Incorrect 431 ms 12228 KB Wrong Answer: Query(116, 961) - expected : 68487362, actual : 337854787.