# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
136918 | zoooma13 | Question (Grader is different from the original contest) (CEOI14_question_grader) | C++14 | 1605 ms | 83360 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;
vector <int> seq;
void gen(int p=11 ,int s=0 ,int o=0){
if(p == -1){
if(o==6)
seq.push_back(s);
return;
}
gen(p-1 ,s ,o);
gen(p-1 ,s|(1<<p) ,o+1);
}
int encode(int n, int x, int y){
if(seq.empty()) gen();
x = seq[x] ,y = seq[y];
for(int i=0; i<12; i++)
if((x&(1<<i)) && !(y&(1<<i)))
return i+1;
}
#include "bits/stdc++.h"
using namespace std;
vector <int> seq;
void gen(int p=11 ,int s=0 ,int o=0){
if(p == -1){
if(o==6)
seq.push_back(s);
return;
}
gen(p-1 ,s ,o);
gen(p-1 ,s|(1<<p) ,o+1);
}
int decode(int n, int q, int h){
if(seq.empty()) gen();
return bool(seq[q]&(1<<(h-1)));
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |