| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1088119 | pedroslrey | 질문 (CEOI14_question_grader) | C++14 | 7074 ms | 8336 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int encode (int n, int x, int y) {
	vector<int> dp(n+1);
	int cnt = 0;
	for (int mask = 1; mask < (1 << 12) && cnt <= n; ++mask)
		if (__builtin_popcount(mask) == 6)
			dp[++cnt] = mask;
	int ans;
	for (int k = 0; k < 12; ++k)
		if ((dp[x] & (1 << k)) && !(dp[y] & (1 << k)))
			ans = k;
	return ans + 1;
}
#include <bits/stdc++.h>
using namespace std;
int decode (int n, int q, int h) {
	vector<int> dp(n+1);
	int cnt = 0;
	for (int mask = 1; mask < (1 << 12) && cnt <= n; ++mask)
		if (__builtin_popcount(mask) == 6)
			dp[++cnt] = mask;
	return (dp[q] >> (h - 1)) & 1;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
