# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
166670 | Lawliet | Question (Grader is different from the original contest) (CEOI14_question_grader) | C++14 | 1616 ms | 114568 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.
int mask[930];
bool preCalculate;
bool isActive(int v, int k) { return v & (1 << k); }
int encode (int n, int x, int y)
{
if( !preCalculate )
{
int cnt = 1;
for(int m = 0 ; cnt <= n ; m++)
if( __builtin_popcount( m ) == 6 ) mask[ cnt++ ] = m;
preCalculate = true;
}
x = mask[ x ];
y = mask[ y ];
for(int j = 0 ; j < 12 ; j++)
if( isActive( x , j ) && !isActive( y , j ) ) return j + 1;
}
int mask[930];
bool preCalculate;
bool isActive(int v, int k) { return v & (1 << k); }
int decode (int n, int q, int h)
{
h--;
if( !preCalculate )
{
int cnt = 1;
for(int m = 0 ; cnt <= n ; m++)
if( __builtin_popcount( m ) == 6 ) mask[ cnt++ ] = m;
preCalculate = true;
}
if( isActive( mask[ q ] , h ) ) return 1;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |