# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
858140 | iulia_morariu | Brperm (RMI20_brperm) | C++14 | 3048 ms | 1024 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include <brperm.h>
using namespace std;
char v[100000];
int n;
void init ( int N, const char s[] ){
n = N;
for(int i = 0; i < n; i++) v[i] = s[i];
}
int transform(int nr, int k){
vector <int> b;
while(nr > 0){
b.push_back(nr % 2);
nr /= 2;
}
while(b.size() < k) b.push_back(0);
int n1 = 0;
int p = 1;
for(int j = k - 1; j >= 0; j--){
n1 += p * b[j];
p *= 2;
}
return n1;
}
int query ( int it , int k ){
int p = 1;
for(int i = 0; i < k; i++) p *= 2;
if(it + p > n) return 0;
for(int i = 0; i < p; i++){
int x = transform( i, k );
//cout << "i = " << i << " x = " << x << " v.size() = " << v.size() << endl;
//if(x > v.size()) return 0;
if( v[it + x] != v[i + it] ) return 0;
}
return 1;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |