제출 #1142655

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1142655		jadmeziani2	Mutating DNA (IOI21_dna)	C++20	0 / 100	19 ms	2348 KiB

dna

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

void init(std::string a, std::string b) {
    e=a;
    d=b;
}

int get_distance(int x, int y) {
    int count =0;

    int min =y-x;
    int submit;
    int count_a=0,count_b=0,count_c=0;
    for(int i=x;i<y+1;i++){
        if(e[i] == 'A'){
            count_a+=1;
        }
        else if(e[i] == 'C'){
            count_b+=1;

        }
        else if(e[i] == 'T'){
            count_c+=1;
        }
        
        if(d[i] == 'A'){
            count_a--;

        }
        else if(d[i] == 'C'){
            count_b= count_b-1;
        }
        else if(d[i] == 'T'){
            count_c=count_c-1;
        }
    }
    if(count_a !=0 || count_b !=0 || count_c !=0 ){
        return -1;
    }
    if(y-x+1 %2==0){
        count=(y-x+1)/2;
    }
    else{
        count=(y-x+1+1)/2;
    }
    return count;
}

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