# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
5609 | kriii | cmp (balkan11_cmp) | C++98 | 1998 ms | 82936 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 "cmp.h"
// 팔진트리를 두개만들어서 하나는 앞의 6비트, 하나는 뒤의 6비트를 보게 하였음
inline int par(int v){
return (v - 1) / 8;
}
const int Y = 100;
const int Z = 1 + (1 << 3);
void remember(int a)
{
int A[2],i;
A[0] = a / 64;
A[1] = a % 64;
for (i=0;i<2;i++){
a = A[i] + Z;
while (a){
bit_set(a+Y*i);
a = par(a);
}
}
}
int compare(int b)
{
int B[2],i;
B[0] = b / 64;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |