oj.uz

답안 #302071

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
302071 2020-09-18T12:16:56 Z aloo123 비밀 (JOI14_secret) C++14
100 / 100
 524 ms 4472 KB 
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <ratio>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#include <climits>
#include "secret.h"
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define in insert
#define vll vector<ll>
#define endl "\n"
#define pll pair<ll,ll>
#define f first
#define s second
#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++)
// #define int ll
#define sz(x) (ll)x.size()
#define all(x) (x.begin(),x.end())
using namespace std;
 
 
const ll INF = 1e9;
const int M =(1e3+5); // TODO : change value as per problem
const ll MOD = 1e9+7;
int a[M];
int n;
int dat[18][M], mask[M]; // 18 = ceil(log2(n))
// int pref[M][M];
// int Secret(int x,int y){
//     // return min(x,y);
//     return min(x+2*(y/2),1000000000);
// }
void divi(int l, int r, int lev) { // generate dat and mask
    if (l == r) return;
    int m = (l+r)/2; 
    dat[lev][m] = a[m]; 
    for(int i = m-1;i>=l;i--) dat[lev][i] = Secret(a[i],dat[lev][i+1]);
    dat[lev][m+1] = a[m+1]; 
    for(int i =m+2;i<=r;i++) dat[lev][i] = Secret(dat[lev][i-1],a[i]);
    for(int i = m+1;i<=r;i++) mask[i] ^= 1<<lev;
    divi(l,m,lev+1); divi(m+1,r,lev+1);
}
 
 
void Init(int N,int A[]){
    n = N;
    for(int i = 0;i<n;i++){
        a[i+1] = A[i];
    }
    divi(1,n,0);
 
}
int Query(int L, int R){
    if(L == R){
        return a[L+1];
    }
        L++,R++;
    int b = __builtin_ctz(mask[L]^mask[R]);
    return Secret(dat[b][L],dat[b][R]);
    
 }

 
 
// void solve(){
    
// // }
// signed main(){
 
//     ios_base::sync_with_stdio(0);
//     // cin.tie(NULL);
//      // freopen(".in","r",stdin);freopen(".out","w",stdout);
//     int x;
//     cin >> x;
//     int v[x];
//     for(int i =0;i<x;i++){
//         cin >> v[i];
//     }
//     Init(x,v);
//     int q;
//     cin >> q;
//     while(q--){
//         int l,r;
//         cin>>l>>r;
//         cout<<Query(l,r)<<endl;
//     }
         
// }

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 152 ms 2472 KB Output is correct - number of calls to Secret by Init = 3578, maximum number of calls to Secret by Query = 1
2 Correct 143 ms 2424 KB Output is correct - number of calls to Secret by Init = 3586, maximum number of calls to Secret by Query = 1
3 Correct 145 ms 2424 KB Output is correct - number of calls to Secret by Init = 3595, maximum number of calls to Secret by Query = 1
4 Correct 507 ms 4344 KB Output is correct - number of calls to Secret by Init = 7969, maximum number of calls to Secret by Query = 1
5 Correct 511 ms 4388 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
6 Correct 508 ms 4472 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
7 Correct 507 ms 4408 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
8 Correct 521 ms 4376 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
9 Correct 503 ms 4344 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1
10 Correct 524 ms 4356 KB Output is correct - number of calls to Secret by Init = 7978, maximum number of calls to Secret by Query = 1