# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1029732 | coolboy19521 | cmp (balkan11_cmp) | C++17 | 981 ms | 96596 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"
int d[]{1, 4097, 5121, 5377, 5441, 5457};
void remember(int n) {
for (int i = 0; i < 6; i ++)
bit_set((n >> i * 2) + d[i]);
}
int compare(int b) {
int l = 0, r = 6;
while (l != r) {
int mi = l + (r - l) / 2;
if (bit_get((b >> mi * 2) + d[mi])) r = mi;
else l = mi + 1;
}
if (0 == l) return 0;
int ld = (b >> l * 2 - 2) & 3;
int p = ((b >> l * 2) << 2) + d[l - 1];
if (1 < ld) {
if (bit_get(p + 3)) return -1;
return 1;
} else {
if (bit_get(p)) return 1;
return -1;
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |