# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
438895 | JovanB | Question (Grader is different from the original contest) (CEOI14_question_grader) | C++17 | 7099 ms | 1996 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 ima[1000][12];
int encode (int n, int x, int y) {
int tr = 0;
for(int j=0; j<=(1<<12); j++){
if(__builtin_popcount(j) == 6){
tr++;
for(int k=0; k<12; k++){
if((1<<k) & j) ima[tr][k] = 1;
}
}
}
for(int i=0; i<12; i++){
if(ima[x][i] && !ima[y][i]) return i+1;
}
}
#include <bits/stdc++.h>
using namespace std;
int ima[1000][12];
int decode (int n, int q, int h) {
h--;
int tr = 0;
for(int j=0; j<=(1<<12); j++){
if(__builtin_popcount(j) == 6){
tr++;
for(int k=0; k<12; k++){
if((1<<k) & j) ima[tr][k] = 1;
}
}
}
if(ima[q][h]) return 1;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |