oj.uz

Submission #438111

# Submission time Handle Problem Language Result Execution time Memory
438111 2021-06-27T15:07:17 Z mango_lassi Mutating DNA (IOI21_dna) C++17
100 / 100
 62 ms 6072 KB 
#include "dna.h"
#include <bits/stdc++.h>
using namespace std;

vector<array<int, 9>> cou;

int getInd(char c) {
	if (c == 'A') return 0;
	if (c == 'C') return 1;
	if (c == 'T') return 2;
	assert(false);
	return -1;
}

void init(string a, string b) {
	int n = a.size();
	cou.resize(n + 1);
	for (int x = 0; x < 9; ++x) cou[0][x] = 0;
	for (int j = 1; j <= n; ++j) {
		for (int x = 0; x < 9; ++x) cou[j][x] = cou[j-1][x];
		int va = getInd(a[j-1]);
		int vb = getInd(b[j-1]);
		++cou[j][va + 3*vb];
	}
}

int get_distance(int x, int y) {
	array<int, 9> counts = cou[y + 1];
	for (int j = 0; j < 9; ++j) counts[j] -= cou[x][j];

	int ab = counts[1];
	int ac = counts[2];
	int ba = counts[3];
	int bc = counts[5];
	int ca = counts[6];
	int cb = counts[7];

	int diff_a = ab + ac - ba - ca;
	int diff_b = ba + bc - ab - cb;
	int diff_c = ca + cb - ac - bc;
	if (diff_a != 0 || diff_b != 0 || diff_c != 0) return -1;

	int abba = min(ab, ba);
	int acca = min(ac, ca);
	int bccb = min(bc, cb);
	int res = abba + acca + bccb;
	
	ab -= abba;
	ba -= abba;
	ac -= acca;
	ca -= acca;
	bc -= bccb;
	cb -= bccb;

	int abc = min(ab, min(bc, ca));
	int acb = min(ac, min(cb, ba));
	res += 2 * (abc + acb);
	ab -= abc;
	bc -= abc;
	ca -= abc;
	ac -= acb;
	cb -= acb;
	ba -= acb;
	assert(ab == 0 && bc == 0 && ca == 0 && ac == 0 && cb == 0 && ba == 0);

	return res;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 5636 KB Output is correct
2 Correct 51 ms 5624 KB Output is correct
3 Correct 54 ms 5276 KB Output is correct
4 Correct 44 ms 5632 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 6 ms 4300 KB Output is correct
5 Correct 7 ms 4300 KB Output is correct
6 Correct 6 ms 4300 KB Output is correct
7 Correct 6 ms 4044 KB Output is correct
8 Correct 6 ms 4300 KB Output is correct
9 Correct 6 ms 4300 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 6 ms 4300 KB Output is correct
5 Correct 7 ms 4300 KB Output is correct
6 Correct 6 ms 4300 KB Output is correct
7 Correct 6 ms 4044 KB Output is correct
8 Correct 6 ms 4300 KB Output is correct
9 Correct 6 ms 4300 KB Output is correct
10 Correct 45 ms 5624 KB Output is correct
11 Correct 47 ms 5628 KB Output is correct
12 Correct 45 ms 5732 KB Output is correct
13 Correct 38 ms 5772 KB Output is correct
14 Correct 42 ms 6028 KB Output is correct
15 Correct 42 ms 5916 KB Output is correct
16 Correct 47 ms 5776 KB Output is correct
17 Correct 44 ms 5872 KB Output is correct
18 Correct 42 ms 6016 KB Output is correct
19 Correct 48 ms 5776 KB Output is correct
20 Correct 50 ms 5880 KB Output is correct
21 Correct 50 ms 6012 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 6 ms 4300 KB Output is correct
5 Correct 7 ms 4300 KB Output is correct
6 Correct 6 ms 4300 KB Output is correct
7 Correct 6 ms 4044 KB Output is correct
8 Correct 6 ms 4300 KB Output is correct
9 Correct 6 ms 4300 KB Output is correct
10 Correct 5 ms 4044 KB Output is correct
11 Correct 8 ms 4300 KB Output is correct
12 Correct 6 ms 4044 KB Output is correct
13 Correct 6 ms 4300 KB Output is correct
14 Correct 8 ms 4300 KB Output is correct
15 Correct 6 ms 4300 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 5636 KB Output is correct
2 Correct 51 ms 5624 KB Output is correct
3 Correct 54 ms 5276 KB Output is correct
4 Correct 44 ms 5632 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 6 ms 4300 KB Output is correct
12 Correct 7 ms 4300 KB Output is correct
13 Correct 6 ms 4300 KB Output is correct
14 Correct 6 ms 4044 KB Output is correct
15 Correct 6 ms 4300 KB Output is correct
16 Correct 6 ms 4300 KB Output is correct
17 Correct 45 ms 5624 KB Output is correct
18 Correct 47 ms 5628 KB Output is correct
19 Correct 45 ms 5732 KB Output is correct
20 Correct 38 ms 5772 KB Output is correct
21 Correct 42 ms 6028 KB Output is correct
22 Correct 42 ms 5916 KB Output is correct
23 Correct 47 ms 5776 KB Output is correct
24 Correct 44 ms 5872 KB Output is correct
25 Correct 42 ms 6016 KB Output is correct
26 Correct 48 ms 5776 KB Output is correct
27 Correct 50 ms 5880 KB Output is correct
28 Correct 50 ms 6012 KB Output is correct
29 Correct 5 ms 4044 KB Output is correct
30 Correct 8 ms 4300 KB Output is correct
31 Correct 6 ms 4044 KB Output is correct
32 Correct 6 ms 4300 KB Output is correct
33 Correct 8 ms 4300 KB Output is correct
34 Correct 6 ms 4300 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 44 ms 5272 KB Output is correct
37 Correct 51 ms 5628 KB Output is correct
38 Correct 62 ms 5772 KB Output is correct
39 Correct 45 ms 6016 KB Output is correct
40 Correct 48 ms 6072 KB Output is correct
41 Correct 6 ms 4300 KB Output is correct
42 Correct 44 ms 5776 KB Output is correct
43 Correct 44 ms 5960 KB Output is correct
44 Correct 47 ms 6028 KB Output is correct
45 Correct 52 ms 5864 KB Output is correct
46 Correct 38 ms 6004 KB Output is correct
47 Correct 39 ms 6008 KB Output is correct