제출 #480829

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

dna

#include "dna.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long 
#define pb(e) push_back(e)
#define sv(a) sort(a.begin(),a.end())
#define sa(a,n) sort(a,a+n)
#define mp(a,b) make_pair(a,b)
#define vf first
#define vs second
#define ar array
#define all(x) x.begin(),x.end()
const int inf = 0x3f3f3f3f;
const int mod = 1000000007; 
const double PI=3.14159265358979323846264338327950288419716939937510582097494459230;
bool remender(ll a , ll b){return a%b;}

const int N = 100002;

string a,b;

void init(std::string aa, std::string bb) {
	a = aa;
	b = bb;
}

int get_distance(int x, int y) {
	int n1 = 0 , n2 = 0 , n3 = 0;
	int t1 = 0, t2 = 0, t3 = 0;
	for(int i = x; i <= y; i++){
		if(a[i]!=b[i]){
			if(a[i] == 'A')t1++;
			else if(a[i] == 'T')t2++;
			else t3++;
			if(b[i] == 'A')n1++;
			else if(b[i] == 'B')n2++;
			else n3++;
		}
	}
	if(n1 == t1 && n2 == t2 && n3 == t3){
		int c = n1 + n2 + n3;
		if(c == 3)return 2;
		if(c == 0)return 0;
		return 1;
	}
	return -1;
}

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