제출 #609164

#제출 시각아이디문제언어결과실행 시간메모리
609164lorenzoferrariDNA 돌연변이 (IOI21_dna)C++17
100 / 100
52 ms7244 KiB
#include "dna.h"
#include <bits/stdc++.h>
using namespace std;

using mat = array<array<int, 3>, 3>;

const string alfa = "ATC";

int n;
vector<mat> prf;

void init(string a, string b) {
    n = a.size();
    prf.resize(n+1);
    for (int i = 0; i < n; ++i) {
        prf[i+1] = prf[i];
        int ca = alfa.find(a[i]);
        int cb = alfa.find(b[i]);
        ++prf[i+1][ca][cb];
    }
}

int get_distance(int x, int y) {
    mat m;
    array<int, 3> sum_row{};
    array<int, 3> sum_col{};
    for (int i = 0; i < 3; ++i) for (int j = 0; j < 3; ++j) {
        m[i][j] = prf[y+1][i][j] - prf[x][i][j];
        sum_row[i] += m[i][j];
        sum_col[j] += m[i][j];
    }
    if (sum_row != sum_col) return -1;
    int ans = 0;
    for (int i = 0; i < 3; ++i) for (int j = 0; j < 3; ++j) {
        if (i == j) continue;
        int v = min(m[i][j], m[j][i]);
        ans += v;
        m[i][j] -= v;
        m[j][i] -= v;
    }
    ans += 2 * m[0][1];
    ans += 2 * m[1][0];
    return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...