Submission #1311545

#TimeUsernameProblemLanguageResultExecution timeMemory
1311545jahirsha101Mutating DNA (IOI21_dna)C++20
43 / 100
1594 ms2372 KiB
#include <bits/stdc++.h>
using namespace std;

int n,q;
string A,B;

void init(string a,string b) {
    n=(int)a.size();
	A=::move(a);
	B=::move(b);
	
}

int get_distance(int x, int y){
    int s=0;
    for(int i=x;i<=y;i++){
		if(A[i]!=B[i]) s++;
	}
	string subA = A.substr(x, y - x + 1);
    string subB = B.substr(x, y - x + 1);
    sort(subA.begin(), subA.end());
    sort(subB.begin(), subB.end());
    if (subA != subB) return -1;
	if(s==3) return 2;
    return s/2;
}
#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...