제출 #1194081

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

dna

#include <iostream>
using namespace std;

int sp[100001][3][3];

void init(string a, string b){
    char aux[]={'A','C','T'};
    int i,j,k;
    for(i=0;i<a.size();i++){
        for(j=0;j<3;j++){
            for(k=0;k<3;k++){
                sp[i+1][j][k]=sp[i-1][j][k];
                if(a[i]==aux[j] && b[i]==aux[k]) sp[i+1][j][k]++;
            }
        }
    }
}

int get_distance(int x,int y){
    int perechi=0,triplete=0,i,j,sum1,sum2;
    for(i=0;i<3;i++){
        j=(i+1)%3;
        sum1=sp[y+1][i][j]-sp[x][i][j];sum2=sp[y+1][j][i]-sp[x][j][i];
        if(!i) triplete=abs(sum1-sum2);
        else if(abs(sum1-sum2)!=triplete) return -1;
        perechi+=min(sum1,sum2);
    }
    return perechi+triplete*2;
}

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