제출 #1142125

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1142125		mehdiba	Mutating DNA (IOI21_dna)	C++20	0 / 100	17 ms	2880 KiB

dna

#include "dna.h"
#include <bits/stdc++.h>
#define endl '\n'
#define pb push_back
#define F first
#define S second
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
string a, b;
vector<int> p(1e5), fa(3), fb(3);

void init(string A, string B){
	a = A, b = B;
	int n = a.size();
	p[0] = (a[0] != b[0]);
	for(int i = 1; i < n; i++){
		p[i] = p[i - 1] + (a[i] != b[i]);
		if(a[i] == 'A') fa[0]++;
		if(a[i] == 'C') fa[1]++;
		if(a[i] == 'T') fa[2]++;
		if(b[i] == 'A') fb[0]++;
		if(b[i] == 'C') fb[1]++;
		if(b[i] == 'T') fb[2]++;
	}
}

int get_distance(int x, int y){
	int cnt = p[y] - (x ? p[x - 1] : 0);
	if(cnt % 2 || fa[0] != fb[0] || fa[1] != fb[1] || fa[2] || fb[2]) return -1;
	return cnt / 2;
}

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