oj.uz

Submission #652613

# Submission time Handle Problem Language Result Execution time Memory
652613 2022-10-23T14:00:42 Z MilosMilutinovic Question (Grader is different from the original contest) (CEOI14_question_grader) C++14
0 / 100
 7000 ms 2268 KB 
int encode(int n,int x,int y) {
	const int N=925;
	int ff[N][12];
	int tsz=0;
	for (int i=0;i<(1<<12);i++) if (__builtin_popcount(i)==6) {
		++tsz;
		for (int j=0;j<12;j++) if (i>>j&1) ff[tsz][j]=1;
	}
	for (int i=0;i<12;i++) if (ff[x][i]&&!ff[y][i]) return i+1;
}

const int N=925;
int ff[N][12],tsz;
int decode(int n,int q,int h) {
	for (int i=0;i<(1<<12);i++) if (__builtin_popcount(i)==6) {
		++tsz;
		for (int j=0;j<12;j++) if (i>>j&1) ff[tsz][j]=1;
	}
	return ff[q][h-1];
}

Compilation message

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

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Execution timed out 7091 ms 2172 KB Time limit exceeded
2 Execution timed out 7034 ms 2268 KB Time limit exceeded