Submission #1142067

#	Time	Username	Problem	Language	Result	Execution time	Memory
1142067		mouataz_moi	Mutating DNA (IOI21_dna)	C++20	0 / 100	20 ms	2376 KiB

dna

#include "dna.h"
#include<bits/stdc++.h>
using namespace std;
string a;
string b;
void init(string n, string m) {
    a = n;
    b = m;
}

int get_distance(int x, int y) {
    string a1;
    string b2;
    int t_c = 0;
    int a_c = 0;
    int a_t = 0;
	int ans = 0;
	int c_count = 0;
    int t_count = 0;
    int a_count = 0;
    int t_count2 = 0;
    int a_count2 = 0;
    int c_count2 = 0;
    a1 = a.substr(x,y-x+1);
    b2 = b.substr(x,y-x+1);
    for(int i = 0;i < a1.length();i++){
        if(a1[i] == 'T'){
            t_count++;
        }
        if(a1[i] == 'A'){
            a_count++;
        }
        if(b2[i] == 'T'){
            t_count2++;
        }
        if(b2[i] == 'A'){
            a_count2++;
        }
        if(a1[i] == 'C'){
            c_count++;
        }
        if(b2[i] == 'C'){
            c_count2++;
        }
        if(a1[i] == 'T' && b2[i] == 'C'){
            t_c++;
        }
        if(a1[i] == 'T' && b2[i] == 'A'){
            a_c++;
        }
        if(a1[i] == 'A' && b2[i] == 'C'){
            a_t++;
        }
    }
    if((t_count != t_count2) || (a_count != a_count2) || (c_count != c_count2)){
        return -1;
    }
    else{
        if(a_t % 2 == 0){
            a_t /= 2;
        }
        if(a_c % 2 == 0){
            a_c /= 2;
        }
        if(t_c % 2 == 0){
            t_c /= 2;
        }
        return a_c + a_t + t_c;
    }
}

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