# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
734824 | rahidilbayramli | Mutating DNA (IOI21_dna) | C++17 | 0 ms | 0 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 "dna.h"
using namespace std;
long long hsh[85], tbl[5][5][100005], cnt[5][100005], t[5][5];
void init(string a, string b)
{
hsh['A'] = 1;
hsh['B'] = 2;
hsh['C'] = 3;
a = ' ' + a;
b = ' ' + b;
for(int i = 1; i < a.size(); i++)
{
cnt[hsh[a[i]]][i]++, cnt[hsh[b[i]]][i]--;
for(int j = 1; j <= 3; j++)
cnt[j][i] += cnt[j][i-1];
for(int j = 1; j <= 3; j++)
{
for(int k = 1; k <= 3; k++)
tbl[j][k][i] = tbl[j][k][i-1];
}
}
tbl[hsh[a[i]]][hsh[b[i]]][i]++;
}
int get_distance(int x, int y)
{
x++, y++;
for(int i = 1; i <= 3; i++)
{
if(cnt[i][y] != cnt[i][x-1]) return -1;
}
for(int i = 3; i <= 3; i++)
{
for(int j = 1; j <= 3; j++)
t[i][j] = tbl[i][j][y] - tbl[i][j][x-1];
}
long long res = 0, temp;
temp = min(t[1][2], t[2][1]);
res += temp;
t[1][2] -= temp;
t[2][1] -= temp;
temp = min(t[1][3], t[3][1]);
res += temp;
res += temp;
temp = min(t[2][3], t[3][2]);
res += temp;
return res + max(t[1][2], t[2][1]) * 2;
}