제출 #354403

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
354403		rqi	Question (Grader is different from the original contest) (CEOI14_question_grader)	C++14	0 / 100	2 ms	796 KiB

encoder

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<pi> vpi;

#define pb push_back
#define f first
#define s second
#define mp make_pair
#define ins insert

#define sz(x) (int)(x).size()
#define all(x) begin(x), end(x)

const int maxh = 12;
vector<vi> subs;
vi sub;

void genSub(int curnum = 1){
	if(sz(sub) == maxh/2){
		subs.pb(sub);
		// for(auto u: sub){
		// 	cout << u << " ";
		// }
		// cout << "\n";
		return;
	}
	for(int i = curnum; i <= maxh; i++){
		sub.pb(i);
		genSub(i+1);
		sub.pop_back();
	}
}

int encode (int n, int x, int y) {
	genSub();
	x--;
	y--;
	vector<bool> insub1(maxh+1, 0);
	vector<bool> insub2(maxh+1, 1);
	for(int k = 0; k < sz(subs[x]); k++){
		insub1[subs[x][k]] = 1;
		insub2[subs[x][k]] = 0;
	}

	for(int h = 1; h <= maxh; h++){
		if(insub1[h] && insub2[h]){
			return h;
		}
	}
	return -1;
}

decoder

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<pi> vpi;

#define pb push_back
#define f first
#define s second
#define mp make_pair
#define ins insert

#define sz(x) (int)(x).size()
#define all(x) begin(x), end(x)

const int maxh = 12;
vector<vi> subs;
vi sub;

void genSub(int curnum = 1){
	if(sz(sub) == maxh/2){
		subs.pb(sub);
		// for(auto u: sub){
		// 	cout << u << " ";
		// }
		// cout << "\n";
		return;
	}
	for(int i = curnum; i <= maxh; i++){
		sub.pb(i);
		genSub(i+1);
		sub.pop_back();
	}
}


int decode (int n, int q, int h) {
	genSub();
	q--;
	for(int i = 0; i < sz(subs[q]); i++){
		if(subs[q][i] == h) return 1;
	}
	return 0;
}

• Subtask 1: 0 / 100