# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
471661 | TheScrasse | Question (Grader is different from the original contest) (CEOI14_question_grader) | C++14 | 4537 ms | 24176 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;
#define nl "\n"
#define nf endl
#define ll long long
#define pb push_back
#define _ << ' ' <<
#define INF (ll)1e18
#define mod 998244353
#define maxn 110
vector<ll> v;
int encode(int n, int x, int y) {
ll i, mk;
if (v.empty()) {
v.pb(0);
for (mk = 0; mk < (1 << 12); mk++) {
if (__builtin_popcount(mk) != 6) continue;
v.pb(mk);
}
}
for (i = 0; i < 12; i++) {
if (((v[x] >> i) & 1) == 0) continue;
if (((v[y] >> i) & 1) == 1) continue;
return i + 1;
}
}
#include <bits/stdc++.h>
using namespace std;
#define nl "\n"
#define nf endl
#define ll long long
#define pb push_back
#define _ << ' ' <<
#define INF (ll)1e18
#define mod 998244353
#define maxn 110
vector<ll> w;
int decode(int n, int q, int h) {
ll i, mk;
if (w.empty()) {
w.pb(0);
for (mk = 0; mk < (1 << 12); mk++) {
if (__builtin_popcount(mk) != 6) continue;
w.pb(mk);
}
}
return ((w[q] >> (h - 1)) & 1);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |