oj.uz

Submission #608192

# Submission time Handle Problem Language Result Execution time Memory
608192 2022-07-27T05:59:29 Z KoD Mutating DNA (IOI21_dna) C++17
100 / 100
 45 ms 7412 KB 
#include "dna.h"
#include <bits/stdc++.h>

int sum[100001][3][3];

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

int get_distance(int l, int r) {
	int dif[3][3];
	for (int j = 0; j < 3; ++j) {
		for (int k = 0; k < 3; ++k) {
			dif[j][k] = sum[r + 1][j][k] - sum[l][j][k];
		}
	}
	int ret = 0;
	for (int i = 0; i < 3; ++i) {
		const int j = i == 2 ? 0 : i + 1;
		const int min = std::min(dif[i][j], dif[j][i]);
		ret += min;
		dif[i][j] -= min;
		dif[j][i] -= min;
	}
	if (dif[0][1] == dif[1][2] and dif[1][2] == dif[2][0] and dif[1][0] == dif[2][1] and dif[2][1] == dif[0][2]) {
		return ret + (dif[0][1] + dif[1][0]) * 2;
	} else {
		return -1;
	}
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 6904 KB Output is correct
2 Correct 38 ms 6976 KB Output is correct
3 Correct 36 ms 6640 KB Output is correct
4 Correct 37 ms 6948 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 5 ms 4564 KB Output is correct
5 Correct 5 ms 4564 KB Output is correct
6 Correct 5 ms 4584 KB Output is correct
7 Correct 5 ms 4308 KB Output is correct
8 Correct 5 ms 4540 KB Output is correct
9 Correct 4 ms 4544 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 5 ms 4564 KB Output is correct
5 Correct 5 ms 4564 KB Output is correct
6 Correct 5 ms 4584 KB Output is correct
7 Correct 5 ms 4308 KB Output is correct
8 Correct 5 ms 4540 KB Output is correct
9 Correct 4 ms 4544 KB Output is correct
10 Correct 38 ms 6988 KB Output is correct
11 Correct 34 ms 7036 KB Output is correct
12 Correct 44 ms 7040 KB Output is correct
13 Correct 32 ms 7196 KB Output is correct
14 Correct 34 ms 7288 KB Output is correct
15 Correct 31 ms 7284 KB Output is correct
16 Correct 30 ms 6940 KB Output is correct
17 Correct 42 ms 7028 KB Output is correct
18 Correct 30 ms 7284 KB Output is correct
19 Correct 28 ms 6968 KB Output is correct
20 Correct 28 ms 7124 KB Output is correct
21 Correct 29 ms 7296 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 5 ms 4564 KB Output is correct
5 Correct 5 ms 4564 KB Output is correct
6 Correct 5 ms 4584 KB Output is correct
7 Correct 5 ms 4308 KB Output is correct
8 Correct 5 ms 4540 KB Output is correct
9 Correct 4 ms 4544 KB Output is correct
10 Correct 4 ms 4180 KB Output is correct
11 Correct 5 ms 4520 KB Output is correct
12 Correct 4 ms 4264 KB Output is correct
13 Correct 5 ms 4576 KB Output is correct
14 Correct 4 ms 4564 KB Output is correct
15 Correct 4 ms 4564 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 6904 KB Output is correct
2 Correct 38 ms 6976 KB Output is correct
3 Correct 36 ms 6640 KB Output is correct
4 Correct 37 ms 6948 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 5 ms 4564 KB Output is correct
12 Correct 5 ms 4564 KB Output is correct
13 Correct 5 ms 4584 KB Output is correct
14 Correct 5 ms 4308 KB Output is correct
15 Correct 5 ms 4540 KB Output is correct
16 Correct 4 ms 4544 KB Output is correct
17 Correct 38 ms 6988 KB Output is correct
18 Correct 34 ms 7036 KB Output is correct
19 Correct 44 ms 7040 KB Output is correct
20 Correct 32 ms 7196 KB Output is correct
21 Correct 34 ms 7288 KB Output is correct
22 Correct 31 ms 7284 KB Output is correct
23 Correct 30 ms 6940 KB Output is correct
24 Correct 42 ms 7028 KB Output is correct
25 Correct 30 ms 7284 KB Output is correct
26 Correct 28 ms 6968 KB Output is correct
27 Correct 28 ms 7124 KB Output is correct
28 Correct 29 ms 7296 KB Output is correct
29 Correct 4 ms 4180 KB Output is correct
30 Correct 5 ms 4520 KB Output is correct
31 Correct 4 ms 4264 KB Output is correct
32 Correct 5 ms 4576 KB Output is correct
33 Correct 4 ms 4564 KB Output is correct
34 Correct 4 ms 4564 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 32 ms 6624 KB Output is correct
37 Correct 31 ms 6980 KB Output is correct
38 Correct 41 ms 7092 KB Output is correct
39 Correct 45 ms 7412 KB Output is correct
40 Correct 33 ms 7360 KB Output is correct
41 Correct 5 ms 4564 KB Output is correct
42 Correct 31 ms 7016 KB Output is correct
43 Correct 36 ms 7288 KB Output is correct
44 Correct 34 ms 7288 KB Output is correct
45 Correct 28 ms 7056 KB Output is correct
46 Correct 29 ms 7264 KB Output is correct
47 Correct 28 ms 7276 KB Output is correct