oj.uz

Submission #470025

# Submission time Handle Problem Language Result Execution time Memory
470025 2021-09-02T18:03:11 Z luciocf Question (Grader is different from the original contest) (CEOI14_question_grader) C++14
0 / 100
 3035 ms 24344 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
int mask[1010];
 
bool flag;
 
int encode(int n, int x, int y)
{
	if (!flag)
	{
		flag = 1;
 
		int ind = 0;
		for (int i = 0; i < (1<<12); i++)
			if (__builtin_popcount(i) == 6)
				mask[++ind] = i;
	}
 
	for (int i = 0; i <= 11; i++)
		if ((mask[x]&(1<<i)) && (!(mask[y]&(1<<i))))
			return i+1;
}

#include <bits/stdc++.h>

using namespace std;

int mask[1010];

bool flag;

int decode(int n, int q, int h)
{
	if (!flag)
	{
		flag = 1;

		int ind = 0;
		for (int i = 0; i < (1<<12); i++)
			if (__builtin_popcount(i) == 6)
				mask[++ind] = i;
	}

	return (mask[q]&(1<<(h-1)));
}

Compilation message

encoder.cpp: In function 'int encode(int, int, int)':
encoder.cpp:24:1: warning: control reaches end of non-void function [-Wreturn-type]
   24 | }
      | ^

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 3035 ms 24036 KB wrong answer
2 Incorrect 2497 ms 24344 KB wrong answer