# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
230110 | Ruxandra985 | Question (Grader is different from the original contest) (CEOI14_question_grader) | C++14 | 4019 ms | 48272 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>
int code[10000];
int ok1 , ok2;
int encode (int N, int x, int y){
int elem , i , aux , cnt;
if (!ok1){
elem = 0;
ok1 = 1;
for (i = 0 ; i < (1 << 12) ; i++){
aux = i;
cnt = 0;
while (aux){
cnt += aux % 2;
aux /= 2;
}
if (cnt == 6)
code[++elem] = i;
}
}
x = code[x];
y = code[y];
for (i = 0 ; i < 12 ; i++){
if (((x & (1 << i)) == 0) && ((y & (1 << i)) != 0))
return i + 1;
}
}
#include <bits/stdc++.h>
int code[10000];
int ok1 , ok2;
int decode (int N, int q, int h){
int elem , i , aux , cnt;
h--;
if (!ok2){
elem = 0;
ok2 = 1;
for (i = 0 ; i < (1 << 12) ; i++){
aux = i;
cnt = 0;
while (aux){
cnt += aux % 2;
aux /= 2;
}
if (cnt == 6)
code[++elem] = i;
}
}
q = code[q];
if (q & (1 << h))
return 0;
return 1;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |