제출 #1240993

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1240993		gkos5678	Mutating DNA (IOI21_dna)	C++20	100 / 100	25 ms	8356 KiB

dna

#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define X first
#define Y second

const int maxn = 1e5 + 5;

int n;
int pf[3][3][maxn], pa[3][maxn], pb[3][maxn], ar[3][3], kk[2][3];

int f(char c){
    if (c == 'A') return 0;
    if (c == 'C') return 1;
    return 2;
}

void init(string a, string b){
    n = a.size();
    a = '$' + a;
    b = '$' + b;
    for (int i = 0; i < 3; i++){
        for (int j = 0; j < 3; j++)
            pf[i][j][0] = 0;
        pa[i][0] = 0;
        pb[i][0] = 0;
    }
    for (int i = 1; i <= n; i++){
        for (int j = 0; j < 3; j++){
            pa[j][i] = pa[j][i - 1];
            pb[j][i] = pb[j][i - 1];
            for (int k = 0; k < 3; k++){
                pf[j][k][i] = pf[j][k][i - 1];
            }
        }

        int c1 = f(a[i]), c2 = f(b[i]);
        pf[c1][c2][i]++;
        pa[c1][i]++;
        pb[c2][i]++;
    }
}

int get_distance(int x, int y){
    x++, y++;
    int sm = 0;
    for (int j = 0; j < 3; j++){
        for (int k = 0; k < 3; k++){
            if (j == k) continue;
            ar[j][k] = pf[j][k][y] - pf[j][k][x - 1];
            sm += ar[j][k];
        }
    }
    for (int i = 0; i < 3; i++)
        if (pa[i][y] - pa[i][x - 1] != pb[i][y] - pb[i][x - 1]) return -1;

    int ret = 0;
    for (int j = 0; j < 2; j++){
        for (int k = j + 1; k < 3; k++){
            int mn = min(ar[j][k], ar[k][j]);
            ar[j][k] -= mn;
            ar[k][j] -= mn;
            ret += mn;
            sm -= 2 * mn;
        }
    }

    ret += sm * 2 / 3;

    return ret;
}

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