제출 #1253000

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1253000		antonn	DNA 돌연변이 (IOI21_dna)	C++20	56 / 100	21 ms	5380 KiB

dna

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

template<typename T>
bool assign_min(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template<typename T>
bool assign_max(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

vector<int> prefAA, prefAT, prefAC;
vector<int> prefBA, prefBT, prefBC;
vector<int> pref;

void init(string a, string b) {
    int n = a.size();
    prefAA.resize(n + 1);
    prefAT.resize(n + 1);
    prefAC.resize(n + 1);
    for (int i = 1; i <= a.size(); i++) {
        prefAA[i] = prefAA[i - 1] + (a[i - 1] == 'A');
        prefAT[i] = prefAT[i - 1] + (a[i - 1] == 'T');
        prefAC[i] = prefAC[i - 1] + (a[i - 1] == 'C');
    }
    prefBA.resize(n + 1);
    prefBT.resize(n + 1);
    prefBC.resize(n + 1);
    for (int i = 1; i <= b.size(); i++) {
        prefBA[i] = prefBA[i - 1] + (b[i - 1] == 'A');
        prefBT[i] = prefBT[i - 1] + (b[i - 1] == 'T');
        prefBC[i] = prefBC[i - 1] + (b[i - 1] == 'C');
    }
    pref.resize(n + 1);
    for (int i = 1; i <= n; i++) {
        pref[i] = pref[i - 1] + (a[i - 1] != b[i - 1]);
    }
}

int get_distance(int x, int y) {
    x++;
    y++;
    if (prefAA[y] - prefAA[x - 1] != prefBA[y] - prefBA[x - 1]) {
        return -1;
    }
    if (prefAT[y] - prefAT[x - 1] != prefBT[y] - prefBT[x - 1]) {
        return -1;
    }
    if (prefAC[y] - prefAC[x - 1] != prefBC[y] - prefBC[x - 1]) {
        return -1;
    }
    return (pref[y] - pref[x - 1] + 1) / 2;
}

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