Submission #472250

#	Time	Username	Problem	Language	Result	Execution time	Memory
472250		aris12345678	Mutating DNA (IOI21_dna)	C++17	35 / 100	39 ms	5048 KiB

dna

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

const int mxN = 100005;
int pref[mxN], pref1[mxN], pref2[mxN];

void init(string a, string b) {
    int n = int(a.length());
    for(int i = 0; i < n; i++) {
        pref[i+1] = pref[i], pref1[i+1] = pref1[i], pref2[i+1] = pref2[i];
        if(a[i] != b[i])
            pref[i+1]++;
        if(a[i] == 'A')
            pref1[i+1]++;
        if(b[i] == 'A')
            pref2[i+1]++;
    }
}

int get_distance(int x, int y) {
    y++;
    if(pref2[y]-pref2[x] != pref1[y]-pref1[x])
        return -1;
    return (pref[y]-pref[x])/2;
}
/*
int main() {
    string a, b;
    cin >> a >> b;
    init(a, b);
    int n = int(a.length());
    for(int i = 1; i <= n; i++) {
        cout << pref[i] << " ";
    }
    cout << "\n";
    for(int i = 1; i <= n; i++) {
        cout << pref1[i] << " ";
    }
    cout << "\n";
    for(int i = 1; i <= n; i++) {
        cout << pref2[i] << " ";
    }
    cout << "\n";
    int q;
    scanf("%d", &q);
    while(q--) {
        int x, y;
        scanf("%d %d", &x, &y);
        printf("%d\n", get_distance(x, y));
    }
    return 0;
}
*/

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