oj.uz

답안 #494506

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
494506 2021-12-15T16:24:24 Z leaked Brperm (RMI20_brperm) C++14
0 / 100
 867 ms 140220 KB 
#include <bits/stdc++.h>

#define f first
#define s second
#define m_p make_pair
#define vec vector
#define sz(x) (int)(x).size()
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define fast_rmi ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);

using namespace std;
const int N=(1<<19);
int pref[N][26];
int work[N][20];

int answ[N][20];
string s;
void init(int n,const char t[]){
    for(int i=0;i<n;i++){
        s+=t[i];
        for(int j=0;j<26;j++){
            pref[i][j]=(i?pref[i-1][j]:0);
        }
        pref[i][s[i]-'a']++;
    }
    for(int j=1;j<20;j++){
        for(int i=0;i<(1<<j);i++){
            ///TODO
            for(int k=0;k<j;k++){
                if((1<<k)&i)
                    work[i][j]+=(1<<(j-k-1));
            }
            answ[i][j]=-1;
        }
    }
}
int query(int i,int k){
    if(k>20 || i+(1<<(k-1))-1>=sz(s))
        return 0;
    if(answ[i][k]!=-1)
        return answ[i][k];
    int l=i,r=i+(1<<(k-1))-1;
    for(int j=0;j<26;j++){
        if((pref[r][j]-(l?pref[l-1][j]:0))==(r-l+1))
            return 1;
    }
    int ok=1;
    for(int i=l;i<=r;i++){
        int id=l+work[(i-l)][k];
        if(s[i]!=s[id]){
            ok=0;
            break;
        }
    }
    answ[i][k]=ok;
    return ok;
}

Subtask #1
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 96 ms 82384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 96 ms 82384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 867 ms 140220 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 96 ms 82384 KB Output isn't correct
2 Halted 0 ms 0 KB -