# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
73090 | Pajaraja | cmp (balkan11_cmp) | C++17 | 0 ms | 0 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;
void remember(int n)
{
int poc[6]={1,4500,6000,6500,7000,7500},c[6],p[7];
p[6]=0;
for(int i=0;i<6;i++) c[i]=2*((1<<(11-2*i)) & n) + ((1<<(10-2*i)) & n);
for(int i=5;i>=0;i--) p[i]=4*p[i+1]+c[i];
for(int i=0;i<6;i++) bit_set(poc[i]+p[i]);
}
int compare(int b)
{
int poc[6]={1,4500,6000,6500,7000,7500},c[6],p[7];
p[6]=0;
for(int i=0;i<6;i++) c[i]=2*((1<<(11-2*i)) & b) + ((1<<(10-2*i)) & b);
for(int i=5;i>=0;i--) p[i]=4*p[i+1]+c[i];
int x=0;
while(get_bit(poc[x]+p[x]) && x<6) x++;
if(x==6) return 0;
if(c[x]==0) return -1;
if(c[x]==3) return 1;
if(c[x]==1)
{
if(poc[x]+p[x]-(1<<(10-2*x))) return 1;
else return -1;
}
if(poc[x]+p[x]+(1<<(10-2*x))) return 1;
else return -1;
}