oj.uz

Submission #565404

# Submission time Handle Problem Language Result Execution time Memory
565404 2022-05-20T20:52:04 Z TomkeMonke Mutating DNA (IOI21_dna) C++17
100 / 100
 38 ms 6900 KB 
#include <bits/stdc++.h>
#include "dna.h"
using namespace std;

const int MAXN = 1e5 + 7;

int slowo1[MAXN];
int slowo2[MAXN];
int pref[MAXN][3][3];

void init(string a, string b)
{
	int n = a.size();

	// zamiana znakow na liczby
	for (int i = 0; i < n; i++) {
		if (a[i] == 'A')
			slowo1[i + 1] = 0;
		if (a[i] == 'T')
			slowo1[i + 1] = 1;
		if (a[i] == 'C')
			slowo1[i + 1] = 2;

		if (b[i] == 'A')
			slowo2[i + 1] = 0;
		if (b[i] == 'T')
			slowo2[i + 1] = 1;
		if (b[i] == 'C')
			slowo2[i + 1] = 2;
	}

	// liczenie sum prefiksowych
	for (int i = 1; i <= n; i++) {

		for (int c1 = 0; c1 < 3; c1++) {
			for (int c2 = 0; c2 < 3; c2++) {

				// jezeli mamy c1 w slowo1 oraz c2 w slowo2
				if ((slowo1[i] == c1) && (slowo2[i] == c2))
					pref[i][c1][c2] = pref[i - 1][c1][c2] + 1;
				else
					pref[i][c1][c2] = pref[i - 1][c1][c2] + 0;
			}
		}

	}
}

int get_distance(int x, int y)
{
	x = x + 1;
	y = y + 1;

	int AT = pref[y][0][1] - pref[x - 1][0][1];
	int TA = pref[y][1][0] - pref[x - 1][1][0];

	int TC = pref[y][1][2] - pref[x - 1][1][2];
	int CT = pref[y][2][1] - pref[x - 1][2][1];

	int CA = pref[y][2][0] - pref[x - 1][2][0];
	int AC = pref[y][0][2] - pref[x - 1][0][2];

	// jezeli mamy tyle samo A, T, C w obu podslowach
	if ((AT + AC == TA + CA) && (TA + TC == AT + CT)) {
		int wynik = min(AT, TA) + min(TC, CT) + min(CA, AC);
		wynik += 2 * abs(AT - TA);
		return wynik;
	}
	else {
		return -1;
	}
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 6408 KB Output is correct
2 Correct 34 ms 6404 KB Output is correct
3 Correct 32 ms 6000 KB Output is correct
4 Correct 32 ms 6408 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 6 ms 5076 KB Output is correct
5 Correct 5 ms 5140 KB Output is correct
6 Correct 6 ms 5076 KB Output is correct
7 Correct 6 ms 4820 KB Output is correct
8 Correct 6 ms 5076 KB Output is correct
9 Correct 4 ms 5076 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 6 ms 5076 KB Output is correct
5 Correct 5 ms 5140 KB Output is correct
6 Correct 6 ms 5076 KB Output is correct
7 Correct 6 ms 4820 KB Output is correct
8 Correct 6 ms 5076 KB Output is correct
9 Correct 4 ms 5076 KB Output is correct
10 Correct 33 ms 6404 KB Output is correct
11 Correct 32 ms 6416 KB Output is correct
12 Correct 35 ms 6524 KB Output is correct
13 Correct 33 ms 6548 KB Output is correct
14 Correct 33 ms 6792 KB Output is correct
15 Correct 31 ms 6748 KB Output is correct
16 Correct 31 ms 6528 KB Output is correct
17 Correct 34 ms 6544 KB Output is correct
18 Correct 32 ms 6788 KB Output is correct
19 Correct 29 ms 6552 KB Output is correct
20 Correct 32 ms 6656 KB Output is correct
21 Correct 31 ms 6788 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 6 ms 5076 KB Output is correct
5 Correct 5 ms 5140 KB Output is correct
6 Correct 6 ms 5076 KB Output is correct
7 Correct 6 ms 4820 KB Output is correct
8 Correct 6 ms 5076 KB Output is correct
9 Correct 4 ms 5076 KB Output is correct
10 Correct 6 ms 4704 KB Output is correct
11 Correct 6 ms 5076 KB Output is correct
12 Correct 6 ms 4820 KB Output is correct
13 Correct 6 ms 5076 KB Output is correct
14 Correct 6 ms 5168 KB Output is correct
15 Correct 6 ms 5076 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 6408 KB Output is correct
2 Correct 34 ms 6404 KB Output is correct
3 Correct 32 ms 6000 KB Output is correct
4 Correct 32 ms 6408 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 6 ms 5076 KB Output is correct
12 Correct 5 ms 5140 KB Output is correct
13 Correct 6 ms 5076 KB Output is correct
14 Correct 6 ms 4820 KB Output is correct
15 Correct 6 ms 5076 KB Output is correct
16 Correct 4 ms 5076 KB Output is correct
17 Correct 33 ms 6404 KB Output is correct
18 Correct 32 ms 6416 KB Output is correct
19 Correct 35 ms 6524 KB Output is correct
20 Correct 33 ms 6548 KB Output is correct
21 Correct 33 ms 6792 KB Output is correct
22 Correct 31 ms 6748 KB Output is correct
23 Correct 31 ms 6528 KB Output is correct
24 Correct 34 ms 6544 KB Output is correct
25 Correct 32 ms 6788 KB Output is correct
26 Correct 29 ms 6552 KB Output is correct
27 Correct 32 ms 6656 KB Output is correct
28 Correct 31 ms 6788 KB Output is correct
29 Correct 6 ms 4704 KB Output is correct
30 Correct 6 ms 5076 KB Output is correct
31 Correct 6 ms 4820 KB Output is correct
32 Correct 6 ms 5076 KB Output is correct
33 Correct 6 ms 5168 KB Output is correct
34 Correct 6 ms 5076 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 32 ms 6060 KB Output is correct
37 Correct 33 ms 6408 KB Output is correct
38 Correct 32 ms 6528 KB Output is correct
39 Correct 32 ms 6788 KB Output is correct
40 Correct 38 ms 6788 KB Output is correct
41 Correct 5 ms 5184 KB Output is correct
42 Correct 31 ms 6496 KB Output is correct
43 Correct 31 ms 6796 KB Output is correct
44 Correct 31 ms 6800 KB Output is correct
45 Correct 30 ms 6552 KB Output is correct
46 Correct 32 ms 6900 KB Output is correct
47 Correct 31 ms 6888 KB Output is correct