oj.uz

답안 #1094741

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1094741 2024-09-30T12:30:17 Z asli_bg 비밀 (JOI14_secret) C++11
0 / 100
 321 ms 8812 KB 
#pragma GCC optimize("O3,unroll-loops")

#include <bits/stdc++.h>
using namespace std;

//#define int long long

#define fi first
#define se second
#define all(x) x.begin(),x.end()
#define pb push_back
 
#define FOR(i,a) for(int i=0;i<(a);i++)
#define FORE(i,a,b) for(int i=(a);i<(b);i++)
#define cont(x) {for(auto el:x) cout<<el<<' ';cout<<endl;}
#define contp(x) {for(auto el:x) cout<<el.fi<<'-'<<el.se<<' ';cout<<endl;}
#define sp <<" "<<
#define mid (l+r)/2
#define endl '\n'
 
#define DEBUG(X) {cout<<#X<<' '<<(X)<<endl;}
 
#define carp(x,y) ((x%MOD)*(y%MOD))%MOD
#define topla(x,y) ((x%MOD)+(y%MOD))%MOD
 
typedef vector<int> vi;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
typedef vector<pii> vii;
typedef vector<bool> vb;

const int MAXN=1e3+2;
const int MAXK=10;

#include "secret.h"

vi a;
int n;
int tut[MAXK][MAXN];
int mask[MAXN];

void dq(int l,int r,int lev){
    if(l>=r) return;
    tut[lev][mid]=a[mid];
    tut[lev][mid+1]=a[mid+1];
    for(int i=mid-1;i>=l;i--){
        tut[lev][i]=Secret(tut[lev][i+1],a[i]);
    }
    for(int i=mid+2;i<=r;i++){
        tut[lev][i]=Secret(tut[lev][i-1],a[i]);
    }

    FORE(i,mid+1,r+1) mask[i]=mask[i]^(1<<lev);

    dq(l,mid,lev+1);
    dq(mid+1,r,lev+1);
}


void Init(int N, int A[]) {
    Secret(0, 1000000000);
    n=N;
    a.pb(0);
    FOR(i,N){
        a.pb(A[i]);
    }

    dq(1,n,1);
}

int Query(int l, int r) {
    l++;r++;
    if(l==r) return a[l];
    int bits=__builtin_ctz(mask[l]^mask[r]);
    return Secret(tut[bits][l],tut[bits][r]);
    return 0;
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 85 ms 2384 KB Wrong Answer: Query(222, 254) - expected : 34031541, actual : 268854015.
2 Incorrect 78 ms 2384 KB Wrong Answer: Query(60, 375) - expected : 669221184, actual : 311474560.
3 Incorrect 83 ms 2564 KB Wrong Answer: Query(211, 401) - expected : 674373968, actual : 353554500.
4 Runtime error 304 ms 8784 KB Execution killed with signal 11
5 Runtime error 301 ms 8640 KB Execution killed with signal 11
6 Runtime error 314 ms 8768 KB Execution killed with signal 11
7 Runtime error 306 ms 8784 KB Execution killed with signal 11
8 Runtime error 311 ms 8792 KB Execution killed with signal 11
9 Runtime error 321 ms 8812 KB Execution killed with signal 11
10 Runtime error 305 ms 8628 KB Execution killed with signal 11