oj.uz

Submission #347056

# Submission time Handle Problem Language Result Execution time Memory
347056 2021-01-11T15:46:51 Z ACmachine Question (Grader is different from the original contest) (CEOI14_question_grader) C++17
0 / 100
 2 ms 364 KB 
int encode (int n, int x, int y) {
    int sets[921];
    int id = 1;
    for(int i = 0; i < 12; ++i){
        for(int j = i + 1; j < 12; ++j){
            for(int k = j + 1; k < 12; ++k){
                for(int g = k + 1; g < 12; ++g){
                    for(int l = g + 1; l < 12; ++l){
                        for(int m = l + 1; m < 12; ++m){
                            sets[id++] = (1 << i) | (1 << j) | (1 << k) | (1 << g) | (1 << l) | (1 << m);
                        }
                    }
                }
            }
        }
    }
    return sets[x]&~sets[y]; 
}
int decode (int n, int q, int h) {
    int sets[921];
    int id = 1;
    for(int i = 0; i < 12; ++i){
        for(int j = i + 1; j < 12; ++j){
            for(int k = j + 1; k < 12; ++k){
                for(int g = k + 1; g < 12; ++g){
                    for(int l = g + 1; l < 12; ++l){
                        for(int m = l + 1; m < 12; ++m){
                            sets[id++] = (1 << i) | (1 << j) | (1 << k) | (1 << g) | (1 << l) | (1 << m);
                        }
                    }
                }
            }
        }
    }
    return (sets[q] == h);
}

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 364 KB Execution killed with signal 6 (could be triggered by violating memory limits)
2 Runtime error 2 ms 364 KB Execution killed with signal 6 (could be triggered by violating memory limits)