oj.uz

Submission #48920

# Submission time Handle Problem Language Result Execution time Memory
48920 2018-05-20T03:08:58 Z Benq Question (Grader is different from the original contest) (CEOI14_question_grader) C++14
0 / 100
 1747 ms 184824 KB 
#include <stdio.h>
#include <stdlib.h>

#define F0R(i, a) for (int i=0; i<(a); i++)

int num[2772], tot = (1<<12)-1;

void gen() {
	int nex = 0;
	F0R(i,1<<12) if (i&1) if (__builtin_popcount(i) == 6) num[nex++] = i;
}

int encode (int N, int x, int y) {
    if (!num[0]) gen();
	int z = num[x]&(tot^num[y]);
	printf("%d\n",z);
	F0R(i,12) if (z&(1<<i)) return i+1;
}
#include <stdio.h>
#include <stdlib.h>

#define F0R(i, a) for (int i=0; i<(a); i++)

int num[2772], tot = (1<<12)-1;

void gen() {
	int nex = 0;
	F0R(i,1<<12) if (i&1) if (__builtin_popcount(i) == 6) num[nex++] = i;
}

int decode (int N, int q, int h) {
    if (!num[0]) gen();
	h --;
	if (num[q]&(1<<h)) return 1;
	return 0;
}

Compilation message

encoder.cpp: In function 'int encode(int, int, int)':
encoder.cpp:18: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 1498 ms 139032 KB 잘못된 접근입니다.
2 Incorrect 1747 ms 184824 KB 잘못된 접근입니다.