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 = 1e6 + 10;
int n, ps[MAXN], c1[MAXN];
void init(string a, string b) {
n = a.size();
a = '#' + a;
b = '#' + b;
for (int i = 1; i <= n; i++) {
ps[i] = ps[i - 1] + (a[i] != b[i]);
c1[i] = c1[i - 1] + (a[i] == 'A') - (b[i] == 'A');
}
}
int get_distance(int x, int y) {
x++;
y++;
if (c1[y] - c1[x - 1]) return -1;
return (ps[y] - ps[x - 1]) / 2;
}
# | 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... |