# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1090351 | andrei_iorgulescu | Genetics (BOI18_genetics) | C++14 | 2015 ms | 31056 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;
mt19937 rng(8962);
int n, m, k;
char a[4105][4105];
bitset<4105> bs[4105];
bool mna(int x, int y)
{
if (n <= 100)
{
int df = 0;
for (int i = 1; i <= m; i++)
if (a[x][i] != a[y][i])
df++;
if (df == k)
return true;
return false;
}
else
{
if ((bs[x] ^ bs[y]).count() == k)
return true;
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... |