답안 #1060967

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1060967	2024-08-16T05:04:59 Z	thieunguyenhuy	질문 (CEOI14_question_grader)	C++17	0 / 100	7000 ms	4668 KB

encoder

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

#define popcount(n) (__builtin_popcountll((n)))
#define clz(n) (__builtin_clzll((n)))
#define ctz(n) (__builtin_ctzll((n)))
#define lg(n) (63 - __builtin_clzll((n)))
#define BIT(n, i) (((n) >> (i)) & 1ll)
#define MASK(i) (1ll << (i))
#define FLIP(n, i) ((n) ^ (1ll << (i)))
#define ON(n, i) ((n) | MASK(i))
#define OFF(n, i) ((n) & ~MASK(i))

#define Int __int128
#define fi first
#define se second

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long long, int> pli;
typedef pair<int, long long> pil;
typedef vector<pair<int, int>> vii;
typedef vector<pair<long long, long long>> vll;
typedef vector<pair<long long, int>> vli;
typedef vector<pair<int, long long>> vil;

template <class T1, class T2>
bool maximize(T1 &x, T2 y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}
template <class T1, class T2>
bool minimize(T1 &x, T2 y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}

template <class T>
void remove_duplicate(vector<T> &ve) {
    sort (ve.begin(), ve.end());
    ve.resize(unique(ve.begin(), ve.end()) - ve.begin());
}

mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
template <class T> T random(T l, T r) {
    return uniform_int_distribution<T>(l, r)(rng);
}
template <class T> T random(T r) {
    return rng() % r;
}

const int N = 1000 + 5;
const int MOD = 1e9 + 7;
const int inf = 1e9;
const ll INF = 1e18;

vector<int> sets[N];

void prepare_sets(int n) {
	vector<vector<int>> all_sets;
	for (int mask = 0; mask < MASK(12); ++mask) {
		if (popcount(mask) != 6) continue;
		vector<int> cur_set;
		for (int i = 0; i < 12; ++i) if (BIT(mask, i)) {
			cur_set.emplace_back(i);
		}
		sort (cur_set.begin(), cur_set.end());
		all_sets.emplace_back(cur_set);
	}

	sort (all_sets.begin(), all_sets.end());
	for (int i = 1; i <= n; ++i) sets[i] = all_sets[i - 1];
}

int encode(int n, int x, int y) {
	prepare_sets(n);
	vector<bool> mark(12, false);
	for (auto it : sets[y]) mark[it] = true;
	for (auto it : sets[x]) if (!mark[it]) return it + 1;
	assert(false); return -1;
}

#ifdef hwe
signed main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);

    int h = encode(1, 1, 2);
    cerr << h;

    cerr << '\n'; return 0;
}
#endif

decoder

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

#define popcount(n) (__builtin_popcountll((n)))
#define clz(n) (__builtin_clzll((n)))
#define ctz(n) (__builtin_ctzll((n)))
#define lg(n) (63 - __builtin_clzll((n)))
#define BIT(n, i) (((n) >> (i)) & 1ll)
#define MASK(i) (1ll << (i))
#define FLIP(n, i) ((n) ^ (1ll << (i)))
#define ON(n, i) ((n) | MASK(i))
#define OFF(n, i) ((n) & ~MASK(i))

#define Int __int128
#define fi first
#define se second

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long long, int> pli;
typedef pair<int, long long> pil;
typedef vector<pair<int, int>> vii;
typedef vector<pair<long long, long long>> vll;
typedef vector<pair<long long, int>> vli;
typedef vector<pair<int, long long>> vil;

template <class T1, class T2>
bool maximize(T1 &x, T2 y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}
template <class T1, class T2>
bool minimize(T1 &x, T2 y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}

template <class T>
void remove_duplicate(vector<T> &ve) {
    sort (ve.begin(), ve.end());
    ve.resize(unique(ve.begin(), ve.end()) - ve.begin());
}

mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
template <class T> T random(T l, T r) {
    return uniform_int_distribution<T>(l, r)(rng);
}
template <class T> T random(T r) {
    return rng() % r;
}

const int N = 1000 + 5;
const int MOD = 1e9 + 7;
const int inf = 1e9;
const ll INF = 1e18;

vector<int> sets[N];

void prepare_sets(int n) {
	vector<vector<int>> all_sets;
	for (int mask = 0; mask < MASK(12); ++mask) {
		if (popcount(mask) != 6) continue;
		vector<int> cur_set;
		for (int i = 0; i < 12; ++i) if (BIT(mask, i)) {
			cur_set.emplace_back(i);
		}
		sort (cur_set.begin(), cur_set.end());
		all_sets.emplace_back(cur_set);
	}

	sort (all_sets.begin(), all_sets.end());
	for (int i = 1; i <= n; ++i) sets[i] = all_sets[i - 1];
}

int decode(int n, int q, int h) {
	prepare_sets(n); --h;
	for (auto it : sets[q]) if (it == h) return 1;
	return 0;
}

#ifdef hwe
signed main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);



    cerr << '\n'; return 0;
}
#endif

Subtask #1

0.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	7027 ms	900 KB	Time limit exceeded
2	Execution timed out	7053 ms	4668 KB	Time limit exceeded