Submission #44622

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
44622	2018-04-03T22:29:22 Z	MatheusLealV	Question (Grader is different from the original contest) (CEOI14_question_grader)	C++17	0 / 100	1164 ms	78944 KB

encoder

#include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
typedef pair<int, int> pii;
 
int g = 0, Nmax = 0;
 
vector<int> v;
 
set<int> init;
 
void gerar()
{  
 	if(g) return;
 
	for(int val = 1; val <= (1<<12); val ++)
	{
		int l = 0, r = 0;
 
		for(int bit = 0; bit < 12; bit ++)
		{
			if(val & (1<<bit))
			{
				if(bit < 6) l++;
 
				else r ++;
			}
		}
 
		if(l == r && l > 0 && l < 6) v.push_back(val);
	}
 
	g = true;
}
 
int encode (int n, int x, int y)
{
    gerar();
 
    x = v[x], y = v[y];
 
    for(int bit = 0; bit < 12; bit ++)
    {
    	if( (x & (1<<bit)) && !(y & (1<<bit))) return bit + 1;
    }
}

decoder

#include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
typedef pair<int, int> pii;
 
int g = 0, Nmax = 0;
 
vector<int> v;
 
set<int> init;
 
void gerar()
{
	if(g) return;
  
	for(int val = 1; val <= (1<<12); val ++)
	{
		int l = 0, r = 0;
 
		for(int bit = 0; bit < 12; bit ++)
		{
			if(val & (1<<bit))
			{
				if(bit < 6) l++;
 
				else r ++;
			}
		}
 
		if(l == r && l > 0 && l < 6) v.push_back(val);
	}
 
	g = true;
}
 
int decode (int n, int q, int h)
{
	gerar();
  
  	h--;
 
	int val = v[q];
 
    if(val & (1<<h)) return 1;
 
    return 0;
}

Compilation message

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

Subtask #1

0.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1164 ms	78944 KB	wrong answer
2	Incorrect	1107 ms	78944 KB	wrong answer