oj.uz

답안 #488409

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
488409 2021-11-18T19:52:42 Z AmirElarbi 비밀 (JOI14_secret) C++14
100 / 100
 448 ms 8424 KB 
#include <bits/stdc++.h>
#include "secret.h"
#define vi vector<int>
#define ve vector
#define ll long long
#define vf vector<float>
#define vll vector<pair<ll,ll>>
#define ii pair<int,int>
#define vvi vector<vi>
#define vii vector<ii>
#define gii greater<ii>
#define pb push_back
#define fi first
#define se second
#define INF 1e9
#define eps 1e-7
#define eps1 1e-25
#define optimise ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define MAX_A 1e5+5
#define V 450
using namespace std;
const int MOD = 1e9+7;
const int nax = 2005;
int n;
vi s;
int t[nax][nax];
void solve(int l, int r){
    int md = (l+r)/2;
    t[md][md] = s[md];
    t[md+1][md+1] = s[md+1];
    for (int i = md+2; i <= r; i++)
        t[md+1][i] = Secret(t[md+1][i-1],s[i]);
    for (int i = md-1; i >= l; i--)
        t[md][i] = Secret(s[i],t[md][i+1]);
    if(l < md) solve(l,md);
    if(md +1 < r) solve(md+1,r);
}
void Init(int N, int A[]){
    n = N;
    for (int i = 0; i < N; ++i)
    {
        s.pb(A[i]);
    }
    solve(0,n-1);
}
int Query(int L, int R){
    int l = 0, r = n-1;
    while(l != r){
        int md = (l+r)/2;
        if(md >= L && md < R)
                    return Secret(t[md][L], t[md+1][R]);
        else if(md == R) return t[md][L];
        else if(md < L)
            l = md+1;
        else
            r = md;
    }
    return t[l][l];
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 119 ms 4336 KB Output is correct - number of calls to Secret by Init = 3578, maximum number of calls to Secret by Query = 1
2 Correct 120 ms 4328 KB Output is correct - number of calls to Secret by Init = 3586, maximum number of calls to Secret by Query = 1
3 Correct 119 ms 4328 KB Output is correct - number of calls to Secret by Init = 3595, maximum number of calls to Secret by Query = 1
4 Correct 434 ms 8264 KB Output is correct - number of calls to Secret by Init = 7969, maximum number of calls to Secret by Query = 1
5 Correct 445 ms 8204 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
6 Correct 437 ms 8424 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
7 Correct 428 ms 8308 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
8 Correct 448 ms 8416 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
9 Correct 423 ms 8344 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
10 Correct 428 ms 8236 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1