# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
66598 | Bruteforceman | Genetics (BOI18_genetics) | C++11 | 1621 ms | 9976 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;
bitset <4105> P[4][4105];
char s[4105];
int cnt[4][4105];
int main(int argc, char const *argv[])
{
int n, m, k;
scanf("%d %d %d", &n, &m, &k);
for(int i = 0; i < n; i++) {
scanf("%s", s);
for(int j = 0; j < m; j++) {
if(s[j] == 'A') {
P[0][i][j] = 1;
++cnt[0][j];
}
else if (s[j] == 'C') {
P[1][i][j] = 1;
++cnt[1][j];
} else if (s[j] == 'T') {
P[2][i][j] = 1;
++cnt[2][j];
} else {
P[3][i][j] = 1;
++cnt[3][j];
}
}
}
vector <int> v;
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... |