# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
677320 | Lobo | Genetics (BOI18_genetics) | C++17 | 263 ms | 91308 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;
const long long inf = (long long) 1e18 + 10;
const int inf1 = (int) 1e9 + 10;
// #define int long long
#define dbl long double
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()
const int maxn = 4140;
mt19937 rng(143243);
int ran(int a, int b) {
return a + rng()%(b-a+1);
}
int n, m, k, a[maxn][maxn], cntcol[maxn][5], cntper[maxn][5], sumcol[maxn][5], w[maxn];
string s[maxn];
void solve() {
cin >> n >> m >> k;
for(int i = 1; i <= n; i++) {
cin >> s[i];
w[i] = ran(5,inf1);
for(int j = 0; j < m; j++) {
if(s[i][j] == 'A') a[i][j] = 0;
if(s[i][j] == 'C') a[i][j] = 1;
if(s[i][j] == 'G') a[i][j] = 2;
# | 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... |