#include<bits/stdc++.h>
using namespace std;
int encode (int n, int x, int y) {
int z = (x^y);
for (int i = 0; i < 31; i++) {
if (z&(1<<i)) {
if (x&(1<<i)) return (i+1);
else return (i+1)+10;
}
} return 1;
}
#include<bits/stdc++.h>
using namespace std;
int decode (int n, int q, int i) {
if (i <= 10) {
i--;
if (q&(1<<i)) return 1;
else return 0;
} else {
i -= 10;
i--;
if (q&(1<<i)) return 0;
else return 1;
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Partially correct |
3044 ms |
24192 KB |
Output is partially correct - maxh = 20 |
2 |
Partially correct |
3005 ms |
24296 KB |
Output is partially correct - maxh = 20 |