oj.uz

답안 #935640

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
935640 2024-02-29T10:06:43 Z Baizho 비밀 (JOI14_secret) C++14
100 / 100
 410 ms 8292 KB 
#include <bits/stdc++.h>
#include <secret.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
  
#define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
 
// #pragma GCC optimize("Ofast,unroll-loops,fast-math")
// #pragma GCC target("popcnt")
 
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
 
#define sz size()
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define pb push_back
 
const int mod = ll(1e9)+7;
const ll MOD = 998244353;
const long long inf = 5e18;
const int M = 1005;

int Secret(int x, int y);

int val[M][M], n, a[M];

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

void Init(int N, int A[]) {
	n = N;
	for(int i = 0; i < N; i ++) a[i] = A[i];
	solve(0, n - 1);
}

int Query(int L, int R) {
	int l = L, r = R, tl = 0, tr = n - 1;
	if(l == r) {
		return a[l];
	}
	while(tl <= tr) {
		int mid = (tl + tr) / 2;
		if(l <= mid && mid + 1 <= r) {
			return Secret(val[mid][l], val[mid + 1][r]);
		} 
		else if(r <= mid) tr = mid;
		else tl = mid + 1; 
	}
}

Compilation message

secret.cpp: In function 'int Query(int, int)':
secret.cpp:63:1: warning: control reaches end of non-void function [-Wreturn-type]
   63 | }
      | ^

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 109 ms 6600 KB Output is correct - number of calls to Secret by Init = 3578, maximum number of calls to Secret by Query = 1
2 Correct 109 ms 6736 KB Output is correct - number of calls to Secret by Init = 3586, maximum number of calls to Secret by Query = 1
3 Correct 108 ms 6736 KB Output is correct - number of calls to Secret by Init = 3595, maximum number of calls to Secret by Query = 1
4 Correct 383 ms 8280 KB Output is correct - number of calls to Secret by Init = 7969, maximum number of calls to Secret by Query = 1
5 Correct 410 ms 8276 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
6 Correct 387 ms 8288 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
7 Correct 381 ms 8292 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
8 Correct 388 ms 8280 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
9 Correct 381 ms 8272 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
10 Correct 403 ms 8284 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1