oj.uz

답안 #728930

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
728930 2023-04-23T09:41:31 Z Cookie 비밀 (JOI14_secret) C++14
100 / 100
 461 ms 4448 KB 
#include "secret.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define forr(i, a, b) for(int i = a; i < b; i++)
#define dorr(i, a, b) for(int i = a; i >= b; i--)
#define ld long double
#define vt vector
#include<fstream>
#define fi first
#define se second
#define pll pair<ll, ll>
#define pii pair<int, int>
#include <stdio.h>
#include <stdlib.h>
const int mxn = 1000;
ll tab[11][mxn + 1], mask[mxn + 1];
vt<ll>v;
void build(int l, int r, int lev){
    if(l == r)return;
    int mid = (l + r) >> 1;
    tab[lev][mid] = v[mid];
    for(int i = mid - 1; i >= l; i--){
        tab[lev][i] = Secret(v[i], tab[lev][i + 1]);
    }
    tab[lev][mid + 1] = v[mid + 1];
    for(int i = mid + 2; i <= r; i++){
        tab[lev][i] = Secret(tab[lev][i - 1], v[i]);
    }
    for(int i = mid + 1; i <= r; i++)mask[i] ^= (1 << lev);
    build(l, mid, lev + 1); build(mid + 1, r, lev + 1);
    
}
void Init(int n, int a[]){
    for(int i = 0; i < n; i++)v.pb(a[i]);
    
    build(0, n - 1, 0);
}
ll get(int le, int ri, int lvl, int l, int r){
    
    if(le == ri)return(v[le]);
    int mid = (le + ri) >> 1;
    if(r <= mid){
        return(get(le, mid, lvl + 1, l, r));
    }else if(l > mid){
        return(get(mid + 1, ri, lvl + 1, l, r));
    }else{
        return(Secret(tab[lvl][l], tab[lvl][r]));
    }
}
int Query(int l, int r){
    if(l == r)return(v[l]);
    return(get(0, v.size() - 1, 0, l, r));
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 126 ms 2340 KB Output is correct - number of calls to Secret by Init = 3578, maximum number of calls to Secret by Query = 1
2 Correct 152 ms 2428 KB Output is correct - number of calls to Secret by Init = 3586, maximum number of calls to Secret by Query = 1
3 Correct 128 ms 2440 KB Output is correct - number of calls to Secret by Init = 3595, maximum number of calls to Secret by Query = 1
4 Correct 448 ms 4336 KB Output is correct - number of calls to Secret by Init = 7969, maximum number of calls to Secret by Query = 1
5 Correct 449 ms 4340 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
6 Correct 461 ms 4412 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
7 Correct 448 ms 4448 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
8 Correct 434 ms 4288 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
9 Correct 441 ms 4300 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
10 Correct 435 ms 4312 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1