Submission #768565

#TimeUsernameProblemLanguageResultExecution timeMemory
768565TrumlingMutating DNA (IOI21_dna)C++17
0 / 100
21 ms2548 KiB
#include <vector>
#include <string>
using namespace std;

vector<int> mutationCount;

void init(string a, string b) {
    int n = a.length();
    mutationCount.resize(n + 1, 0);

    for (int i = 0; i < n; i++) {
        mutationCount[i + 1] = mutationCount[i] + (a[i] != b[i]);
    }
}

int get_distance(int x, int y) {
    int mutationInRange = mutationCount[y + 1] - mutationCount[x];
    int substringLength = y - x + 1;

    if (mutationInRange == 0 || mutationInRange == substringLength) {
        return mutationInRange / 2;
    } else {
        return -1;
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...