oj.uz

Submission #490543

# Submission time Handle Problem Language Result Execution time Memory
490543 2021-11-27T21:49:02 Z sliviu Mutating DNA (IOI21_dna) C++17
100 / 100
 43 ms 6092 KB 
#include <bits/stdc++.h>

using namespace std;

int n, c[100001][3][3];

int val(char x) {
	return x == 'A' ? 0 : x == 'T' ? 1 : 2;
}

void init(string a, string b) {
	n = a.length();
	for (int i = 0; i < n; ++i) {
		++c[i + 1][val(a[i])][val(b[i])];
		for (int j = 0; j < 3; ++j)
			for (int k = 0; k < 3; ++k)
				c[i + 1][j][k] += c[i][j][k];
	}
}

int get_distance(int x, int y) {
	int left = y - x + 1, swaps = 0;
	int cur[3][3];
	for (int i = 0; i < 3; ++i)
		for (int j = 0; j < 3; ++j)
			cur[i][j] = c[y + 1][i][j] - c[x][i][j];
	for (int i = 0; i < 3; ++i)
		left -= cur[i][i];
	for (int i = 0; i < 3; ++i)
		for (int j = i + 1; j < 3; ++j) {
			int off = min(cur[i][j], cur[j][i]);
			cur[i][j] -= off, cur[j][i] -= off;
			left -= 2 * off, swaps += off;
		}
	int a = n, b = n;
	for (int i = 0; i < 3; ++i)
		a = min(a, cur[i][(i + 1) % 3]), b = min(b, cur[(i + 1) % 3][i]);
	left -= 3 * (a + b), swaps += 2 * (a + b);
	if (left)
		return -1;
	return swaps;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 5636 KB Output is correct
2 Correct 33 ms 5632 KB Output is correct
3 Correct 32 ms 5328 KB Output is correct
4 Correct 33 ms 5624 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 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 0 ms 204 KB Output is correct
4 Correct 4 ms 4300 KB Output is correct
5 Correct 4 ms 4300 KB Output is correct
6 Correct 6 ms 4300 KB Output is correct
7 Correct 5 ms 4044 KB Output is correct
8 Correct 4 ms 4300 KB Output is correct
9 Correct 3 ms 4300 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 0 ms 204 KB Output is correct
4 Correct 4 ms 4300 KB Output is correct
5 Correct 4 ms 4300 KB Output is correct
6 Correct 6 ms 4300 KB Output is correct
7 Correct 5 ms 4044 KB Output is correct
8 Correct 4 ms 4300 KB Output is correct
9 Correct 3 ms 4300 KB Output is correct
10 Correct 35 ms 5628 KB Output is correct
11 Correct 33 ms 5672 KB Output is correct
12 Correct 33 ms 5704 KB Output is correct
13 Correct 33 ms 5756 KB Output is correct
14 Correct 32 ms 5996 KB Output is correct
15 Correct 34 ms 5892 KB Output is correct
16 Correct 30 ms 5680 KB Output is correct
17 Correct 36 ms 5868 KB Output is correct
18 Correct 31 ms 6048 KB Output is correct
19 Correct 30 ms 5700 KB Output is correct
20 Correct 32 ms 5888 KB Output is correct
21 Correct 37 ms 6024 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 0 ms 204 KB Output is correct
4 Correct 4 ms 4300 KB Output is correct
5 Correct 4 ms 4300 KB Output is correct
6 Correct 6 ms 4300 KB Output is correct
7 Correct 5 ms 4044 KB Output is correct
8 Correct 4 ms 4300 KB Output is correct
9 Correct 3 ms 4300 KB Output is correct
10 Correct 3 ms 4044 KB Output is correct
11 Correct 4 ms 4300 KB Output is correct
12 Correct 11 ms 4100 KB Output is correct
13 Correct 4 ms 4252 KB Output is correct
14 Correct 4 ms 4300 KB Output is correct
15 Correct 4 ms 4328 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 5636 KB Output is correct
2 Correct 33 ms 5632 KB Output is correct
3 Correct 32 ms 5328 KB Output is correct
4 Correct 33 ms 5624 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 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 0 ms 204 KB Output is correct
11 Correct 4 ms 4300 KB Output is correct
12 Correct 4 ms 4300 KB Output is correct
13 Correct 6 ms 4300 KB Output is correct
14 Correct 5 ms 4044 KB Output is correct
15 Correct 4 ms 4300 KB Output is correct
16 Correct 3 ms 4300 KB Output is correct
17 Correct 35 ms 5628 KB Output is correct
18 Correct 33 ms 5672 KB Output is correct
19 Correct 33 ms 5704 KB Output is correct
20 Correct 33 ms 5756 KB Output is correct
21 Correct 32 ms 5996 KB Output is correct
22 Correct 34 ms 5892 KB Output is correct
23 Correct 30 ms 5680 KB Output is correct
24 Correct 36 ms 5868 KB Output is correct
25 Correct 31 ms 6048 KB Output is correct
26 Correct 30 ms 5700 KB Output is correct
27 Correct 32 ms 5888 KB Output is correct
28 Correct 37 ms 6024 KB Output is correct
29 Correct 3 ms 4044 KB Output is correct
30 Correct 4 ms 4300 KB Output is correct
31 Correct 11 ms 4100 KB Output is correct
32 Correct 4 ms 4252 KB Output is correct
33 Correct 4 ms 4300 KB Output is correct
34 Correct 4 ms 4328 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 32 ms 5296 KB Output is correct
37 Correct 34 ms 5636 KB Output is correct
38 Correct 38 ms 5760 KB Output is correct
39 Correct 33 ms 6016 KB Output is correct
40 Correct 34 ms 6024 KB Output is correct
41 Correct 3 ms 4300 KB Output is correct
42 Correct 31 ms 5756 KB Output is correct
43 Correct 30 ms 6004 KB Output is correct
44 Correct 30 ms 6016 KB Output is correct
45 Correct 36 ms 5780 KB Output is correct
46 Correct 43 ms 6092 KB Output is correct
47 Correct 29 ms 6072 KB Output is correct