# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
712611 | danikoynov | Mutating DNA (IOI21_dna) | C++17 | 1559 ms | 4808 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"
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
string s, t;
int pref[2][3][maxn];
map < char, int > rev;
void init(std::string a, std::string b)
{
s = a;
t = b;
rev['A'] = 0;
rev['C'] = 1;
rev['T'] = 2;
for (int i = 0; i < a.size(); i ++)
{
if (i != 0)
{
for (int p = 0; p < 3; p ++)
for (int k = 0; k < 2; k ++)
pref[k][p][i] = pref[k][p][i - 1];
}
pref[0][rev[a[i]]][i] ++;
pref[1][rev[b[i]]][i] ++;
}
}
int get_distance(int x, int y)
{
string s1 = s.substr(x, y - x + 1);
string t1 = t.substr(x, y - x + 1);
int df[2][3];
for (int p = 0; p < 3; p ++)
{
df[0][p] = pref[0][p][y];
df[1][p] = pref[1][p][y];
}
if (x != 0)
{
for (int p = 0; p < 3; p ++)
{
df[0][p] -= pref[0][p][x - 1];
df[1][p] -= pref[1][p][x - 1];
}
}
for (int p = 0; p < 3; p ++)
if (df[0][p] != df[1][p])
return -1;
int ans = 0;
for (int i = 0; i < t1.size(); i ++)
{
if (s1[i] == t1[i])
continue;
bool done = false;
for (int j = i; j < t1.size(); j ++)
{
if (s1[j] == t1[i] && t1[j] == s1[i])
{
swap(s1[j], s1[i]);
ans ++;
done = true;
break;
}
}
if (!done)
{
for (int j = i; j < t1.size(); j ++)
{
if (s1[j] == t1[i] && s1[j] != t1[j])
{
swap(s1[j], s1[i]);
ans ++;
done = true;
break;
}
}
}
///cout << i << " : " << j << endl;
}
return ans;
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |