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 <vector>
#include <string>
using namespace std;
vector<int> dp;
void init(string a, string b) {
int n = a.length();
dp.resize(n, 0);
for (int i = 0; i < n; i++) {
if (a[i] != b[i]) {
dp[i] = 1;
}
if (i > 0) {
dp[i] += dp[i - 1];
}
}
}
int get_distance(int x, int y) {
int result = dp[y] - (x > 0 ? dp[x - 1] : 0);
return result;
}
# | 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... |