# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
564420 | mars | Question (Grader is different from the original contest) (CEOI14_question_grader) | C++14 | 3102 ms | 24128 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;
const int N = 940;
int mask[N];
int cnt = 0;
void gen(){
cnt = 0;
for(int i = 0 ; i < (1 << 12); i ++ ){
if(__builtin_popcount(i) == 6){
mask[++cnt]=i;
}
}
}
int encode (int n, int x, int y) {
if(mask[1] == 0)
gen();
for(int i = 0 ; i < 12; i ++ ){
if((mask[x] & (1 << i)) && !(mask[y] & (1 << i))){
return i + 1;
}
}
return -1;
}
#include <bits/stdc++.h>
using namespace std;
const int NN = 940;
int mi[NN];
int cc;
void gen0(){
cc = 0;
for(int i = 0; i < (1 << 12); i ++ ){
if(__builtin_popcount(i) == 6){
mi[++cc]=i;
}
}
}
int decode (int n, int q, int h) {
if(mi[1] == 0){
gen0();
}
h--;
int msk = mi[q];
if((msk & (1 << h))) return true;
else return false;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |