| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1363574 | yavor_ptv | Mutating DNA (IOI21_dna) | C++20 | 12 ms | 2860 KiB |
// SUBTASK 1 -> 3
#include <bits/stdc++.h>
#include "dna.h"
//#include "grader.cpp"
using namespace std;
string a, b;
vector <int> pref;
void init(string A, string B)
{
a = A;
b = B;
int n = a.size();
pref.clear();
pref.resize(n);
for (int i = 0; i < n; i++)
{
if (a[i] != b[i])
{
pref[i] = i > 0 ? pref[i - 1] + 1 : 1;
}
else pref[i] = i > 0 ? pref[i - 1] : 0;
}
}
int get_distance(int x, int y)
{
int br = x > 0 ? pref[y] - pref[x - 1] : pref[y];
return br % 2 == 0 ? br / 2 : -1;
}
/*
6 3
ATACAT
ACTATA
1 3
4 5
3 5
2
1
-1
*/
| # | 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... | ||||
