Submission #952243

#	Time	Username	Problem	Language	Result	Execution time	Memory
952243		wood	Mutating DNA (IOI21_dna)	C++17	0 / 100	25 ms	3604 KiB

dna

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> 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<int> pref_b;
vector<int> pref_a;

vector<int> matchpref;
void init(string a, string b) {
    int n = a.size();
    pref_a.resize(n);
    pref_b.resize(n);
    matchpref.resize(n);
    for (size_t i = 0; i < a.size(); i++) {
        pref_a[i + 1] = pref_a[i] + (a[i] == 1);
        pref_b[i + 1] = pref_b[i] + (b[i] == 1);
        matchpref[i + 1] = (a[i] == 1) && (b[i] == 1);
    }
}

int get_distance(int x, int y) {
    if (pref_a[y + 1] - pref_a[x] - pref_b[y + 2] - pref_b[x]) {
        return -1;
    }
    else return (pref_a[y + 1] - pref_a[x] - matchpref[y + 1] + matchpref[x]);
}

• Subtask 1: 0 / 21
• Subtask 2: 0 / 22
• Subtask 3: 0 / 13
• Subtask 4: 0 / 28
• Subtask 5: 0 / 16