# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
362546 | ray5273 | cmp (balkan11_cmp) | C++14 | 2119 ms | 82592 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"
static const int base_num[4] = {480, 48, 6, 1};
static const int base_bas[4] = {12, 10, 8, 6};
static const int base_idx[4] = {1, 13, 23, 31};
void remember(int n) {
for (int i = 0; i < 4; ++i) {
bit_set(base_idx[i] + n / base_num[i]);
n %= base_num[i];
}
}
int compare(int b) {
for (int i = 0; i < 4; ++i) {
const int bb = b / base_num[i];
b %= base_num[i];
if (bit_get(base_idx[i] + bb)) continue;
else if (bb < base_bas[i] / 2) {
for (int j = bb - 1; j >= 0; --j) {
if (bit_get(base_idx[i] + j))
return +1;
}
return -1;
} else {
for (int j = bb + 1; j < base_bas[i]; ++j) {
if (bit_get(base_idx[i] + j))
return -1;
}
return +1;
}
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |