#include <bits/stdc++.h>
using namespace std;
bool am=false;
int code[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++)
code[cnt][i]=perm[i];
cnt++;
}while(next_permutation(perm,perm+12));
am=true;
}
x--;y--;
for(i=0;i<12;i++)
if(code[x][i]&&!code[y][i]) return i+1;
}
#include <bits/stdc++.h>
using namespace std;
bool am=false;
int code[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++)
code[cnt][i]=perm[i];
cnt++;
}while(next_permutation(perm,perm+12));
am=true;
}
return code[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 | }
| ^
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4343 ms |
24740 KB |
Output is correct - maxh = 12 |
2 |
Correct |
4064 ms |
24616 KB |
Output is correct - maxh = 12 |