Submission #493599

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
493599	2021-12-12T10:22:36 Z	TranGiaHuy1508	Mutating DNA (IOI21_dna)	C++17	100 / 100	47 ms	8880 KB

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

typedef vector<int> vi;

int cv(char c){
	if (c == 'A') return 0;
	if (c == 'T') return 1;
	return 2;
}

vi pfxa[3], pfxb[3];
vi pfx[6];

int n;
string a, b;

void init(string A, string B){
	a = A; b = B;

	n = a.length();

	for (int i=0; i<3; i++) pfxa[i].assign(n, 0);
	for (int i=0; i<3; i++) pfxb[i].assign(n, 0);
	for (int i=0; i<6; i++) pfx[i].assign(n, 0);

	for (int i=0; i<n; i++){
		for (int j=0; j<3; j++){
			pfxa[j][i] = (i == 0 ? 0 : pfxa[j][i-1]) + (j == cv(a[i]));
		}
	}

	for (int i=0; i<n; i++){
		for (int j=0; j<3; j++){
			pfxb[j][i] = (i == 0 ? 0 : pfxb[j][i-1]) + (j == cv(b[i]));
		}
	}

	for (int i=0; i<n; i++){
		for (int j=0; j<6; j++){
			pfx[j][i] = (i == 0 ? 0 : pfx[j][i-1]);
		}
		if (a[i] == 'A' && b[i] == 'T') pfx[0][i]++;
		if (a[i] == 'T' && b[i] == 'A') pfx[1][i]++;
		if (a[i] == 'A' && b[i] == 'C') pfx[2][i]++;
		if (a[i] == 'C' && b[i] == 'A') pfx[3][i]++;
		if (a[i] == 'T' && b[i] == 'C') pfx[4][i]++;
		if (a[i] == 'C' && b[i] == 'T') pfx[5][i]++;
	}
}

int get_distance(int x, int y){
	if (x == 0){
		if (pfxa[0][y] != pfxb[0][y]){
			return -1;
		}
		if (pfxa[1][y] != pfxb[1][y]){
			return -1;
		}
		if (pfxa[2][y] != pfxb[2][y]){
			return -1;
		}
	}
	else{
		if ((pfxa[0][y] - pfxa[0][x-1]) != (pfxb[0][y] - pfxb[0][x-1])){
			return -1;
		}
		if ((pfxa[1][y] - pfxa[1][x-1]) != (pfxb[1][y] - pfxb[1][x-1])){
			return -1;
		}
		if ((pfxa[2][y] - pfxa[2][x-1]) != (pfxb[2][y] - pfxb[2][x-1])){
			return -1;
		}
	}

	int ca = pfx[0][y] - (x == 0 ? 0 : pfx[0][x-1]);
	int cb = pfx[1][y] - (x == 0 ? 0 : pfx[1][x-1]);
	int cc = pfx[2][y] - (x == 0 ? 0 : pfx[2][x-1]);
	int cd = pfx[3][y] - (x == 0 ? 0 : pfx[3][x-1]);
	int ce = pfx[4][y] - (x == 0 ? 0 : pfx[4][x-1]);
	int cf = pfx[5][y] - (x == 0 ? 0 : pfx[5][x-1]);
	
	int res = 0;

	int m1 = min(ca, cb), m2 = min(cc, cd), m3 = min(ce, cf);

	res += m1 + m2 + m3;
	ca -= m1; cb -= m1;
	cc -= m2; cd -= m2;
	ce -= m3; cf -= m3;

	res += 2 * (ca + cb);

	return res;
}

#ifdef LOCAL

int main(){
	string A, B; cin >> A >> B;
	init(A, B);

	int q; cin >> q;
	for (int i=0; i<q; i++){
		int x, y; cin >> x >> y;
		cout << get_distance(x, y) << "\n";
	}
}

#endif

Subtask #1
21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	37 ms	8376 KB	Output is correct
2	Correct	37 ms	8432 KB	Output is correct
3	Correct	39 ms	8004 KB	Output is correct
4	Correct	39 ms	8432 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	296 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct

Subtask #2
22.0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	9 ms	5836 KB	Output is correct
5	Correct	9 ms	6004 KB	Output is correct
6	Correct	8 ms	5836 KB	Output is correct
7	Correct	10 ms	5580 KB	Output is correct
8	Correct	8 ms	5940 KB	Output is correct
9	Correct	8 ms	5964 KB	Output is correct

