# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1034357 |
2024-07-25T12:36:13 Z |
vjudge1 |
cmp (balkan11_cmp) |
C++17 |
|
5185 ms |
82948 KB |
#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);
bool f = 1;
int cnt[2][12][N];
void remember(int a) {
if (f) {
f = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < 12; j++) {
cnt[0][j][i] = cnt[1][j][i] = 2048;
}
}
}
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 = -1;
int mask = 0;
int yes = 0;
int no = 0;
for (int i = 0; i < 12; i++) {
// bt[i]
// de los que me quedan, todos tienen el mismo bit en esta posicion?
bool on = (cnt[1][bt[i]][b] > 0 ? 1 : 0);
bool off = (cnt[0][bt[i]][b] > 0 ? 1 : 0);
int x;
if (!on) {
x = 0;
}
else if (!off) {
x = 1;
}
else {
x = bit_get(bt[i]+1);
if (inv == -1) inv = bit_get(13);
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;
}
}
for (int i = 0; i < 12; i++) {
if ((mask >> i) & 1) cnt[1][i][b]--;
else cnt[0][i][b]--;
}
if (mask > b) return -1;
else if (mask == b) return 0;
else return 1;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
5185 ms |
82948 KB |
ZERO POINTS: For a=597 and b=2167, correct answer is 1, got -1 |