# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
29368 | Bruteforceman | cmp (balkan11_cmp) | C++11 | 2 ms | 248 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 "cmp.h"
#include "bits/stdc++.h"
void remember(int n) {
//edit this
std::vector <int> v;
for(int i = 0; i < 4; i++) {
v.push_back(n % 8);
n /= 8;
}
reverse(v.begin(), v.end());
for(size_t i = 0; i < v.size(); i++) {
bit_set(v[i] + i * 8);
}
}
int compare(int b) {
//edit this
std::vector <int> v;
for(int i = 0; i < 4; i++) {
v.push_back(b % 8);
b /= 8;
}
reverse(v.begin(), v.end());
for(size_t i = 0; i < v.size(); i++) {
if(bit_get(v[i] + i * 8) == 0) {
if(v[i] <= 3) {
for(int j = 0; j < v[i]; j++) {
if(bit_get(j + i * 8) == 1) return 1;
}
return -1;
} else {
for(int j = v[i] + 1; j < 8; j++) {
if(bit_get(j + i * 8) == 1) return -1;
}
return 1;
}
}
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |