제출 #166444

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
166444		dolphingarlic	질문 (CEOI14_question_grader)	C++14	0 / 100	133 ms	48120 KiB

encoder

int sets[925][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];
}

decoder

int sets[925][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;
}

컴파일 시 표준 에러 (stderr) 메시지

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 / 100