# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
42851 | kinssang | cmp (balkan11_cmp) | C++14 | 2063 ms | 102252 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 += 4096;
while (n > 1)
{
bit_set(n);
n >>= 2;
}
}
int compare(int b)
{
b += 4096;
int low = 0, high = 6;
while (low <= high)
{
int mid = (low + high) / 2;
if (mid == 6)
{
high = mid - 1;
continue;
}
int temp = bit_get(b >> (2*mid));
if (temp == 1) high = mid - 1;
else low = mid + 1;
}
if (high + 1 == 0) return 0;
if (b >> (2*high) == ((b >> (2*high+2)) * 4)) return -1;
if (b >> (2*high) == ((b >> (2*high+2)) * 4 + 3)) return 1;
if (b >> (2*high) == ((b >> (2*high + 2)) * 4 + 1)) return bit_get((b >> (2*high + 2)) * 4) ? 1 : -1;
if (b >> (2*high) == ((b >> (2*high + 2)) * 4 + 2)) return bit_get((b >> (2*high + 2)) * 4 + 3) ? -1 : 1;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |