#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
typedef long long LL;
vector<LL> V;
int encode(int n, int x, int y) {
if (V.empty()) for (int i=1; i<(1<<12); i++) if (__builtin_popcount(i)==6) V.push_back(i);
for (int i=1; i<=12; i++) if ((V[x]&(1ll<<(i-1))) && !(V[y]&(1ll<<(i-1)))) return i;
return 1;
}
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
typedef long long LL;
vector<LL> V;
int decode(int n, int q, int h) {
if (V.empty()) for (int i=1; i<(1<<12); i++) if (__builtin_popcount(i)==6) V.push_back(i);
if (V[q] & (1<<(h-1))) return 1;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1589 ms |
79600 KB |
Output is correct - maxh = 12 |
2 |
Correct |
1589 ms |
79608 KB |
Output is correct - maxh = 12 |