Subtask #3
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	9 ms	5836 KB	Output is correct
5	Correct	9 ms	6004 KB	Output is correct
6	Correct	8 ms	5836 KB	Output is correct
7	Correct	10 ms	5580 KB	Output is correct
8	Correct	8 ms	5940 KB	Output is correct
9	Correct	8 ms	5964 KB	Output is correct
10	Correct	39 ms	8368 KB	Output is correct
11	Correct	38 ms	8448 KB	Output is correct
12	Correct	39 ms	8328 KB	Output is correct
13	Correct	42 ms	8532 KB	Output is correct
14	Correct	41 ms	8744 KB	Output is correct
15	Correct	38 ms	8692 KB	Output is correct
16	Correct	38 ms	8296 KB	Output is correct
17	Correct	39 ms	8472 KB	Output is correct
18	Correct	43 ms	8740 KB	Output is correct
19	Correct	36 ms	8260 KB	Output is correct
20	Correct	39 ms	8468 KB	Output is correct
21	Correct	39 ms	8772 KB	Output is correct

Subtask #4
28.0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	9 ms	5836 KB	Output is correct
5	Correct	9 ms	6004 KB	Output is correct
6	Correct	8 ms	5836 KB	Output is correct
7	Correct	10 ms	5580 KB	Output is correct
8	Correct	8 ms	5940 KB	Output is correct
9	Correct	8 ms	5964 KB	Output is correct
10	Correct	8 ms	5452 KB	Output is correct
11	Correct	9 ms	6016 KB	Output is correct
12	Correct	9 ms	5580 KB	Output is correct
13	Correct	8 ms	5964 KB	Output is correct
14	Correct	9 ms	5964 KB	Output is correct
15	Correct	8 ms	5964 KB	Output is correct

Subtask #5
16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	37 ms	8376 KB	Output is correct
2	Correct	37 ms	8432 KB	Output is correct
3	Correct	39 ms	8004 KB	Output is correct
4	Correct	39 ms	8432 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	296 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	9 ms	5836 KB	Output is correct
12	Correct	9 ms	6004 KB	Output is correct
13	Correct	8 ms	5836 KB	Output is correct
14	Correct	10 ms	5580 KB	Output is correct
15	Correct	8 ms	5940 KB	Output is correct
16	Correct	8 ms	5964 KB	Output is correct
17	Correct	39 ms	8368 KB	Output is correct
18	Correct	38 ms	8448 KB	Output is correct
19	Correct	39 ms	8328 KB	Output is correct
20	Correct	42 ms	8532 KB	Output is correct
21	Correct	41 ms	8744 KB	Output is correct
22	Correct	38 ms	8692 KB	Output is correct
23	Correct	38 ms	8296 KB	Output is correct
24	Correct	39 ms	8472 KB	Output is correct
25	Correct	43 ms	8740 KB	Output is correct
26	Correct	36 ms	8260 KB	Output is correct
27	Correct	39 ms	8468 KB	Output is correct
28	Correct	39 ms	8772 KB	Output is correct
29	Correct	8 ms	5452 KB	Output is correct
30	Correct	9 ms	6016 KB	Output is correct
31	Correct	9 ms	5580 KB	Output is correct
32	Correct	8 ms	5964 KB	Output is correct
33	Correct	9 ms	5964 KB	Output is correct
34	Correct	8 ms	5964 KB	Output is correct
35	Correct	0 ms	204 KB	Output is correct
36	Correct	43 ms	7956 KB	Output is correct
37	Correct	39 ms	8404 KB	Output is correct
38	Correct	39 ms	8416 KB	Output is correct
39	Correct	41 ms	8880 KB	Output is correct
40	Correct	39 ms	8824 KB	Output is correct
41	Correct	8 ms	5932 KB	Output is correct
42	Correct	42 ms	8336 KB	Output is correct
43	Correct	43 ms	8740 KB	Output is correct
44	Correct	40 ms	8772 KB	Output is correct
45	Correct	47 ms	8340 KB	Output is correct
46	Correct	47 ms	8772 KB	Output is correct
47	Correct	40 ms	8720 KB	Output is correct

Submission #493599

Compilation message

Subtask #1 21.0 / 21.0

Subtask #2 22.0 / 22.0

Subtask #3 13.0 / 13.0

Subtask #4 28.0 / 28.0

Subtask #5 16.0 / 16.0

Subtask #1
21.0 / 21.0

Subtask #2
22.0 / 22.0

Subtask #3
13.0 / 13.0

Subtask #4
28.0 / 28.0

Subtask #5
16.0 / 16.0