제출 #788820

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
788820		samuelmaj2008	DNA 돌연변이 (IOI21_dna)	C++17	0 / 100	28 ms	10124 KiB

dna

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(a,b) for(int a = 0; a < (b); ++a)
#define pb push_back
#define all(t) t.begin(), t.end()

int n = 0;
const int max_N = 1e5+5;
int A[max_N];
int B[max_N];
int S[max_N][3][3];
int V[max_N][2][3];

void init(string a, string b)
{
    n = a.size();
    rep(i,n)
    {
        if (a[i] == 'A')
            A[i] = 0;
        else if (a[i] == 'T')
            A[i] = 1;
        else
            A[i] = 2;
    }
    rep(i,n)
    {
        if (b[i] == 'A')
            B[i] = 0;
        else if (b[i] == 'T')
            B[i] = 1;
        else
            B[i] = 2;
    }
    for (int i = 1; i < n; ++i)
    {
        if (i > 0) rep(j,3) rep(k,3) S[i][j][k] = S[i-1][j][k];
        ++S[i][A[i]][B[i]];
    }
    for (int i = 0; i < n; ++i)
    {
        if (i > 0) rep(j,2) rep(k,3) V[i][j][k] = V[i-1][j][k];
        ++V[i][0][A[i]], ++V[i][1][B[i]];
    }
}

inline int odl_S(int l, int p, int x1, int x2)
{
    if (l == 0) return S[p][x1][x2];
    return S[p][x1][x2] - S[l-1][x1][x2];
}

inline int odl_V(int l, int p, int idx, int val)
{
    if (l == 0) return V[p][idx][val];
    return V[p][idx][val] - V[l-1][idx][val];
}

int get_distance(int x, int y)
{
    if (odl_V(x,y,0,0) != odl_V(x,y,1,0) or odl_V(x,y,0,1) != odl_V(x,y,1,1) or odl_V(x,y,0,2) != odl_V(x,y,1,2))
        return -1;
    int wyn = y - x;
    rep(i,3)
        for (int j = i; j < 3; ++j)
            wyn -= min(odl_S(x,y,i,j),odl_S(x,y,i,j));
    return wyn;
}

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