Submission #838081

#	Time	Username	Problem	Language	Result	Execution time	Memory
838081		jasmin	Mutating DNA (IOI21_dna)	C++17	0 / 100	23 ms	6284 KiB

dna

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

const int N=1e5+5;
int cnta[N][3];
int cntb[N][3];

int ps[N];

void init(string a, string b){
    int n=a.size();
    vector<int> enc = {'A', 'C', 'T'};

    for(int i=0; i<n; i++){
        
        for(int j=0; j<3; j++){

            cnta[i+1][j] = cnta[i][j-1];
            cntb[i+1][j] = cntb[i][j-1];

            if(a[i] == enc[j]){
                cnta[i+1][j]++;
            }
            if(b[i] == enc[j]){
                cntb[i+1][j]++;
            }
        }
    }

    for(int i=0; i<n; i++){

        ps[i+1] = ps[i] + (a[i]!=b[i]);
    }
}

int get_distance(int x, int y){

    for(int j=0; j<3; j++){

        if(cnta[y+1][j]-cnta[x][j] != cntb[y+1][j]-cntb[x][j]){
            return -1;
        }
    }

    int ans = (ps[y+1] - ps[x] + 1)/2;
    return ans;
}

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