oj.uz

Submission #881781

# Submission time Handle Problem Language Result Execution time Memory
881781 2023-12-01T22:19:23 Z DrAymeinstein Mutating DNA (IOI21_dna) C++17
100 / 100
 35 ms 8728 KB 
#include <iostream>
#include <cmath>

using namespace std;

int n;
int cnt[100002][3];
int sum[100002][3][3];

void init(string a, string b) {
	n = (int)a.size();
	for (int i = 1; i <= n; i++) {
		for (int j = 0; j < 3; j++) {
			for (int k = 0; k < 3; k++) {
				sum[i][j][k] = sum[i - 1][j][k];
			}
		}
		for (int j = 0; j < 3; j++) {
			cnt[i][j] = cnt[i - 1][j];
		}
		sum[i][a[i - 1] == 'A' ? 0 : a[i - 1] == 'T' ? 1 : 2][b[i - 1] == 'A' ? 0 : b[i - 1] == 'T' ? 1 : 2]++;
		cnt[i][a[i - 1] == 'A' ? 0 : a[i - 1] == 'T' ? 1 : 2]++;
		cnt[i][b[i - 1] == 'A' ? 0 : b[i - 1] == 'T' ? 1 : 2]--;
	}
}

int get_distance(int x, int y) {
	x++, y++;
	int ans = 0;
	int c[3][3] = { {0} };
	for (int i = 0; i < 3; i++) for (int j = 0; j < 3; j++) {
		c[i][j] = sum[y][i][j] - sum[x - 1][i][j];
	}

	if (cnt[y][0] != cnt[x - 1][0]) {
		return -1;
	}
	if (cnt[y][1] != cnt[x - 1][1]) {
		return -1;
	}
	if (cnt[y][2] != cnt[x - 1][2]) {
		return -1;
	}

	int tmp;
	tmp = min(c[0][1], c[1][0]);
	c[0][1] -= tmp, c[1][0] -= tmp, ans += tmp;
	tmp = min(c[0][2], c[2][0]);
	c[0][2] -= tmp, c[2][0] -= tmp, ans += tmp;
	tmp = min(c[2][1], c[1][2]);
	c[2][1] -= tmp, c[1][2] -= tmp, ans += tmp;

	ans += 2 * (c[0][1] + c[1][0]);


	return ans;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 8212 KB Output is correct
2 Correct 26 ms 8456 KB Output is correct
3 Correct 25 ms 7724 KB Output is correct
4 Correct 26 ms 8324 KB Output is correct
5 Correct 1 ms 496 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 4 ms 5724 KB Output is correct
5 Correct 4 ms 5724 KB Output is correct
6 Correct 4 ms 5724 KB Output is correct
7 Correct 3 ms 5416 KB Output is correct
8 Correct 4 ms 5724 KB Output is correct
9 Correct 3 ms 5724 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 4 ms 5724 KB Output is correct
5 Correct 4 ms 5724 KB Output is correct
6 Correct 4 ms 5724 KB Output is correct
7 Correct 3 ms 5416 KB Output is correct
8 Correct 4 ms 5724 KB Output is correct
9 Correct 3 ms 5724 KB Output is correct
10 Correct 35 ms 8220 KB Output is correct
11 Correct 26 ms 8332 KB Output is correct
12 Correct 27 ms 8224 KB Output is correct
13 Correct 27 ms 8320 KB Output is correct
14 Correct 27 ms 8728 KB Output is correct
15 Correct 27 ms 8468 KB Output is correct
16 Correct 26 ms 8228 KB Output is correct
17 Correct 27 ms 8200 KB Output is correct
18 Correct 27 ms 8460 KB Output is correct
19 Correct 25 ms 8224 KB Output is correct
20 Correct 26 ms 8392 KB Output is correct
21 Correct 26 ms 8464 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 4 ms 5724 KB Output is correct
5 Correct 4 ms 5724 KB Output is correct
6 Correct 4 ms 5724 KB Output is correct
7 Correct 3 ms 5416 KB Output is correct
8 Correct 4 ms 5724 KB Output is correct
9 Correct 3 ms 5724 KB Output is correct
10 Correct 3 ms 5208 KB Output is correct
11 Correct 4 ms 5720 KB Output is correct
12 Correct 4 ms 5464 KB Output is correct
13 Correct 4 ms 5724 KB Output is correct
14 Correct 4 ms 5720 KB Output is correct
15 Correct 3 ms 5720 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 8212 KB Output is correct
2 Correct 26 ms 8456 KB Output is correct
3 Correct 25 ms 7724 KB Output is correct
4 Correct 26 ms 8324 KB Output is correct
5 Correct 1 ms 496 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 4 ms 5724 KB Output is correct
12 Correct 4 ms 5724 KB Output is correct
13 Correct 4 ms 5724 KB Output is correct
14 Correct 3 ms 5416 KB Output is correct
15 Correct 4 ms 5724 KB Output is correct
16 Correct 3 ms 5724 KB Output is correct
17 Correct 35 ms 8220 KB Output is correct
18 Correct 26 ms 8332 KB Output is correct
19 Correct 27 ms 8224 KB Output is correct
20 Correct 27 ms 8320 KB Output is correct
21 Correct 27 ms 8728 KB Output is correct
22 Correct 27 ms 8468 KB Output is correct
23 Correct 26 ms 8228 KB Output is correct
24 Correct 27 ms 8200 KB Output is correct
25 Correct 27 ms 8460 KB Output is correct
26 Correct 25 ms 8224 KB Output is correct
27 Correct 26 ms 8392 KB Output is correct
28 Correct 26 ms 8464 KB Output is correct
29 Correct 3 ms 5208 KB Output is correct
30 Correct 4 ms 5720 KB Output is correct
31 Correct 4 ms 5464 KB Output is correct
32 Correct 4 ms 5724 KB Output is correct
33 Correct 4 ms 5720 KB Output is correct
34 Correct 3 ms 5720 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 32 ms 7768 KB Output is correct
37 Correct 26 ms 8356 KB Output is correct
38 Correct 27 ms 8184 KB Output is correct
39 Correct 27 ms 8728 KB Output is correct
40 Correct 27 ms 8636 KB Output is correct
41 Correct 3 ms 5720 KB Output is correct
42 Correct 30 ms 8312 KB Output is correct
43 Correct 27 ms 8464 KB Output is correct
44 Correct 26 ms 8472 KB Output is correct
45 Correct 26 ms 8316 KB Output is correct
46 Correct 26 ms 8460 KB Output is correct
47 Correct 26 ms 8472 KB Output is correct