제출 #1241341

#제출 시각아이디문제언어결과실행 시간메모리
1241341Younis_DwaiMutating DNA (IOI21_dna)C++20
0 / 100
12 ms2868 KiB
#include "dna.h"
#include<bits/stdc++.h>
#define in insert
#define pb push_back
using namespace std;
const int N=1e5+5;
int n,B[N],C[N];

void init(std::string a, std::string b) {
     n=a.size();
     for(int i=1;i<=n;i++){
            if(a[i-1]=='A') B[i]=1;
            else if(a[i-1]=='C') B[i]=2;
            else B[i]=3;
     }
     for(int i=1;i<=n;i++){
            if(b[i-1]=='A') C[i]=1;
            else if(b[i-1]=='C') C[i]=2;
            else C[i]=3;
     }
     return ;
}

int get_distance(int x, int y){
    ++x;++y;
    vector<int> v[2][3];
    int ret=0;
    for(int i=x;i<=y;i++){
        v[0][B[i]].pb(i);
        v[1][C[i]].pb(i);
    }
    if(v[0][1].size()!=v[1][1].size()) return -1;
        for(int i=0;i<v[0][1].size();i++){
            ret+=abs(v[0][1][i]-v[1][1][i]);
    }
	return ret;
}
#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...