oj.uz

Submission #320275

# Submission time Handle Problem Language Result Execution time Memory
320275 2020-11-08T07:44:24 Z tasfiq4 Question (Grader is different from the original contest) (CEOI14_question_grader) C++14
100 / 100
 4984 ms 24740 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
bool am=false;
int ok[922][12];
int perm[12]={0,0,0,0,0,0,1,1,1,1,1,1};
 
int encode(int n,int x,int y){
	//printf("x %d y %d\n",x,y);
	int i,cnt=0;
	if(!am)
	{
		do{
			for(i=0;i<12;i++)
				ok[cnt][i]=perm[i];
			cnt++;
		}while(next_permutation(perm,perm+12));
		am=true;
	}
	x--;y--;
	for(i=0;i<12;i++)
		if(ok[x][i]&&!ok[y][i]) return i+1;
}
#include <bits/stdc++.h>
 
using namespace std;
 
bool am=false;
int ok[922][12];
int perm[12]={0,0,0,0,0,0,1,1,1,1,1,1};
 
 
int decode(int n,int q,int h){
	int i,cnt=0;
	q--;
	if(!am)
	{
		do{
			for(i=0;i<12;i++)
				ok[cnt][i]=perm[i];
			cnt++;
		}while(next_permutation(perm,perm+12));
		am=true;
	}
	return ok[q][h-1];
	//printf("h %lld\n",h);
}

Compilation message

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

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 4984 ms 24740 KB Output is correct - maxh = 12
2 Correct 4671 ms 24548 KB Output is correct - maxh = 12