Submission #778310

# Submission time Handle Problem Language Result Execution time Memory
778310 2023-07-10T08:26:08 Z Minindu206 Mutating DNA (IOI21_dna) C++17
100 / 100
35 ms 8584 KB
#include "dna.h"
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
int aA[MAXN], aT[MAXN], aC[MAXN], bA[MAXN], bT[MAXN], bC[MAXN], AT[MAXN], TA[MAXN], AC[MAXN], CA[MAXN], CT[MAXN], TC[MAXN];
void init(string a, string b)
{
	int n = a.size();
	for (int i = 0; i < n; i++)
	{
		aA[i + 1] = aA[i];
		aT[i + 1] = aT[i];
		aC[i + 1] = aC[i];
		bA[i + 1] = bA[i];
		bT[i + 1] = bT[i];
		bC[i + 1] = bC[i];
		AT[i + 1] = AT[i];
		TA[i + 1] = TA[i];
		AC[i + 1] = AC[i];
		CA[i + 1] = CA[i];
		CT[i + 1] = CT[i];
		TC[i + 1] = TC[i];
		if (a[i] == 'A')
			aA[i + 1]++;
		else if (a[i] == 'C')
			aC[i + 1]++;
		else
			aT[i + 1]++;

		if (b[i] == 'A')
			bA[i + 1]++;
		else if (b[i] == 'C')
			bC[i + 1]++;
		else
			bT[i + 1]++;

		if (a[i] == 'A' && b[i] == 'T')
			AT[i + 1]++;
		if (a[i] == 'T' && b[i] == 'A')
			TA[i + 1]++;
		if (a[i] == 'C' && b[i] == 'T')
			CT[i + 1]++;
		if (a[i] == 'T' && b[i] == 'C')
			TC[i + 1]++;
		if (a[i] == 'A' && b[i] == 'C')
			AC[i + 1]++;
		if (a[i] == 'C' && b[i] == 'A')
			CA[i + 1]++;
	}
}

int get_distance(int x, int y)
{
	x++, y++;
	if (!((aA[y] - aA[x - 1] == bA[y] - bA[x - 1]) && (aC[y] - aC[x - 1] == bC[y] - bC[x - 1]) && (aT[y] - aT[x - 1] == bT[y] - bT[x - 1])))
		return -1;
	int a1 = AT[y] - AT[x - 1];
	int a2 = TA[y] - TA[x - 1];
	int a3 = AC[y] - AC[x - 1];
	int a4 = CA[y] - CA[x - 1];
	int a5 = CT[y] - CT[x - 1];
	int a6 = TC[y] - TC[x - 1];
	return min(a1,a2) + min(a3,a4) + min(a5,a6) + ((abs(a1 - a2) + abs(a3 - a4) + abs(a5 - a6)) / 3) * 2;
}
# Verdict Execution time Memory Grader output
1 Correct 26 ms 6796 KB Output is correct
2 Correct 27 ms 6852 KB Output is correct
3 Correct 25 ms 6428 KB Output is correct
4 Correct 27 ms 8212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 4 ms 5460 KB Output is correct
5 Correct 4 ms 5520 KB Output is correct
6 Correct 4 ms 5460 KB Output is correct
7 Correct 4 ms 5204 KB Output is correct
8 Correct 4 ms 5460 KB Output is correct
9 Correct 4 ms 5460 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 4 ms 5460 KB Output is correct
5 Correct 4 ms 5520 KB Output is correct
6 Correct 4 ms 5460 KB Output is correct
7 Correct 4 ms 5204 KB Output is correct
8 Correct 4 ms 5460 KB Output is correct
9 Correct 4 ms 5460 KB Output is correct
10 Correct 26 ms 6804 KB Output is correct
11 Correct 26 ms 6888 KB Output is correct
12 Correct 27 ms 6784 KB Output is correct
13 Correct 27 ms 6932 KB Output is correct
14 Correct 35 ms 7176 KB Output is correct
15 Correct 26 ms 7124 KB Output is correct
16 Correct 27 ms 6824 KB Output is correct
17 Correct 27 ms 6992 KB Output is correct
18 Correct 26 ms 7172 KB Output is correct
19 Correct 31 ms 6936 KB Output is correct
20 Correct 25 ms 7040 KB Output is correct
21 Correct 25 ms 7216 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 4 ms 5460 KB Output is correct
5 Correct 4 ms 5520 KB Output is correct
6 Correct 4 ms 5460 KB Output is correct
7 Correct 4 ms 5204 KB Output is correct
8 Correct 4 ms 5460 KB Output is correct
9 Correct 4 ms 5460 KB Output is correct
10 Correct 4 ms 5076 KB Output is correct
11 Correct 6 ms 5688 KB Output is correct
12 Correct 5 ms 5344 KB Output is correct
13 Correct 5 ms 5716 KB Output is correct
14 Correct 5 ms 5716 KB Output is correct
15 Correct 4 ms 5696 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 26 ms 6796 KB Output is correct
2 Correct 27 ms 6852 KB Output is correct
3 Correct 25 ms 6428 KB Output is correct
4 Correct 27 ms 8212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 4 ms 5460 KB Output is correct
12 Correct 4 ms 5520 KB Output is correct
13 Correct 4 ms 5460 KB Output is correct
14 Correct 4 ms 5204 KB Output is correct
15 Correct 4 ms 5460 KB Output is correct
16 Correct 4 ms 5460 KB Output is correct
17 Correct 26 ms 6804 KB Output is correct
18 Correct 26 ms 6888 KB Output is correct
19 Correct 27 ms 6784 KB Output is correct
20 Correct 27 ms 6932 KB Output is correct
21 Correct 35 ms 7176 KB Output is correct
22 Correct 26 ms 7124 KB Output is correct
23 Correct 27 ms 6824 KB Output is correct
24 Correct 27 ms 6992 KB Output is correct
25 Correct 26 ms 7172 KB Output is correct
26 Correct 31 ms 6936 KB Output is correct
27 Correct 25 ms 7040 KB Output is correct
28 Correct 25 ms 7216 KB Output is correct
29 Correct 4 ms 5076 KB Output is correct
30 Correct 6 ms 5688 KB Output is correct
31 Correct 5 ms 5344 KB Output is correct
32 Correct 5 ms 5716 KB Output is correct
33 Correct 5 ms 5716 KB Output is correct
34 Correct 4 ms 5696 KB Output is correct
35 Correct 1 ms 312 KB Output is correct
36 Correct 26 ms 7776 KB Output is correct
37 Correct 28 ms 8208 KB Output is correct
38 Correct 28 ms 8316 KB Output is correct
39 Correct 28 ms 8568 KB Output is correct
40 Correct 29 ms 8584 KB Output is correct
41 Correct 4 ms 5716 KB Output is correct
42 Correct 31 ms 8156 KB Output is correct
43 Correct 28 ms 8440 KB Output is correct
44 Correct 27 ms 8456 KB Output is correct
45 Correct 28 ms 8284 KB Output is correct
46 Correct 26 ms 8464 KB Output is correct
47 Correct 26 ms 8472 KB Output is correct