# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
43947 | dhkim0225 | cmp (balkan11_cmp) | C++14 | 1593 ms | 87928 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"
void remember(int n) {
n = n + 1;
int target = 2048;
int shift = 10;
while (true) {
if (shift == -2) {
bit_set(4096);
break;
}
if (target < n) {
bit_set(target);
target += (1 << shift);
}
else if (target > n) {
bit_set(target);
target -= (1 << shift);
}
else {
bit_set(target);
break;
}
shift--;
}
}
int compare(int b) {
int target = 2048;
int shift = 10;
if (bit_get(target) == 1) {
while (true) {
if (shift < 0)
break;
if (bit_get(target + (1 << shift)))
target += (1 << shift);
else if (bit_get(target - (1 << shift)))
target -= (1 << shift);
else
break;
shift--;
}
}
if (target - 1> b)
return -1;
else if (target - 1 < b)
return 1;
else
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |