# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
343688 | 2021-01-04T11:38:01 Z | juggernaut | Question (Grader is different from the original contest) (CEOI14_question_grader) | C++14 | 3971 ms | 24528 KB |
int arr[924],pos; int encode (int n, int x, int y){ if(!pos){ int a,b; for(int i=0;i<4096;i++){ a=i;b=0; while(a>=1){ b+=(a%2); a/=2; } if(b==6) arr[pos++]=i; } } x=arr[x-1];y=arr[y-1]; for(int i=0;i<12;i++) if(x>>i&1 && !(y>>i&1)) return i+1; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3971 ms | 24528 KB | Output is correct - maxh = 12 |
2 | Correct | 3881 ms | 24356 KB | Output is correct - maxh = 12 |