Submission #1142699

#TimeUsernameProblemLanguageResultExecution timeMemory
1142699programming23Mutating DNA (IOI21_dna)C++20
Compilation error
0 ms0 KiB

#include "bits/stdc++.h"
using namespace std;


string stringA;
string stringB;
vector<vector<int>> countD;
int ln;

void init(std::string a, std::string b) {
	stringA = a;
	stringB = b;
	ln = a.size();
	countD.resize(ln);
	int at = 0;
	int ta = 0;
	int ac = 0;
	int ca = 0;
	int tc = 0;
	int ct = 0;
	for(int i=ln-1; i >= 0; i--){
		if(a[i] == 'A' && b[i] == 'T'){
			at +=1;
		}if(a[i] == 'T' && b[i] == 'A'){
			ta +=1;
		}if(a[i] == 'A' && b[i] == 'C'){
			ac +=1;
		}if(a[i] == 'C' && b[i] == 'A'){
			ca +=1;
		}if(a[i] == 'T' && b[i] == 'C'){
			tc +=1;
		}if(a[i] == 'C' && b[i] == 'T'){
			ct +=1;
		}

		countD[i] = {at, ta, ac, ca, tc, ct};
	}
}

int get_distance(int x, int y) {
	vector<int> count = countD[x];
	if(y+1 <= ln){
		for(int i=0; i < count.size(); i++){
			count[i] -= countD[y+1][i];
		}
	}

	int out = 0;
	out += min(count[0], count[1]);
	int rest1 =abs(count[0] - count[1]);

	out += min(count[2], count[3]);
	int rest2 = abs(count[2]-count[3]);

	out += min(count[4], count[5]);
	int rest3 = abs(count[4] - count[5]);

	if(rest1 == rest2 && rest2 == rest3){
		return out+rest2;
	}else{
		return -1;
	}

	return 0;
}


int main() {
  int n,q;
  cin>>n>>q;
  string a,b;
  cin>>a>>b;
  init(a,b);
  while(q--){
      int x,y;
      cin>>x>>y;
      cout<<get_distance(x,y)<<endl;
  }
}

Compilation message (stderr)

/usr/bin/ld: /tmp/ccsOLfZc.o: in function `main':
grader.cpp:(.text.startup+0x0): multiple definition of `main'; /tmp/ccYXYdtk.o:dna.cpp:(.text.startup+0x0): first defined here
collect2: error: ld returned 1 exit status