# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
163031 | kuroni | Genetics (BOI18_genetics) | C++17 | 937 ms | 288096 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;
const int M = 4105, N = 4105;
int m, n, x, sum[M][N][4];
char s[M][N];
vector<int> ve;
random_device rd;
mt19937_64 mt(rd());
int convert(char c) {
switch (c) {
case 'A': return 0;
case 'T': return 1;
case 'G': return 2;
case 'C': return 3;
default: return 0;
}
}
bool check(int ind, int pos) {
int cnt = (pos - (ind <= pos)) * x;
for (int i = 1; i <= n; i++) {
cnt -= sum[pos][i][convert(s[ind][i])];
}
return cnt == 0;
}
int main() {
# | 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... |