# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
793635 | khshg | cmp (balkan11_cmp) | C++14 | 1624 ms | 96032 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>
using namespace std;
const int arr[] = {1, 1 + 4, 1 + 4 + 4 * 4, 1 + 4 + 4 * 4 + 4 * 4 * 4, 1 + 4 + 4 * 4 + 4 * 4 * 4 + 4 * 4 * 4 * 4, 1 + 4 + 4 * 4 + 4 * 4 * 4 + 4 * 4 * 4 * 4 + 4 * 4 * 4 * 4 * 4};
void remember(int a) {
for(int i = 0; i < 6; ++i) {
bit_set(arr[i] + (a >> (10 - 2 * i)));
}
}
int compare(int b) {
int tl = 0, tr = 6;
while(tl < tr) {
int tm = (tl + tr) / 2;
if(bit_get(arr[tm] + (b >> (10 - 2 * tm)))) {
tl = tm + 1;
} else {
tr = tm;
}
}
if(tl == 6) return 0;
b >>= (10 - 2 * tl);
int t = b;
b &= 3;
t -= b;
if(b == 3) return 1;
if(b == 0) return -1;
if(b == 1) return bit_get(arr[tl] + t) ? 1 : -1;
return bit_get(arr[tl] + t + 3) ? -1 : 1;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |