oj.uz

Submission #596538

# Submission time Handle Problem Language Result Execution time Memory
596538 2022-07-14T20:03:03 Z Deepesson Brperm (RMI20_brperm) C++17
0 / 100
 2 ms 1364 KB 
#include <bits/stdc++.h>
#define MAX 2500
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;
}
char vals[MAX];
void init(int n, const char s[]) {
    for(int j=0;j!=n;++j){
        vals[j]=s[j];
    }
  return;
}

int query(int i, int k) {
    int sz = 1<<k;
    for(int j=i;j!=i+sz;++j){
        int mirror = inverte(j-i,k)+i;
        if(vals[mirror]!=vals[j])return 0;
    }
    return 1;
}

Subtask #1
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 37.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 1364 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 33.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -