Submission #490541

# Submission time Handle Problem Language Result Execution time Memory
490541 2021-11-27T21:43:41 Z sliviu Mutating DNA (IOI21_dna) C++17
100 / 100
35 ms 7412 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]);
	for (int i = 0; i < 3; ++i)
		cur[i][(i + 1) % 3] -= a, cur[(i + 1) % 3][i] -= b;
	left -= 3 * (a + b), swaps += 2 * (a + b);
	if (left)
		return -1;
	return swaps;
}
# Verdict Execution time Memory Grader output
1 Correct 33 ms 5636 KB Output is correct
2 Correct 31 ms 5628 KB Output is correct
3 Correct 33 ms 5276 KB Output is correct
4 Correct 35 ms 5616 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
# 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 4388 KB Output is correct
6 Correct 6 ms 4300 KB Output is correct
7 Correct 4 ms 4064 KB Output is correct
8 Correct 4 ms 4300 KB Output is correct
9 Correct 3 ms 4300 KB Output is correct
# 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 4388 KB Output is correct
6 Correct 6 ms 4300 KB Output is correct
7 Correct 4 ms 4064 KB Output is correct
8 Correct 4 ms 4300 KB Output is correct
9 Correct 3 ms 4300 KB Output is correct
10 Correct 33 ms 5600 KB Output is correct
11 Correct 33 ms 5632 KB Output is correct
12 Correct 32 ms 5744 KB Output is correct
13 Correct 34 ms 5760 KB Output is correct
14 Correct 32 ms 6024 KB Output is correct
15 Correct 31 ms 5884 KB Output is correct
16 Correct 30 ms 5748 KB Output is correct
17 Correct 31 ms 5884 KB Output is correct
18 Correct 31 ms 6012 KB Output is correct
19 Correct 30 ms 5776 KB Output is correct
20 Correct 30 ms 5884 KB Output is correct
21 Correct 29 ms 6072 KB Output is correct
# 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 4388 KB Output is correct
6 Correct 6 ms 4300 KB Output is correct
7 Correct 4 ms 4064 KB Output is correct
8 Correct 4 ms 4300 KB Output is correct
9 Correct 3 ms 4300 KB Output is correct
10 Correct 4 ms 4044 KB Output is correct
11 Correct 3 ms 4300 KB Output is correct
12 Correct 3 ms 4044 KB Output is correct
13 Correct 4 ms 4532 KB Output is correct
14 Correct 4 ms 4556 KB Output is correct
15 Correct 5 ms 4540 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 33 ms 5636 KB Output is correct
2 Correct 31 ms 5628 KB Output is correct
3 Correct 33 ms 5276 KB Output is correct
4 Correct 35 ms 5616 KB Output is correct
5 Correct 1 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 4388 KB Output is correct
13 Correct 6 ms 4300 KB Output is correct
14 Correct 4 ms 4064 KB Output is correct
15 Correct 4 ms 4300 KB Output is correct
16 Correct 3 ms 4300 KB Output is correct
17 Correct 33 ms 5600 KB Output is correct
18 Correct 33 ms 5632 KB Output is correct
19 Correct 32 ms 5744 KB Output is correct
20 Correct 34 ms 5760 KB Output is correct
21 Correct 32 ms 6024 KB Output is correct
22 Correct 31 ms 5884 KB Output is correct
23 Correct 30 ms 5748 KB Output is correct
24 Correct 31 ms 5884 KB Output is correct
25 Correct 31 ms 6012 KB Output is correct
26 Correct 30 ms 5776 KB Output is correct
27 Correct 30 ms 5884 KB Output is correct
28 Correct 29 ms 6072 KB Output is correct
29 Correct 4 ms 4044 KB Output is correct
30 Correct 3 ms 4300 KB Output is correct
31 Correct 3 ms 4044 KB Output is correct
32 Correct 4 ms 4532 KB Output is correct
33 Correct 4 ms 4556 KB Output is correct
34 Correct 5 ms 4540 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 33 ms 6620 KB Output is correct
37 Correct 33 ms 7032 KB Output is correct
38 Correct 33 ms 7136 KB Output is correct
39 Correct 34 ms 7412 KB Output is correct
40 Correct 34 ms 7404 KB Output is correct
41 Correct 5 ms 4556 KB Output is correct
42 Correct 31 ms 6996 KB Output is correct
43 Correct 33 ms 7280 KB Output is correct
44 Correct 31 ms 7296 KB Output is correct
45 Correct 30 ms 7072 KB Output is correct
46 Correct 30 ms 7328 KB Output is correct
47 Correct 31 ms 7324 KB Output is correct