| # | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 952324 | 2024-03-23T14:24:26 Z | wood | Mutating DNA (IOI21_dna) | C++17 | 0 ms | 0 KB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p32;
typedef pair<ll, ll> p64;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define MOD %1000000007
vector<ll> pref_b;
vector<ll> pref_a;
vector<ll> matchpref;
void init(string a, string b) {
ll n = a.size();
pref_a.resize(n+1);
pref_b.resize(n+1);
matchpref.resize(n+1);
for (size_t i = 0; i < a.size(); i++) {
pref_a[i + 1] = pref_a[i] + (a[i] == 'A');
pref_b[i + 1] = pref_b[i] + (b[i] == 'A');
matchpref[i + 1] = matchpref[i]+(a[i] == 'A') && (b[i] == 'A');
}
}
ll get_distance(ll x, ll y) {
if (pref_a[y + 1] - pref_a[x] - pref_b[y + 1] - pref_b[x]) {
return -1;
}
else return (pref_a[y + 1] - pref_a[x] - matchpref[y + 1] + matchpref[x]);
}