oj.uz

Submission #73091

# Submission time Handle Problem Language Result Execution time Memory
73091 2018-08-27T15:49:10 Z Pajaraja cmp (balkan11_cmp) C++17
0 / 100
 4 ms 504 KB 
#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(bit_get(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;
}

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 504 KB ZERO POINTS: bit_set with addr out of range 10241