| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1311545 | jahirsha101 | Mutating DNA (IOI21_dna) | C++20 | 1594 ms | 2372 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 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... | ||||
