oj.uz

답안 #596597

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
596597 2022-07-14T21:22:27 Z Deepesson Brperm (RMI20_brperm) C++17
50 / 100
 3000 ms 22708 KB 
#include <bits/stdc++.h>
#define MAX 505000

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 pec[MAX][20];
int lim;
char vals[MAX];
void init(int n, const char s[]) {
    for(int j=0;j!=n;++j){
        vals[j]=s[j];
    }
    for(int i=0;i!=20;++i){
        int sz = 1<<i;
        if(sz>MAX)break;
        for(int k=0;k!=sz;++k){
            pec[k][i]=inverte(k,i);
        }
    }
    lim = n;
}

int query(int i, int k) {
    int sz = 1<<(k);
    if(i+sz>lim)return 0;
    int count=0;
    for(int j=0;j!=sz;++j){
        int mirror = pec[j][k];
        count++;
        if(vals[mirror+i]!=vals[j+i])return 0;
        if(count==505)break;
    }
    for(int u=0;u!=500;++u){
        int x = rand()%sz;
        int mirror = pec[x][k];
        if(vals[mirror+i]!=vals[x+i])return 0;
    }
    return 1;
}

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 20776 KB Output is correct
2 Correct 37 ms 20796 KB Output is correct

Subtask #2
37.0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 20776 KB Output is correct
2 Correct 37 ms 20796 KB Output is correct
3 Correct 287 ms 21232 KB Output is correct
4 Correct 295 ms 21236 KB Output is correct
5 Correct 284 ms 21220 KB Output is correct

Subtask #3
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3040 ms 22708 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 20776 KB Output is correct
2 Correct 37 ms 20796 KB Output is correct
3 Correct 287 ms 21232 KB Output is correct
4 Correct 295 ms 21236 KB Output is correct
5 Correct 284 ms 21220 KB Output is correct
6 Execution timed out 3040 ms 22708 KB Time limit exceeded
7 Halted 0 ms 0 KB -