Submission #652602

#	Time	Username	Problem	Language	Result	Execution time	Memory
652602		MilosMilutinovic	Question (Grader is different from the original contest) (CEOI14_question_grader)	C++14	27 / 100	4838 ms	24256 KiB

encoder

#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef basic_string<int> BI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}());
const ll mod=998244353;
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

int encode(int n,int x,int y) {
	per(b,0,10) {
		int bx=(x>>b&1);
		int by=(y>>b&1);
		if (bx!=by) {
			return b*2+bx+1;
		}
	}
	assert(false);
}

decoder

int decode(int n,int q,int h) {
	--h;
	int b=h/2;
	int t=h%2;
	if ((q>>b&1)==t) return 1;
	else return 0;
}

• Subtask 1: 27 / 100