# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
456405 | nonsensenonsense1 | Genetics (BOI18_genetics) | C++17 | 1490 ms | 43040 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 <cstdio>
#include <algorithm>
#include <random>
#include <chrono>
std::mt19937 rng(std::chrono::steady_clock::now().time_since_epoch().count());
const int N = 4100;
const int K = 20;
unsigned long long a[N][(N - 1 >> 6) + 1][4];
int n, m, x, ord[N], mask[N], p[N], subset_size[K], in[K][N][4];
bool u[N][N], bad[N], inc[K][N];
int count_xor(unsigned long long (*a)[4], unsigned long long (*b)[4])
{
int s = 0;
for (int i = 0; i << 6 < m && s >> 1 <= x; ++i) {
s += __builtin_popcountll(a[i][0] ^ b[i][0]);
s += __builtin_popcountll(a[i][1] ^ b[i][1]);
s += __builtin_popcountll(a[i][2] ^ b[i][2]);
s += __builtin_popcountll(a[i][3] ^ b[i][3]);
}
return s >> 1;
}
void test(int p, int q)
{
if (u[p][q]) return;
u[p][q] = u[q][p] = true;
if (count_xor(a[p], a[q]) != x) bad[p] = bad[q] = 1;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |