oj.uz

답안 #53910

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
53910 2018-07-01T17:42:05 Z jovan_b 비밀 (JOI14_secret) C++17
0 / 100
 665 ms 9836 KB 
#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];
ll n;

ll fajnd(ll l, ll r, ll trl, ll trr){
    if(r-l <= 1) return -1;
    ll mid = (l+r)/2;
    if(l <= trl && trr <= r && trl <= mid && r >= mid+1) return mid;
    ll x = fajnd(l, mid, trl, trr);
    if(x != -1) return x;
    return fajnd(mid+1, r, trl, trr);
}

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

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

int Query(int L, int R){
    L++;
    R++;
    if(L == R) return niz[L];
    if(R == L+1) return Secret(niz[L], niz[R]);
    ll i = fajnd(1, n, L, R);
    return Secret(res[L][i], res[i+1][R]);
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 160 ms 4856 KB Wrong Answer: Query(222, 254) - expected : 34031541, actual : 587620235.
2 Incorrect 172 ms 4968 KB Wrong Answer: Query(102, 157) - expected : 32612619, actual : 962726377.
3 Incorrect 165 ms 4968 KB Wrong Answer: Query(334, 369) - expected : 363022362, actual : 16889894.
4 Incorrect 595 ms 9692 KB Wrong Answer: Query(90, 497) - expected : 397934825, actual : 846921768.
5 Incorrect 649 ms 9804 KB Wrong Answer: Query(263, 292) - expected : 653448456, actual : 710055954.
6 Incorrect 598 ms 9804 KB Wrong Answer: Query(738, 741) - expected : 983692994, actual : 949167361.
7 Correct 612 ms 9804 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
8 Correct 639 ms 9836 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
9 Correct 665 ms 9836 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
10 Correct 612 ms 9836 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1