# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
500579 | LittleCube | Genetics (BOI18_genetics) | C++14 | 492 ms | 168144 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>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define F first
#define S second
using namespace std;
const ll MOD = 1e9 + 7;
ll N, M, K;
string s[4105];
ll arr[4105][4105], w[4105], cnt[4105][5];
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
signed main()
{
ios::sync_with_stdio(0), cin.tie(0);
cin >> N >> M >> K;
for (int i = 1; i <= N; i++)
cin >> s[i];
for (int i = 1; i <= N; i++)
for (int j = 0; j < M; j++)
if (s[i][j] == 'A')
arr[i][j + 1] = 1;
else if (s[i][j] == 'T')
arr[i][j + 1] = 2;
else if (s[i][j] == 'C')
arr[i][j + 1] = 3;
else if (s[i][j] == 'G')
arr[i][j + 1] = 4;
for (int i = 1; i <= N; i++)
# | 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... |