# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
347060 | ACmachine | Question (Grader is different from the original contest) (CEOI14_question_grader) | C++17 | 5580 ms | 24488 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.
int sets[921];
int encode (int n, int x, int y) {
int id = 1;
if(id == 1){
for(int i = 0; i < 12; ++i){
for(int j = i + 1; j < 12; ++j){
for(int k = j + 1; k < 12; ++k){
for(int g = k + 1; g < 12; ++g){
for(int l = g + 1; l < 12; ++l){
for(int m = l + 1; m < 12; ++m){
sets[id++] = (1 << i) | (1 << j) | (1 << k) | (1 << g) | (1 << l) | (1 << m);
}
}
}
}
}
}
}
for(int i = 0; i < 12; ++i){
if(sets[x]&(1 << i) && !(sets[y]&(1 << i)))
return i + 1;
}
}
int sets[921];
int decode (int n, int q, int h) {
int id = 1;
if(id == 1){
for(int i = 0; i < 12; ++i){
for(int j = i + 1; j < 12; ++j){
for(int k = j + 1; k < 12; ++k){
for(int g = k + 1; g < 12; ++g){
for(int l = g + 1; l < 12; ++l){
for(int m = l + 1; m < 12; ++m){
sets[id++] = (1 << i) | (1 << j) | (1 << k) | (1 << g) | (1 << l) | (1 << m);
}
}
}
}
}
}
}
return (sets[q] &(1 << (h-1)));
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |