# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
169075 | songc | 질문 (CEOI14_question_grader) | C++14 | 224 ms | 262148 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;
typedef pair<int,int> pii;
typedef long long LL;
vector<LL> V;
void f(int n, int k, LL d){
if (n == 12 && k == 6) V.push_back(d);
if (k < 6) f(n+1, k+1, d*2+1);
f(n+1, k, d*2);
}
int encode(int n, int x, int y) {
if (V.empty()) f(0, 0, 0);
for (int i=1; i<=12; i++) if ((x&(1ll<<(i-1))) && !(y&(1ll<<(i-1)))) return i;
}
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
typedef long long LL;
vector<LL> V;
void f(int n, int k, LL d){
if (n == 12 && k == 6) V.push_back(d);
if (k < 6) f(n+1, k+1, d*2+1);
f(n+1, k, d*2);
}
int decode(int n, int q, int h) {
if (V.empty()) f(0, 0, 0);
if (V[q] & (1<<(h-1))) return 1;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |