oj.uz

Submission #793635

# Submission time Handle Problem Language Result Execution time Memory
793635 2023-07-26T04:57:11 Z khshg cmp (balkan11_cmp) C++14
100 / 100
 1624 ms 96032 KB 
#include "cmp.h"
#include<bits/stdc++.h>
using namespace std;

const int arr[] = {1, 1 + 4, 1 + 4 + 4 * 4, 1 + 4 + 4 * 4 + 4 * 4 * 4, 1 + 4 + 4 * 4 + 4 * 4 * 4 + 4 * 4 * 4 * 4, 1 + 4 + 4 * 4 + 4 * 4 * 4 + 4 * 4 * 4 * 4 + 4 * 4 * 4 * 4 * 4};

void remember(int a) {
	for(int i = 0; i < 6; ++i) {
		bit_set(arr[i] + (a >> (10 - 2 * i)));
	}
}

int compare(int b) {
	int tl = 0, tr = 6;
	while(tl < tr) {
		int tm = (tl + tr) / 2;
		if(bit_get(arr[tm] + (b >> (10 - 2 * tm)))) {
			tl = tm + 1;
		} else {
			tr = tm;
		}
	}
	if(tl == 6) return 0;
	b >>= (10 - 2 * tl);
	int t = b;
	b &= 3;
	t -= b;
	if(b == 3) return 1;
	if(b == 0) return -1;
	if(b == 1) return bit_get(arr[tl] + t) ? 1 : -1;
	return bit_get(arr[tl] + t + 3) ? -1 : 1;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1624 ms 96032 KB Output is correct - maxAccess = 10, score = 100