# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
97032 | Kastanda | Question (Grader is different from the original contest) (CEOI14_question_grader) | C++11 | 1633 ms | 78800 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.
// And I was like ooo-eee-ooo
#include<bits/stdc++.h>
using namespace std;
const int MXN = 4095;
vector < int > A;
inline int Init()
{
for (int i = 0; i <= MXN; i++)
if (__builtin_popcount(i) == 6)
A.push_back(i);
}
int encode(int N, int X, int Y)
{
if (!A.size()) Init();
return (__builtin_ctz(A[X] & (MXN ^ A[Y])) + 1);
}
// White tiger's like ooo-aaa--oooo
#include<bits/stdc++.h>
using namespace std;
const int MXN = 4095;
vector < int > A;
inline int Init()
{
for (int i = 0; i <= MXN; i++)
if (__builtin_popcount(i) == 6)
A.push_back(i);
}
int decode(int N, int Q, int H)
{
if (!A.size()) Init();
return (A[Q] & (1 << H - 1)) > 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |