제출 #165321

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
165321		jovan_b	비밀 (JOI14_secret)	C++17	0 / 100	616 ms	9776 KiB

secret

#include <bits/stdc++.h>
using namespace std;
#include "secret.h"
typedef long double ld;
typedef long long ll;

ll niz[1005];
ll res[1005][1005];
int n;

pair <int, int> fajnd(int l, int r, int tl, int tr){
    if(r-l <= 1) return {l, r-l+1};
    int mid = (l+r)/2;
    if(l <= tl && tr <= r && tl <= mid && r >= mid+1) return {mid, r-l+1};
    pair <int, int> x = fajnd(l, mid, tl, tr);
    pair <int, int> y = fajnd(mid+1, r, tl, tr);
    if(x.second > y.second) return x;
    return y;
}

void process(int l, int r){
    int mid = (l+r)/2;
  	if(l == r) return;
    res[mid][mid] = niz[mid];
    res[mid+1][mid+1] = niz[mid+1];
    for(ll j=mid-1; j>=l; j--){
        res[j][mid] = Secret(niz[j], res[j+1][mid]);
    }
    for(ll j=mid+2; j<=r; j++){
        res[mid+1][j] = Secret(res[mid+1][j-1], niz[j]);
    }
    process(l, mid);
    process(mid+1, r);
}

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

int Query(int L, int R){
    if(L == R) return niz[L];
    if(R == L+1) return Secret(niz[L], niz[R]);
    pair <int, int> g = fajnd(0, n-1, L, R);
    int i = g.first;
    return Secret(res[L][i], res[i+1][R]);
}

• Subtask 1: 0 / 100