# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
646292 | mychecksedad | Genetics (BOI18_genetics) | C++17 | 1037 ms | 67388 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.
/* Author : Mychecksdead */
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define PI 3.1415926535
#define pb push_back
#define setp() cout << setprecision(15)
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " is " << x << '\n';
const int N = 1e6+100, M = 1e5+10, F = 2147483646, K = 20;
int n, m, k, c[N], combined_sum = 0, d[N][4];
string s[N];
void solve(){
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
cin >> n >> m >> k;
for(int i = 0; i < n; ++i){
cin >> s[i];
for(int j = 0; j < m; ++j){
if(s[i][j] == 'A') s[i][j] = '0';
if(s[i][j] == 'G') s[i][j] = '1';
if(s[i][j] == 'T') s[i][j] = '2';
if(s[i][j] == 'C') s[i][j] = '3';
}
}
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... |