oj.uz

Submission #467612

# Submission time Handle Problem Language Result Execution time Memory
467612 2021-08-23T20:05:21 Z rainboy Mutating DNA (IOI21_dna) C++17
100 / 100
 48 ms 6152 KB 
#include "dna.h"

const int N = 100000;

using namespace std;

int abs_(int a) { return a > 0 ? a : -a; }

int pp[6][N];

void init(string aa, string bb) {
	int n = aa.size(), h, i;

	for (i = 0; i < n; i++)
		if (aa[i] == 'A' && bb[i] == 'T')
			pp[0][i] = 1;
		else if (aa[i] == 'T' && bb[i] == 'A')
			pp[1][i] = 1;
		else if (aa[i] == 'T' && bb[i] == 'C')
			pp[4][i] = 1;
		else if (aa[i] == 'C' && bb[i] == 'T')
			pp[5][i] = 1;
		else if (aa[i] == 'C' && bb[i] == 'A')
			pp[2][i] = 1;
		else if (aa[i] == 'A' && bb[i] == 'C')
			pp[3][i] = 1;
	for (h = 0; h < 6; h++)
		for (i = 1; i < n; i++)
			pp[h][i] += pp[h][i - 1];
}

int kk[6];

int get_distance(int i, int j) {
	int h;

	for (h = 0; h < 6; h++)
		kk[h] = pp[h][j] - (i == 0 ? 0 : pp[h][i - 1]);
	if (kk[0] - kk[1] != kk[2] - kk[3] || kk[0] - kk[1] != kk[4] - kk[5])
		return -1;
	return min(kk[0], kk[1]) + min(kk[2], kk[3]) + min(kk[4], kk[5]) + abs_(kk[0] - kk[1]) * 2;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 5836 KB Output is correct
2 Correct 41 ms 5864 KB Output is correct
3 Correct 40 ms 5580 KB Output is correct
4 Correct 41 ms 5848 KB Output is correct
5 Correct 0 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 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 5 ms 3276 KB Output is correct
5 Correct 5 ms 3404 KB Output is correct
6 Correct 6 ms 3372 KB Output is correct
7 Correct 5 ms 3148 KB Output is correct
8 Correct 5 ms 3404 KB Output is correct
9 Correct 4 ms 3404 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 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 5 ms 3276 KB Output is correct
5 Correct 5 ms 3404 KB Output is correct
6 Correct 6 ms 3372 KB Output is correct
7 Correct 5 ms 3148 KB Output is correct
8 Correct 5 ms 3404 KB Output is correct
9 Correct 4 ms 3404 KB Output is correct
10 Correct 42 ms 5724 KB Output is correct
11 Correct 41 ms 5820 KB Output is correct
12 Correct 40 ms 5956 KB Output is correct
13 Correct 41 ms 6056 KB Output is correct
14 Correct 41 ms 6108 KB Output is correct
15 Correct 40 ms 6120 KB Output is correct
16 Correct 39 ms 5832 KB Output is correct
17 Correct 39 ms 5988 KB Output is correct
18 Correct 40 ms 6016 KB Output is correct
19 Correct 39 ms 5948 KB Output is correct
20 Correct 38 ms 5988 KB Output is correct
21 Correct 37 ms 6112 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 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 5 ms 3276 KB Output is correct
5 Correct 5 ms 3404 KB Output is correct
6 Correct 6 ms 3372 KB Output is correct
7 Correct 5 ms 3148 KB Output is correct
8 Correct 5 ms 3404 KB Output is correct
9 Correct 4 ms 3404 KB Output is correct
10 Correct 5 ms 3148 KB Output is correct
11 Correct 6 ms 3412 KB Output is correct
12 Correct 6 ms 3216 KB Output is correct
13 Correct 7 ms 3340 KB Output is correct
14 Correct 6 ms 3404 KB Output is correct
15 Correct 5 ms 3372 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 5836 KB Output is correct
2 Correct 41 ms 5864 KB Output is correct
3 Correct 40 ms 5580 KB Output is correct
4 Correct 41 ms 5848 KB Output is correct
5 Correct 0 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 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 5 ms 3276 KB Output is correct
12 Correct 5 ms 3404 KB Output is correct
13 Correct 6 ms 3372 KB Output is correct
14 Correct 5 ms 3148 KB Output is correct
15 Correct 5 ms 3404 KB Output is correct
16 Correct 4 ms 3404 KB Output is correct
17 Correct 42 ms 5724 KB Output is correct
18 Correct 41 ms 5820 KB Output is correct
19 Correct 40 ms 5956 KB Output is correct
20 Correct 41 ms 6056 KB Output is correct
21 Correct 41 ms 6108 KB Output is correct
22 Correct 40 ms 6120 KB Output is correct
23 Correct 39 ms 5832 KB Output is correct
24 Correct 39 ms 5988 KB Output is correct
25 Correct 40 ms 6016 KB Output is correct
26 Correct 39 ms 5948 KB Output is correct
27 Correct 38 ms 5988 KB Output is correct
28 Correct 37 ms 6112 KB Output is correct
29 Correct 5 ms 3148 KB Output is correct
30 Correct 6 ms 3412 KB Output is correct
31 Correct 6 ms 3216 KB Output is correct
32 Correct 7 ms 3340 KB Output is correct
33 Correct 6 ms 3404 KB Output is correct
34 Correct 5 ms 3372 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 39 ms 5588 KB Output is correct
37 Correct 42 ms 5860 KB Output is correct
38 Correct 48 ms 5976 KB Output is correct
39 Correct 41 ms 6144 KB Output is correct
40 Correct 41 ms 6100 KB Output is correct
41 Correct 5 ms 3372 KB Output is correct
42 Correct 39 ms 5980 KB Output is correct
43 Correct 40 ms 6152 KB Output is correct
44 Correct 39 ms 6116 KB Output is correct
45 Correct 39 ms 5976 KB Output is correct
46 Correct 38 ms 6116 KB Output is correct
47 Correct 39 ms 6068 KB Output is correct