oj.uz

답안 #751916

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
751916 2023-06-01T19:33:17 Z Markomafko972 비밀 (JOI14_secret) C++14
100 / 100
 487 ms 12132 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][j], val[j+1][mid]);
	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
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 141 ms 6308 KB Output is correct - number of calls to Secret by Init = 3578, maximum number of calls to Secret by Query = 1
2 Correct 127 ms 6336 KB Output is correct - number of calls to Secret by Init = 3586, maximum number of calls to Secret by Query = 1
3 Correct 127 ms 6356 KB Output is correct - number of calls to Secret by Init = 3595, maximum number of calls to Secret by Query = 1
4 Correct 467 ms 12116 KB Output is correct - number of calls to Secret by Init = 7969, maximum number of calls to Secret by Query = 1
5 Correct 448 ms 12032 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
6 Correct 459 ms 12108 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
7 Correct 487 ms 12092 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
8 Correct 436 ms 12132 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
9 Correct 444 ms 12100 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
10 Correct 458 ms 12108 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1