Submission #1034331

#TimeUsernameProblemLanguageResultExecution timeMemory
1034331vjudge1cmp (balkan11_cmp)C++17
19 / 100
4161 ms82564 KiB
#include "cmp.h" #include <bits/stdc++.h> using namespace std; #define all(x) x.begin(), x.end() const int N = 4096; mt19937 rng(time(nullptr) + 69); void remember(int a) { int x = __builtin_popcount(a); if (x <= 1 + 12-x) { for (int i = 0; i <= 11; i++) { if ((a >> i) & 1) bit_set(i+1); } } else { bit_set(13); for (int i = 0; i <= 11; i++) { if (!((a >> i) & 1)) bit_set(i+1); } } } int compare(int b) { vector<int> bt(12); for (int i = 0; i < 12; i++) { bt[i] = i; } shuffle(all(bt), rng); int inv = bit_get(13); int mask = 0; int yes = 0; int no = 0; for (int i = 0; i < 12; i++) { int x = bit_get(bt[i]+1); if (inv) x = !x; if (x) { mask ^= (1 << bt[i]); yes++; } else { no++; } if (inv) { // tiene >= 7 bits activados if (no == 5) { for (int j = i+1; j < 12; j++) { mask ^= (1 << bt[j]); } break; } } else { // tiene <= 6 bits activados if (yes == 6) break; } } if (mask > b) return -1; else if (mask == b) return 0; else return 1; }
#Verdict Execution timeMemoryGrader output
Fetching results...