# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
969972 | bachhoangxuan | Question (Grader is different from the original contest) (CEOI14_question_grader) | C++17 | 2 ms | 4780 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;
namespace Encode{
bool init=false;
int mask[1005];
void build(int N){
int cnt=0;init=true;
for(int i=1;i<=N;i++){
while(true){
int x=__builtin_popcount(cnt);
if(x<=0 || x>=9) cnt++;
else break;
}
int x=8-__builtin_popcount(cnt);
mask[i]=cnt*8+x;cnt++;
}
}
}
int encode (int n, int x, int y) {
if(!Encode::init) Encode::build(n);
int mx=Encode::mask[x];
int my=Encode::mask[y];
for(int j=0;j<=12;j++) if((mx>>j&1) && !(my>>j&1)) return j;
return -1;
}
#include<bits/stdc++.h>
using namespace std;
namespace Decode{
bool init=false;
int mask[1005];
void build(int N){
int cnt=0;
for(int i=1;i<=N;i++){
while(true){
int x=__builtin_popcount(cnt);
if(x<=0 || x>=9) cnt++;
else break;
}
int x=8-__builtin_popcount(cnt);
mask[i]=cnt*8+x;cnt++;
}
}
}
int decode (int n, int q, int h) {
if(!Decode::init) Decode::build(n);
return (Decode::mask[q]>>h&1);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |