# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
162811 | faremy | Genetics (BOI18_genetics) | C++14 | 2112 ms | 668156 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 <iostream>
#include <algorithm>
#include <cstdlib>
const int MAXN = 4100;
const int MAXT = 16400;
long long dna[MAXN][MAXT];
long long unify[MAXN][MAXN];
long long randomVector[MAXN];
long long randDna[MAXT];
long long randDiff[MAXN];
long long randUnify[MAXN];
int search(int sequences, int size)
{
for (int iSeq = 0; iSeq < sequences; iSeq++)
randomVector[iSeq] = rand() * rand() * rand() * rand();
for (int iChar = 0; iChar < size; iChar++)
{
randDna[iChar] = 0;
for (int iSeq = 0; iSeq < sequences; iSeq++)
randDna[iChar] = randDna[iChar] + dna[iSeq][iChar] * randomVector[iSeq];
}
for (int iSeq = 0; iSeq < sequences; iSeq++)
# | 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... |