Submission #23524

#TimeUsernameProblemLanguageResultExecution timeMemory
23524TAMREF비교 (balkan11_cmp)C++11
91 / 100
2090 ms82768 KiB
#include "cmp.h" const int sz=5; const int x[sz]={1,3,15,105,945},y[sz]={3,5,7,9,5},pos[sz]={10,30,50,70,90}; void remember(int n) { for(int i=sz-1;i>=0;--i){ bit_set(pos[i]+n/x[i]); n%=x[i]; } } int compare(int b) { int g[6]; for(int i=sz-1;i>=0;--i){ g[i]=b/x[i]; b%=x[i]; } for(int i=sz-1;i>=0;--i){ if(bit_get(pos[i]+g[i])){ //printf("i=%d, YAY!\n",i); continue; } if(2*(g[i]+1)>y[i]){ for(int j=g[i]+1;j<y[i];j++) if(bit_get(pos[i]+j)) return -1; return 1; } else{ for(int j=g[i]-1;j>=0;--j) if(bit_get(pos[i]+j)) return 1; return -1; } } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...