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 N=1e5+10;
int prea[N],preb[N],pre[N];
void init(std::string a, std::string b) {
int n=a.size();
prea[0]=(a[0]=='A'),preb[0]=(b[0]=='A');
for(int i=1;i<n;i++) prea[i]=prea[i-1]+(a[i]=='A'),preb[i]=preb[i-1]+(b[i]=='A');
pre[0]=(a[0]!=b[0]);
for(int i=1;i<n;i++) pre[i]=pre[i-1]+(a[i]!=b[i]);
/*for(int i=0;i<n;i++) cout<<pre[i] <<" ";
cout<<'\n';*/
}
int get_distance(int x, int y) {
if(prea[y]-(x-1>=0?prea[x-1]:0)==preb[y]-(x-1>=0?preb[x-1]:0)) return (pre[y]-(x-1>=0?pre[x-1]:0))/2;
return -1;
}
# | 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... |