Submission #831933

#	Time	Username	Problem	Language	Result	Execution time	Memory
831933		JoksimKaktus	Mutating DNA (IOI21_dna)	C++17	22 / 100	1575 ms	3788 KiB

dna

#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <algorithm>
#include <iomanip>
#include <set>
#include "dna.h"
#include <cstdio>
#include <cassert>
#include <string>

using namespace std;

string A;
string B;

void init(string a,string b){
    A = a;
    B = b;
}

int get_distance(int x, int y){
    vector <int> v(6,0);
    for(int i = x; i <= y;i++){
        if(A.at(i) == 'A'){
            if(B.at(i) == 'T'){
                v[2]++;
            }else if(B.at(i) == 'C'){
                v[0]++;
            }
        }else if(A.at(i) == 'C'){
            if(B.at(i) == 'A'){
                v[1]++;
            }else if(B.at(i) == 'T'){
                v[4]++;
            }
        }else{
            if(B.at(i) == 'A'){
                v[3]++;
            }else if(B.at(i) == 'C'){
                v[5]++;
            }
        }
    }
    if(abs(v[0] - v[1]) == abs(v[2] - v[3]) && abs(v[0] - v[1]) == abs(v[4] - v[5])){
        int res = 0;
        res += min(v[0],v[1]);
        res += min(v[2],v[3]);
        res += min(v[4],v[5]);
        v[0] = abs(v[0] - v[1]);
        res += 2 * v[0];
        return res;
    }else{
        return -1;
    }
}

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