Submission #1001556

#	Time	Username	Problem	Language	Result	Execution time	Memory
1001556		vjudge1	Mutating DNA (IOI21_dna)	C++17	100 / 100	40 ms	6356 KiB

dna

#include "dna.h"
#include <vector>
using namespace std;
struct BIT{
	int n;
	vector<int> fw;
	BIT(int si){
		n = si;
		fw.assign(n + 1, 0);
	}
	void update(int p, int x){
		for (; p <= n; p = (p | (p + 1))){
			fw[p] += x;
		}
	}
	int sum(int r){
		int res = 0;
		for (; r >= 0; r = (r & (r + 1)) - 1){
			res += fw[r];
		}
		return res;
	}
	int sum(int l, int r){
		return sum(r) - sum(l - 1);
	}
};
vector<BIT> tr;
void init(std::string a, std::string b){
	tr.assign(6, BIT(a.size()));
	for (int i = 1; i <= a.size(); i++){
		if (a[i - 1] == 'A' && b[i - 1] == 'T'){
			tr[0].update(i, 1);
		}
		if (a[i - 1] == 'T' && b[i - 1] == 'A'){
			tr[1].update(i, 1);
		}
		if (a[i - 1] == 'A' && b[i - 1] == 'C'){
			tr[2].update(i, 1);
		}
		if (a[i - 1] == 'C' && b[i - 1] == 'A'){
			tr[3].update(i, 1);
		}
		if (a[i - 1] == 'T' && b[i - 1] == 'C'){
			tr[4].update(i, 1);
		}
		if (a[i - 1] == 'C' && b[i - 1] == 'T'){
			tr[5].update(i, 1);
		}
	}
}

int get_distance(int x, int y) {
	x++, y++;
	vector<int> dis(6, 0);
	int ans = 0;
	int a = 0, t = 0, c = 0;
	for (int i = 0; i < 6; i++){
		dis[i] = tr[i].sum(x, y);
	}
	ans = min(dis[0], dis[1]) + min(dis[2], dis[3]) + min(dis[4], dis[5]);
	if (dis[0] > dis[1]){
		a += abs(dis[1] - dis[0]);
	}
	if (dis[0] < dis[1]){
		t += abs(dis[1] - dis[0]);
	}
	if (dis[2] > dis[3]){
		a += abs(dis[2] - dis[3]);
	}
	if (dis[3] > dis[2]){
		c += abs(dis[2] - dis[3]);
	}
	if (dis[4] > dis[5]){
		t += abs(dis[4] - dis[5]);
	}
	if (dis[5] > dis[4]){
		c += abs(dis[4] - dis[5]);
	}
	if (a == t && t == c){
		ans += a * 2;
	}
	else{
		return -1;
	}
	return ans;
}

Compilation message (stderr)

dna.cpp: In function 'void init(std::string, std::string)':
dna.cpp:30:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |  for (int i = 1; i <= a.size(); i++){
      |                  ~~^~~~~~~~~~~

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