# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
858085 | iulia_morariu | Brperm (RMI20_brperm) | C++14 | 3031 ms | 2044 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;
string v;
void init ( int n, const char s[] ){
for(int i = 0; i < n; i++) v.push_back( 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 i = b.size() - 1; i >= 0; i--){
n1 += p * b[i];
p *= 2;
}*/
return n1;
}
int query ( int it , int k ){
int p = 1;
for(int i = 0; i < k; i++) p *= 2;
for(int i = it; i < it + p; i++){
int x = transform( i - it, k );
//cout << "i = " << i << " x = " << x << endl;
if( v[x] != v[i] ) 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... |