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 mxN = 100005;
int pref[mxN], pref1[mxN], pref2[mxN];
void init(string a, string b) {
int n = int(a.length());
for(int i = 0; i < n; i++) {
if(a[i] != b[i])
pref[i+1] = 1+pref[i];
if(a[i] == 'A')
pref1[i+1] = 1+pref1[i];
if(b[i] == 'A')
pref2[i+1] = 1+pref2[i];
}
}
int get_distance(int x, int y) {
y++;
if(pref2[y]-pref2[x] != pref1[y]-pref1[x])
return -1;
return pref[y]-pref[x];
}
# | 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... |