oj.uz

Submission #166442

# Submission time Handle Problem Language Result Execution time Memory
166442 2019-12-02T13:07:45 Z dolphingarlic Question (Grader is different from the original contest) (CEOI14_question_grader) C++14
0 / 100
 131 ms 47992 KB 
int sets[921][6], cnt = 1;

int encode(int n, int x, int y) {
    // Creates a unique set for each integer from 1 to 920 with 6 elements from 1 to 12
    for (int i = 0; i < (1<<12); i++) {
        if (__builtin_popcount(i) == 6) {
            for (int j = 0, k = 0; j < 12; j++) if (i & (1<<j)) sets[cnt][k++] = j + 1;
            cnt++;
        }
    }

    // Returns a number that is in sets[x] but not sets[y]
    for (int i = 0; i < 6; i++) if (sets[x][i] != sets[y][i]) return sets[x][i];
}
int sets[921][6], cnt = 1;

int decode (int n, int q, int h) {
	// Creates a unique set for each integer from 1 to 920 with 6 elements from 1 to 12
    for (int i = 0; i < (1<<12); i++) {
        if (__builtin_popcount(i) == 6) {
            for (int j = 0, k = 0; j < 12; j++) if (i & (1<<j)) sets[cnt][k++] = j + 1;
            cnt++;
        }
    }

	// If h is in the set of q, return yes
	for (int i = 0; i < 6; i++) if (sets[q][i] == h) return 1;
	return 0;
}

Compilation message

encoder.cpp: In function 'int encode(int, int, int)':
encoder.cpp:14:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
0.0 / 100.0

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