# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
262468 | sckmd | Genetics (BOI18_genetics) | C++14 | 1552 ms | 91232 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 MAXN 4101
int decode[678];
int a[MAXN][MAXN];
int howm[4][MAXN];
bitset <MAXN> b0[MAXN];
bitset <MAXN> b1[MAXN];
bitset <MAXN> b2[MAXN];
bitset <MAXN> b3[MAXN];
int n,m,k;
vector <int> z;
bool check(int idx)
{
z.clear();
for(int j = 0; j < n; j++)z.push_back(j);
random_shuffle(z.begin(),z.end());
for(auto id:z)
{
if(id==idx)continue;
int r = 0;
r += (b0[idx]^b0[id]).count();
r += (b1[idx]^b1[id]).count();
r += (b2[idx]^b2[id]).count();
r += (b3[idx]^b3[id]).count();
if(r != 2*k)return false;
}
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... |