# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1097854 | TheSahib | Genetics (BOI18_genetics) | C++14 | 676 ms | 40020 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 int ll
#define pii pair<int, int>
#define all(v) v.begin(), v.end()
using namespace std;
const long long oo = 1e18;
const int MAX = 1e5 + 5;
const int BASE1 = 91, BASE2 = 101, MOD = 1e9 + 7;
int pw1[MAX], pw2[MAX];
int n, m, k;
vector<string> arr;
map<char, int> mp = {{'A', 'A'}, {'C', 'B'}, {'G', 'C'}, {'T', 'D'}};
pair<int, int> S[MAX][4];
void solve(){
cin >> n >> m >> k;
arr.resize(n);
for (int i = 0; i < n; i++)
{
cin >> arr[i];
for(char& c:arr[i]){
c = mp[c];
}
}
for(int j = 0; j < m; ++j){
for(int i = 0; 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... |