# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1034211 | 2024-07-25T10:38:39 Z | vjudge1 | cmp (balkan11_cmp) | C++17 | 0 ms | 0 KB |
#include "cmp.h" #include <bits/stdc++.h> using namespace std; void remember(int n) { int x = __builtin_popcount(n); if (x < 1 + 12-x) { for (int i = 0; i <= 11; i++) { if ((n >> i) & 1) bit_set(i+1); } } else { bit_set(13); for (int i = 0; i <= 11; i++) { if (!((n >> i) & 1)) bit_set(i+1); } } } int compare(int n) { int inv = bit_get(13); for (int i = 11; i >= 0; i--) { int x = bit_get(i+1); if (inv) x = !x; int y = (n >> i) & 1; if (x > y) return -1; else if (x < y) return 1; } return 0 }