Submission #260551

#TimeUsernameProblemLanguageResultExecution timeMemory
260551baboQuestion (Grader is different from the original contest) (CEOI14_question_grader)C++14
100 / 100
4137 ms48112 KiB
#include <bits/stdc++.h> using namespace std; bool did=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(!did) { do{ for(i=0;i<12;i++) ok[cnt][i]=perm[i]; cnt++; }while(next_permutation(perm,perm+12)); did=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 did=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(!did) { do{ for(i=0;i<12;i++) ok[cnt][i]=perm[i]; cnt++; }while(next_permutation(perm,perm+12)); did=true; } return ok[q][h-1]; //printf("h %lld\n",h); }

Compilation message (stderr)

encoder.cpp: In function 'int encode(int, int, int)':
encoder.cpp:24:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
#Verdict Execution timeMemoryGrader output
Fetching results...