Submission #673960

# Submission time Handle Problem Language Result Execution time Memory
673960 2022-12-22T13:09:25 Z Nahian9696 Mutating DNA (IOI21_dna) C++17
100 / 100
37 ms 6168 KB
#include "dna.h"
using namespace std;



#define f0(i,n)                             for(int32_t i = 0; i <  (n); i++)
#define f1(i,n)                             for(int32_t i = 1; i <= (n); i++)

// all combination of A, T, C
int AT[100005], 
	AC[100005], 
	TC[100005], 
	TA[100005], 
	CA[100005], 
	CT[100005];
int n;

void init(std::string a, std::string b) {
	n = a.size();
	f0(i, n+1) {
		AT[i] = AC[i] = TC[i] = TA[i] = CA[i] = CT[i] = 0;
	}
	f0(i, n) {
		if (a[i] == 'A' && b[i] == 'T') AT[i+1]++;
		if (a[i] == 'A' && b[i] == 'C') AC[i+1]++;
		if (a[i] == 'T' && b[i] == 'C') TC[i+1]++;
		if (a[i] == 'T' && b[i] == 'A') TA[i+1]++;
		if (a[i] == 'C' && b[i] == 'A') CA[i+1]++;
		if (a[i] == 'C' && b[i] == 'T') CT[i+1]++;
	}
	f1(i, n) {
		AT[i] += AT[i-1];
		AC[i] += AC[i-1];
		TC[i] += TC[i-1];
		TA[i] += TA[i-1];
		CA[i] += CA[i-1];
		CT[i] += CT[i-1];
	}
}

int get_distance(int x, int y) {

	x++; y++;

	int at = AT[y] - AT[x-1];
	int ac = AC[y] - AC[x-1];
	int tc = TC[y] - TC[x-1];
	int ta = TA[y] - TA[x-1];
	int ca = CA[y] - CA[x-1];
	int ct = CT[y] - CT[x-1];

	int ans = 0;

	int min1 = min(at, ta);
	int min2 = min(ac, ca);
	int min3 = min(tc, ct);

	ans += min1 + min2 + min3;
	at -= min1; ta -= min1;
	ac -= min2; ca -= min2;
	tc -= min3; ct -= min3;

	if( (at == tc && tc == ca) && (ta == ac && ac == ct) ) {
		ans += at + ta + ac + ca;
		return ans;
	} else {
		// cout << at << " " << tc << " " << ca << endl;
		// cout << ta << " " << ac << " " << ct << endl;
		return -1;
	}


	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 34 ms 4492 KB Output is correct
2 Correct 30 ms 4536 KB Output is correct
3 Correct 30 ms 4204 KB Output is correct
4 Correct 35 ms 4472 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 4 ms 3156 KB Output is correct
5 Correct 4 ms 3156 KB Output is correct
6 Correct 4 ms 3156 KB Output is correct
7 Correct 3 ms 3028 KB Output is correct
8 Correct 3 ms 3156 KB Output is correct
9 Correct 3 ms 3156 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 4 ms 3156 KB Output is correct
5 Correct 4 ms 3156 KB Output is correct
6 Correct 4 ms 3156 KB Output is correct
7 Correct 3 ms 3028 KB Output is correct
8 Correct 3 ms 3156 KB Output is correct
9 Correct 3 ms 3156 KB Output is correct
10 Correct 28 ms 4436 KB Output is correct
11 Correct 29 ms 4476 KB Output is correct
12 Correct 31 ms 4580 KB Output is correct
13 Correct 34 ms 4728 KB Output is correct
14 Correct 29 ms 4860 KB Output is correct
15 Correct 28 ms 4752 KB Output is correct
16 Correct 30 ms 4696 KB Output is correct
17 Correct 27 ms 4724 KB Output is correct
18 Correct 28 ms 4860 KB Output is correct
19 Correct 27 ms 4636 KB Output is correct
20 Correct 27 ms 5992 KB Output is correct
21 Correct 27 ms 6112 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 4 ms 3156 KB Output is correct
5 Correct 4 ms 3156 KB Output is correct
6 Correct 4 ms 3156 KB Output is correct
7 Correct 3 ms 3028 KB Output is correct
8 Correct 3 ms 3156 KB Output is correct
9 Correct 3 ms 3156 KB Output is correct
10 Correct 4 ms 2900 KB Output is correct
11 Correct 4 ms 3156 KB Output is correct
12 Correct 4 ms 3028 KB Output is correct
13 Correct 4 ms 3156 KB Output is correct
14 Correct 4 ms 3156 KB Output is correct
15 Correct 3 ms 3156 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 34 ms 4492 KB Output is correct
2 Correct 30 ms 4536 KB Output is correct
3 Correct 30 ms 4204 KB Output is correct
4 Correct 35 ms 4472 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 4 ms 3156 KB Output is correct
12 Correct 4 ms 3156 KB Output is correct
13 Correct 4 ms 3156 KB Output is correct
14 Correct 3 ms 3028 KB Output is correct
15 Correct 3 ms 3156 KB Output is correct
16 Correct 3 ms 3156 KB Output is correct
17 Correct 28 ms 4436 KB Output is correct
18 Correct 29 ms 4476 KB Output is correct
19 Correct 31 ms 4580 KB Output is correct
20 Correct 34 ms 4728 KB Output is correct
21 Correct 29 ms 4860 KB Output is correct
22 Correct 28 ms 4752 KB Output is correct
23 Correct 30 ms 4696 KB Output is correct
24 Correct 27 ms 4724 KB Output is correct
25 Correct 28 ms 4860 KB Output is correct
26 Correct 27 ms 4636 KB Output is correct
27 Correct 27 ms 5992 KB Output is correct
28 Correct 27 ms 6112 KB Output is correct
29 Correct 4 ms 2900 KB Output is correct
30 Correct 4 ms 3156 KB Output is correct
31 Correct 4 ms 3028 KB Output is correct
32 Correct 4 ms 3156 KB Output is correct
33 Correct 4 ms 3156 KB Output is correct
34 Correct 3 ms 3156 KB Output is correct
35 Correct 1 ms 252 KB Output is correct
36 Correct 29 ms 5584 KB Output is correct
37 Correct 29 ms 5832 KB Output is correct
38 Correct 34 ms 6020 KB Output is correct
39 Correct 31 ms 6152 KB Output is correct
40 Correct 32 ms 6168 KB Output is correct
41 Correct 3 ms 3412 KB Output is correct
42 Correct 28 ms 5980 KB Output is correct
43 Correct 27 ms 6160 KB Output is correct
44 Correct 37 ms 6120 KB Output is correct
45 Correct 28 ms 5928 KB Output is correct
46 Correct 27 ms 6120 KB Output is correct
47 Correct 26 ms 6160 KB Output is correct