# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
463435 | lukadupli | Question (Grader is different from the original contest) (CEOI14_question_grader) | C++14 | 7044 ms | 4236 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 strat[1000];
int encode(int n, int x, int y){
int pos = 1;
for(int mask = 0; mask < (1 << 12); mask++){
if(__builtin_popcount(mask) == 6){
strat[pos] = mask;
pos++;
}
}
for(int h = 0; h <= 11; h++){
bool xb = strat[x] & (1 << h);
bool yb = strat[y] & (1 << h);
if(xb && !yb) return h + 1;
}
}
#include <bits/stdc++.h>
using namespace std;
int strat[1000];
int decode(int n, int q, int h){
int pos = 1;
for(int mask = 0; mask < (1 << 12); mask++){
if(__builtin_popcount(mask) == 6){
strat[pos] = mask;
pos++;
}
}
h--;
if(strat[q] & (1 << h)) return 1;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |