oj.uz

답안 #487192

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
487192 2021-11-14T19:09:23 Z Victor 비밀 (JOI14_secret) C++17
0 / 100
 469 ms 8264 KB 
#include "secret.h"

#include <bits/stdc++.h>

using namespace std;

#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define per(i, a, b) for (int i = (b - 1); i >= (a); --i)
#define trav(a, x) for (auto &a : x)

#define all(x) x.begin(), x.end()
#define sz(x) x.size()
#define pb push_back
#define debug(x) cout << #x << " = " << x << endl

#define umap unordered_map
#define uset unordered_set

typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;

typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<pll> vpll;

const int INF = 1'000'000'007;

int prefix[1001][1001], nums[1001];
int n;

void populate(int L, int R) {
    int mid = (L + R) / 2;
    prefix[mid][mid]=nums[mid];
    prefix[mid+1][mid+1]=nums[mid+1];

    per(i,mid,L)prefix[mid][i]=Secret(nums[i],prefix[mid][i+1]);
    rep(i,mid+2,R+1)prefix[mid][i]=Secret(nums[i],prefix[mid][i-1]);

	if (L < mid) populate(L, mid);

	if (mid + 1 < R) populate(mid + 1, R);

}

void Init(int N, int A[]) {
    memset(prefix, -1, sizeof(prefix));
    rep(i, 0, N) nums[i] = A[i];
    populate(0, N - 1);
    n = N;
}

int Query(int L, int R) {
    if (L == R) return nums[L];

    int lo = 0, hi = n - 1;
    while (1) {
        int mid = (lo + hi) / 2;
        if (L <= mid && mid < R) return Secret(prefix[mid][L], prefix[mid + 1][R]);
        if (R == mid) return prefix[mid][L];

        if (mid < L)
            lo = mid + 1;
        else
            hi = mid;
    }
    return 0;
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 113 ms 6212 KB Wrong Answer [1]
2 Incorrect 111 ms 6284 KB Wrong Answer [1]
3 Incorrect 115 ms 6236 KB Wrong Answer [1]
4 Incorrect 415 ms 8120 KB Wrong Answer [1]
5 Incorrect 469 ms 8116 KB Wrong Answer [1]
6 Incorrect 432 ms 8112 KB Wrong Answer [1]
7 Incorrect 450 ms 8132 KB Wrong Answer [1]
8 Incorrect 461 ms 8144 KB Wrong Answer [1]
9 Incorrect 422 ms 8264 KB Wrong Answer [1]
10 Incorrect 417 ms 8076 KB Wrong Answer [1]