# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
564968 | shrimb | Question (Grader is different from the original contest) (CEOI14_question_grader) | C++17 | 0 ms | 420 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include"bits/stdc++.h"
using namespace std;
int init = 0;
int g[942];
void __init__ () {
for (int i = 0, j = 0 ; ; i++) {
if (__builtin_popcount(i) == 6) {
g[j++] = i;
if (j == 942) break;
}
}
}
int encode (int n, int x, int y) {
if (!init) {
__init__();
}
for (int i = 0 ; i < 12 ; i++) {
if (g[x] & (1 << i) and !(g[y] & (1 << i))) return i;
}
}
#include"bits/stdc++.h"
using namespace std;
int init = 0;
int g[942];
void __init__ () {
for (int i = 0, j = 0 ; ; i++) {
if (__builtin_popcount(i) == 6) {
g[j++] = i;
if (j == 942) break;
}
}
}
int decode (int n, int q, int h) {
if (!init) {
__init__();
}
return bool(g[q] & (1 << h));
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |