# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
788832 | samuelmaj2008 | Mutating DNA (IOI21_dna) | C++17 | 27 ms | 8724 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;
typedef long long ll;
#define rep(a,b) for(int a = 0; a < (b); ++a)
#define pb push_back
#define all(t) t.begin(), t.end()
int n = 0;
const int max_N = 1e5+5;
int A[max_N];
int B[max_N];
int S[max_N][3][3];
int V[max_N][2][3];
void init(string a, string b)
{
n = a.size();
rep(i,n)
{
if (a[i] == 'A')
A[i] = 0;
else if (a[i] == 'T')
A[i] = 1;
else
A[i] = 2;
}
rep(i,n)
{
if (b[i] == 'A')
B[i] = 0;
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |