Submission #438137

#	Time	Username	Problem	Language	Result	Execution time	Memory
438137		josiftepe	Mutating DNA (IOI21_dna)	C++17	43 / 100	1583 ms	2372 KiB

dna

#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
#include "dna.h"
#include <map>
using namespace std;
const int maxn = 1e5 + 5;
string a, b;
int n;
void init(string _a, string _b) {
    
    n = (int) a.size();
    a = _a;
    b = _b;
}

int get_distance(int x, int y) {
    map<char, int> a_m, b_m;
    for(int i = x; i <= y; i++) {
        a_m[a[i]]++;
        b_m[b[i]]++;
    }
    if(a_m['A'] != b_m['A']) return -1;
    if(a_m['C'] != b_m['C']) return -1;
    if(a_m['T'] != b_m['T']) return -1;
    
    int diff = 0;
    for(int i = x; i <= y; i++) {
        if(a[i] != b[i]) {
            ++diff;
        }
    }
    return (diff + 1) / 2;
}

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