Submission #965057

#	Time	Username	Problem	Language	Result	Execution time	Memory
965057		KasymK	Mutating DNA (IOI21_dna)	C++17	0 / 100	1542 ms	2396 KiB

dna

// #include "dna.h"
#include "bits/stdc++.h"

using namespace std;

string s, s2;

int n;

int ok;

// shul yerde ok = 0

void init(string a, string b){
    s = a, s2 = b;
    n = (int)a.size();
    for(int i = 0; i < n; ++i)
        ok ^= (s[i] == 'C' or s2[i] == 'C');
}

// 'C' bar bolsa onda ok = 1

int get_distance(int x, int y){
    if(y - x <= 2 and ok){
        int s_a = 0, s_c = 0, s_t = 0;
        int s2_a = 0, s2_c = 0, s2_t = 0;
        for(int i = x; i <= y; ++i){
            s_a += (s[i] == 'A');
            s_c += (s[i] == 'C');
            s_t += (s[i] == 'T');
            s2_a += (s2[i] == 'A');
            s2_c += (s2[i] == 'C');
            s2_t += (s2[i] == 'T');
        }
        if(s_a != s2_a or s_c != s2_c or s_t != s2_t)
            return -1;
        int ok = 1;
        for(int i = x; i <= y; ++i)
            ok &= (s[i] == s2[i]);
        if(ok)
            return 0;
        int ans = 0;
        for(int i = x; i <= y; ++i)
            ans += (s[i] != s2[i]);
        ans--;
        return ans;
    }
    // galan wagt dine 'A' we 'T' harplar bar
    int ans = 0;
    for(int i = 0; i < n; ++i)
        ans += (((s[i] == 'A' and s2[i] == 'T') or (s[i] == 'T' and s2[i] == 'A') ? 1 : 0));
    ans >>= 1;
    return ans;
}

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