# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
566799 | Deepesson | cmp (balkan11_cmp) | C++17 | 4858 ms | 104940 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 "cmp.h"
void bit_set(int addr);
int bit_get(int addr);
void remember(int n) {
std::vector<int> vec;
while(n){
vec.push_back(n&1);
n/=2;
}
while(vec.size()<12) vec.push_back(0);
std::reverse(vec.begin(),vec.end());
int base=1;
for(int i=0;i!=vec.size();++i){
base*=2;
base+=vec[i];
bit_set(base+1);
}
}
int compare(int b) {
std::vector<int> vec;
while(b){
vec.push_back(b&1);
b/=2;
}
while(vec.size()<12) vec.push_back(0);
std::reverse(vec.begin(),vec.end());
int l=0,r=12;
while(l<r){
int m = (l+r+1)/2;
int base=1;
for(int i=0;i<m;++i){
base*=2;
base+=vec[i];
}
int x = bit_get(base+1);
if(x){
l=m;
}else r=m-1;
}
///Sao iguais
if(l==12){
return 0;
}
///Eh maior
if(vec[l]){
return 1;
}
///Eh menor
return -1;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |