oj.uz

Submission #565215

# Submission time Handle Problem Language Result Execution time Memory
565215 2022-05-20T13:06:22 Z RealSnake Question (Grader is different from the original contest) (CEOI14_question_grader) C++14
100 / 100
 3147 ms 24260 KB 
bool first_testcase = 1;
bool a[13][924];

int encode(int n, int x, int y) {
    if(first_testcase) {
        first_testcase = 0;
        int k = 0;
        for(int i = 0; i < (1 << 12); i++) {
            if(__builtin_popcount(i) == 6) {
                for(int j = 0; j <= 12; j++)
                    a[j][k] = (i & (1 << j));
                k++;
            }
        }
    }
    for(int i = 0; i < 12; i++) {
        if(a[i][x] == 1 && a[i][y] == 0)
            return i + 1;
    }
    return 0;
}
bool first_testcase = 1;
bool a[13][924];

int decode(int n, int q, int h) {
    if(first_testcase) {
        first_testcase = 0;
        int k = 0;
        for(int i = 0; i < (1 << 12); i++) {
            if(__builtin_popcount(i) == 6) {
                for(int j = 0; j <= 12; j++)
                    a[j][k] = (i & (1 << j));
                k++;
            }
        }
    }
    return a[h - 1][q];
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 3147 ms 24260 KB Output is correct - maxh = 12
2 Correct 3129 ms 24048 KB Output is correct - maxh = 12