# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
979899 | vjudge1 | Genetics (BOI18_genetics) | C++17 | 7 ms | 600 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;
using ll = long long;
const int maxN = 123;
char id[256];
int N, M, K;
int A[maxN][maxN];
int main() {
id['A'] = 0; id['C'] = 1; id['G'] = 2; id['T'] = 3;
scanf("%d %d %d", &N, &M, &K);
char buf;
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= M; j++) {
scanf(" %c", &buf);
A[i][j] = id[buf];
}
}
for (int r = 1; r <= N; r++) {
bool valid = true;
for (int i = 1; i <= N; i++) if (i != r) {
int diff = 0;
for (int c = 1; c <= M; c++) {
if (A[r][c] != A[i][c]) diff++;
}
if (diff != K) {
valid = false;
break;
}
}
if (valid) {
printf("%d\n", r);
exit(0);
}
}
}
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... |