| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1360956 | cpismayilmmdv985 | Mutating DNA (IOI21_dna) | C++20 | 15 ms | 2604 KiB |
#include "dna.h"
#include "bits/stdc++.h"
using namespace std;
string A, B;
int N;
void init(string a, string b) {
A = a, B = b, N = (int)A.length();
}
int get_distance(int l, int r) {
l--, r--;
string sorta = A.substr(l, r - l + 1), sortb = B.substr(l, r - l + 1);
sort(sorta.begin(), sorta.end()), sort(sortb.begin(), sortb.end());
if (sorta != sortb) return -1;
int cnt = 0;
for (int i = l; i <= r; i++) cnt += (A[i] != B[i]);
return (cnt >> 1) + (cnt % 2);
}
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
