# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1023241 | codefox | Question (Grader is different from the original contest) (CEOI14_question_grader) | C++14 | 0 ms | 0 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.
#pragma GCC target("popcnt")
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
int ps[930];
bool done = true;
void init()
{
int k = 0;
for (int j = 30; j < (1<<12); j++)
{
if (__builtin_popcount(j)==6)
{
k++;
ps[k] = j;
}
}
done = false;
}
int encode(int n, int a, int b)
{
if (done) init();
for (int h = 0; h< 12; h++)
{
if ((ps[a]&(1<<h)) && ((ps[b]&(1<<h))==0)) return h+1;
}
}
#pragma GCC target("popcnt")
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
ps[930];
bool done = true;
void init()
{
int k = 0;
for (int j = 30; j < (1<<12); j++)
{
if (__builtin_popcount(j)==6)
{
k++;
ps[k] = j;
}
}
done = false;
}
int decode(int n, int q, int h)
{
if (done) init();
h--;
if (ps[q]&(1<<h)) return true;
return false;
}