# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
64752 | bazsi700 | Question (Grader is different from the original contest) (CEOI14_question_grader) | C++14 | 2046 ms | 79168 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;
#define ll long long
int mask[930];
int encode(int n, int x, int y) {
if(mask[1] == 0) {
int nxt = 1;
for(int i = 0; i < (1<<12); i++) {
int cn = 0;
for(int j = 0; j < 12; j++) {
if(i&(1<<j)) {
cn++;
}
}
if(cn == 6) {
mask[nxt++] = i;
}
}
}
for(int j = 0; j < 12; j++) {
if((mask[x]&(1<<j)) && !(mask[y]&(1<<j))) {
return j+1;
}
}
}
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int mask[930];
int decode(int n, int q, int h) {
if(mask[1] == 0) {
int nxt = 1;
for(int i = 0; i < (1<<12); i++) {
int cn = 0;
for(int j = 0; j < 12; j++) {
if(i&(1<<j)) {
cn++;
}
}
if(cn == 6) {
mask[nxt++] = i;
}
}
}
if(mask[q]&(1<<(h-1))) {
return 1;
} else {
return 0;
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |