# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
26691 | 2017-07-05T02:56:03 Z | sgc109 | Question (Grader is different from the original contest) (CEOI14_question_grader) | C++11 | 1791 ms | 25672 KB |
int encode (int n, int x, int y) { int ok = 0; int pos = -1; int sum1 = 0, sum2 = 0; for(int i = 0 ; i < 10; i++){ int a = (x & (1<<i)) != 0; int b = (y & (1<<i)) != 0; sum1 += a; sum2 += b; if(a > b){ ok = 1; pos = i; break; } } if(pos != -1) return pos+1; for(int i = 0 ; i < 4; i++){ int a = (sum1 & (1<<i)) != 0; int b = (sum2 & (1<<i)) != 0; if(a < b) { pos = i; break; } } return 10 + pos + 1; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Partially correct | 1791 ms | 25672 KB | Output is partially correct - maxh = 14 |
2 | Partially correct | 1706 ms | 25672 KB | Output is partially correct - maxh = 14 |