Submission #1260893

#	Time	Username	Problem	Language	Result	Execution time	Memory
1260893		M_W_13	Question (Grader is different from the original contest) (CEOI14_question_grader)	C++20	0 / 100	7094 ms	416 KiB

encoder

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define st first
#define nd second
#define pb push_back

pair<int, int> przerzut(int a, int b) {
  int c = 0;
  rep(i, max(a, b)) {
    while (__builtin_popcount(c) < 6) {
      c++;
    }
    if ((i + 1) == a) {
      a = c;
    }
    if ((i + 1) == b) {
      b = c;
    }
    c++;
  }
  return {a, b};
}

int encode (int n, int x, int y) {
  pair<int, int> p = przerzut(x, y);
  int a = 1;
  int kt = 1;
  while (true) {
    if (((a & p.st) == a) && ((a & p.nd) != a)) {
      return kt;
    }
    a *= 2;
    kt++;
  }
  return 0;
}

decoder

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define st first
#define nd second
#define pb push_back

pair<int, int> przerzut(int a, int b) {
  int c = 0;
  rep(i, max(a, b)) {
    while (__builtin_popcount(c) < 6) {
      c++;
    }
    if ((i + 1) == a) {
      a = c;
    }
    if ((i + 1) == b) {
      b = c;
    }
    c++;
  }
  return {a, b};
}

int decode (int n, int q, int h) {
	q = przerzut(q, q).st;
	int a = 1;
	rep(i, h) {
		a *= 2;
	}
	if ((a & q) == a) {
		return 1;
	}
	return 0;
}

• Subtask 1: 0 / 100