oj.uz

Submission #126026

# Submission time Handle Problem Language Result Execution time Memory
126026 2019-07-06T19:00:52 Z eriksuenderhauf Question (Grader is different from the original contest) (CEOI14_question_grader) C++11
100 / 100
 1593 ms 79680 KB 
#include <bits/stdc++.h>
const int MAXN = 1e3 + 5;
int cnt = 1, a[MAXN];

int encode(int n, int x, int y) {
    if (cnt == 1) {
      for (int i = 0; i < (1 << 12); i++) {
          if (__builtin_popcount(i) != 6)
              continue;
          a[cnt++] = i;
      }
    }
	for (int i = 0; i < 12; i++) {
		if ((a[y] >> i) & 1)
			continue;
		if (!((a[x] >> i) & 1))
			continue;
		return i+1;
	}
    return -1;
}
#include <bits/stdc++.h>
const int MAXN = 1e3 + 5;
int cnt = 1, a[MAXN];

int decode(int n, int q, int h) {
    if (cnt == 1) {
      for (int i = 0; i < (1 << 12); i++) {
          if (__builtin_popcount(i) != 6)
              continue;
          a[cnt++] = i;
      }
    }
	if ((a[q] >> (h-1)) & 1)
		return 1;
	else
		return 0;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1593 ms 79600 KB Output is correct - maxh = 12
2 Correct 1584 ms 79680 KB Output is correct - maxh = 12