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);
ll ans = 0;
vector <int> p;
for (int i = 0; i < y - x + 1; i++) {
if (b[i] == 'A' && a[i] != 'A')
p.push_back(i);
}
int pt = 0;
for (int j = 0; j < y - x + 1; j++) {
if (a[j] == 'A' && b[j] != 'A') {
ans += abs(p[pt] - j);
pt++;
}
}
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... |