oj.uz

Submission #545145

# Submission time Handle Problem Language Result Execution time Memory
545145 2022-04-03T16:34:21 Z rainboy Question (Grader is different from the original contest) (CEOI14_question_grader) C
0 / 100
 75 ms 23924 KB 
#define L	12
#define N	924	/* N = choose(L, L / 2) */

static int cnt[1 << L], bb[N], n;

void init() {
	int b;

	cnt[0] = 0;
	for (b = 1; b < 1 << L; b++)
		if ((cnt[b] = cnt[b & b - 1] + 1) == L / 2)
			bb[n++] = b;
}

int encode(int n, int x, int y) {
	int l;

	init();
	for (l = 0; l < L; l++)
		if ((bb[x] & 1 << l) == 0 && (bb[y] & 1 << l) != 0)
			return l + 1;
	return 0;
}
#define L	12
#define N	924	/* N = choose(L, L / 2) */

static int cnt[1 << L], bb[N], n;

void init() {
	int b;

	cnt[0] = 0;
	for (b = 1; b < 1 << L; b++)
		if ((cnt[b] = cnt[b & b - 1] + 1) == L / 2)
			bb[n++] = b;
}

int decode(int n, int x, int y) {
	x--, y--;
	return (bb[x] & 1 << y) == 0;
}

Compilation message

encoder.c: In function 'init':
encoder.c:11:27: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   11 |   if ((cnt[b] = cnt[b & b - 1] + 1) == L / 2)
      |                         ~~^~~

decoder.c: In function 'init':
decoder.c:11:27: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   11 |   if ((cnt[b] = cnt[b & b - 1] + 1) == L / 2)
      |                         ~~^~~

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 74 ms 23904 KB 잘못된 접근입니다.
2 Incorrect 75 ms 23924 KB 잘못된 접근입니다.