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;
using ll = long long;
string A, B;
void init(std::string a, std::string b) {
A = a;
B = b;
}
int get_distance(int x, int y) {
string a = A.substr(x, y - x + 1);
string b = B.substr(x, y - x + 1);
sort(a.begin(), a.end());
sort(b.begin(), b.end());
if (a != b)
return -1;
a = A.substr(x, y - x + 1);
b = B.substr(x, y - x + 1);
vector <int> ord = {0, 0, 1, 1, 2, 2};
int ans = 1e9;
do {
int tp = 0;
string tpb = b;
for (int i = 0; i+1 < 3; i++) {
if (a == b)
break;
swap(tpb[ord[i]], tpb[ord[i+1]]);
tp++;
}
if (a == tpb)
ans = min(ans, tp);
} while (next_permutation(ord.begin(), ord.end()));
return ans;
}
# | 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... |