Submission #465023

#	Time	Username	Problem	Language	Result	Execution time	Memory
465023		peti1234	Mutating DNA (IOI21_dna)	C++17	0 / 100	42 ms	8448 KiB

dna

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

using namespace std;

int t[100005][4][4], n;
int valt(char c) {
    return (c=='A' ? 1 : c=='T' ? 2 : 3);
}
void init(string a, string b) {
    n=a.size();
    for (int i=1; i<=n; i++) {
        int x=valt(a[i-1]), y=valt(b[i-1]);
        for (int j=1; j<=3; j++) {
            for (int k=1; k<=3; k++) {
                t[i][j][k]=t[i-1][j][k];
            }
        }
        t[i][x][y]++;
    }
}

int get_distance(int x, int y) {
    y++;
	int s[4][4];
	for (int i=1; i<=3; i++) {
        for (int j=1; j<=3; j++) {
            s[i][j]=t[y][i][j]-t[x][i][j];
        }
	}
	int a=s[1][2], b=s[2][1], c=s[1][3], d=s[3][1], e=s[2][3], f=s[3][2];
	int ans=0;
	ans+=min(a, b), ans+=min(c, d), ans+=min(e, f);
	if (a-b==e-f && e-f && b-c) {
        ans+=abs(a-b);
        return ans;
	}
	return -1;
}
/*
int main() {
    string a, b;
    cin >> a >> b;
    init(a, b);
    int x;
    cin >> x;
    for (int i=1; i<=x; i++) {
        int l, r;
        cin >> l >> r;
        cout << get_distance(l, r) << "\n";
    }
}
*/

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