| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 729461 | vjudge1 | Mutating DNA (IOI21_dna) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "dna.h"
#include<bits/stdc++.h>
#define eb emplace_back
const int up=1e5+1;
int cnt[3][up],dp[3][3][up];
void init(std::string a,std::string b) {
std::map<char,int>M{{'A',0},{'B',1},{'C',2}};
a=' '+a;
b=' '+b;
for(int i=1;i<a.size();++i){
for(int j=0;j<3;++j){
cnt[j][i]=cnt[j][i-1];
}
cnt[M[a[i]]][i]++;
cnt[M[b[i]]][i]--;
for(int j=0;j<3;++j){
for(int k=0;k<3;++k){
dp[j][k][i]=dp[j][k][i-1];
}
}
dp[M[a[i]]][M[b[i]]][i]++;
}
}
int get_distance(int x,int y){
x++;
y++;
for(int i=0;i<3;++i){
if(cnt[i][y]^cnt[i][x-1]) return -1;
}
int c[3][3];
for(int i=0;i<3;++i){
for(int j=0;j<3;++j){
c[i][j]=dp[i][j][y]-dp[i][j][x-1];
}
}
int ans=min(c[1][0],c[0][1])+min(c[1][2],c[2][1])+min(c[0][2],c[2][0]);
return ans+2*abs(c[0][2]-c[2][0]);
}
