oj.uz

Submission #166452

# Submission time Handle Problem Language Result Execution time Memory
166452 2019-12-02T13:23:20 Z dolphingarlic Question (Grader is different from the original contest) (CEOI14_question_grader) C++14
0 / 100
 7000 ms 5976 KB 
int encode(int n, int x, int y) {
    int sets[925][12];
    // Creates a unique set for each integer from 1 to 920 with 6 elements from 1 to 12
    for (int i = 0, cnt = 1; i < (1<<12); i++) {
        if (__builtin_popcount(i) == 6) {
            for (int j = 0; j < 12; j++) if (i & (1<<j)) sets[cnt][j] = 1; else sets[cnt][j] = 0;
            cnt++;
        }
    }

    // Returns a number that is in sets[x] but not sets[y]
    for (int i = 0; i < 12; i++) if (sets[x][i] && !sets[y][i]) return i + 1;
}
int decode(int n, int q, int h) {
	int sets[925][12];
	// Creates a unique set for each integer from 1 to 920 with 6 elements from 1 to 12
    for (int i = 0, cnt = 1; i < (1<<12); i++) {
        if (__builtin_popcount(i) == 6) {
            for (int j = 0; j < 12; j++) if (i & (1<<j)) sets[cnt][j] = 1; else sets[cnt][j] = 0;
            cnt++;
        }
    }

	// If h is in the set of q, return yes
	return sets[q][h - 1];
}

Compilation message

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

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Execution timed out 7100 ms 5976 KB Time limit exceeded
2 Execution timed out 7087 ms 5900 KB Time limit exceeded