제출 #596576

#제출 시각아이디문제언어결과실행 시간메모리
596576DeepessonBrperm (RMI20_brperm)C++17
50 / 100
3067 ms1000 KiB
#include <bits/stdc++.h>
#define MAX 205000

void init(int n, const char s[]);
int query(int i, int k);
int inverte(int x,int k){
    int ans=0;
    for(int i=0;i!=k;++i){
        int u = (k-1)-i;
        if((1<<i)&x)ans+=1<<u;
    }
    return ans;
}
int lim;
char vals[MAX];
void init(int n, const char s[]) {
    for(int j=0;j!=n;++j){
        vals[j]=s[j];
    }
    lim = n;
}

int query(int i, int k) {
    int sz = 1<<(k);
    if(i+sz>lim)return 0;
    for(int j=0;j!=sz;++j){
        int mirror = inverte(j,k);
        if(vals[mirror+i]!=vals[j+i])return 0;
    }
    return 1;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...