oj.uz

Submission #636747

# Submission time Handle Problem Language Result Execution time Memory
636747 2022-08-30T02:35:15 Z imeimi2000 Mutating DNA (IOI21_dna) C++17
100 / 100
 41 ms 7364 KB 
#include "dna.h"
#include <cstring>
#include <algorithm>

using namespace std;

int n;
int cnt[100005][3][3];
void init(string a, string b) {
	n = a.size();
	int C[256];
	C['A'] = 0;
	C['C'] = 1;
	C['T'] = 2;
	for (int i = 1; i <= n; ++i) {
		memcpy(cnt[i], cnt[i - 1], sizeof(cnt[i]));
		++cnt[i][C[a[i - 1]]][C[b[i - 1]]];
	}
}

int get_distance(int x, int y) {
	int D[3][3];
	memcpy(D, cnt[y + 1], sizeof(D));
	for (int i = 0; i < 3; ++i) for (int j = 0; j < 3; ++j) D[i][j] -= cnt[x][i][j];
	int ans = 0;
	for (int i = 0; i < 3; ++i) {
		for (int j = i + 1; j < 3; ++j) {
			int v = min(D[i][j], D[j][i]);
			ans += v;
			D[i][j] -= v;
			D[j][i] -= v;
		}
	}
	int v = min({ D[0][1], D[1][2], D[2][0] });
	D[0][1] -= v;
	D[1][2] -= v;
	D[2][0] -= v;
	ans += v + v;
	v = min({ D[1][0], D[2][1], D[0][2] });
	D[1][0] -= v;
	D[2][1] -= v;
	D[0][2] -= v;
	ans += v + v;
	for (int i = 0; i < 3; ++i) for (int j = 0; j < 3; ++j) if (i != j && D[i][j]) return -1;
	return ans;
}

Compilation message

dna.cpp: In function 'void init(std::string, std::string)':
dna.cpp:17:22: warning: array subscript has type 'char' [-Wchar-subscripts]
   17 |   ++cnt[i][C[a[i - 1]]][C[b[i - 1]]];
      |                      ^
dna.cpp:17:35: warning: array subscript has type 'char' [-Wchar-subscripts]
   17 |   ++cnt[i][C[a[i - 1]]][C[b[i - 1]]];
      |                                   ^

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 6944 KB Output is correct
2 Correct 34 ms 7048 KB Output is correct
3 Correct 33 ms 6608 KB Output is correct
4 Correct 34 ms 6968 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 0 ms 296 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 4 ms 4484 KB Output is correct
5 Correct 3 ms 4532 KB Output is correct
6 Correct 4 ms 4524 KB Output is correct
7 Correct 4 ms 4300 KB Output is correct
8 Correct 4 ms 4532 KB Output is correct
9 Correct 4 ms 4532 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 0 ms 296 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 4 ms 4484 KB Output is correct
5 Correct 3 ms 4532 KB Output is correct
6 Correct 4 ms 4524 KB Output is correct
7 Correct 4 ms 4300 KB Output is correct
8 Correct 4 ms 4532 KB Output is correct
9 Correct 4 ms 4532 KB Output is correct
10 Correct 41 ms 6924 KB Output is correct
11 Correct 34 ms 7008 KB Output is correct
12 Correct 33 ms 6996 KB Output is correct
13 Correct 33 ms 7088 KB Output is correct
14 Correct 33 ms 7304 KB Output is correct
15 Correct 37 ms 7312 KB Output is correct
16 Correct 32 ms 6932 KB Output is correct
17 Correct 33 ms 7016 KB Output is correct
18 Correct 35 ms 7276 KB Output is correct
19 Correct 30 ms 6992 KB Output is correct
20 Correct 34 ms 7096 KB Output is correct
21 Correct 31 ms 7264 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 0 ms 296 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 4 ms 4484 KB Output is correct
5 Correct 3 ms 4532 KB Output is correct
6 Correct 4 ms 4524 KB Output is correct
7 Correct 4 ms 4300 KB Output is correct
8 Correct 4 ms 4532 KB Output is correct
9 Correct 4 ms 4532 KB Output is correct
10 Correct 3 ms 4144 KB Output is correct
11 Correct 4 ms 4492 KB Output is correct
12 Correct 4 ms 4308 KB Output is correct
13 Correct 3 ms 4564 KB Output is correct
14 Correct 4 ms 4528 KB Output is correct
15 Correct 3 ms 4564 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 6944 KB Output is correct
2 Correct 34 ms 7048 KB Output is correct
3 Correct 33 ms 6608 KB Output is correct
4 Correct 34 ms 6968 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 0 ms 296 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 4 ms 4484 KB Output is correct
12 Correct 3 ms 4532 KB Output is correct
13 Correct 4 ms 4524 KB Output is correct
14 Correct 4 ms 4300 KB Output is correct
15 Correct 4 ms 4532 KB Output is correct
16 Correct 4 ms 4532 KB Output is correct
17 Correct 41 ms 6924 KB Output is correct
18 Correct 34 ms 7008 KB Output is correct
19 Correct 33 ms 6996 KB Output is correct
20 Correct 33 ms 7088 KB Output is correct
21 Correct 33 ms 7304 KB Output is correct
22 Correct 37 ms 7312 KB Output is correct
23 Correct 32 ms 6932 KB Output is correct
24 Correct 33 ms 7016 KB Output is correct
25 Correct 35 ms 7276 KB Output is correct
26 Correct 30 ms 6992 KB Output is correct
27 Correct 34 ms 7096 KB Output is correct
28 Correct 31 ms 7264 KB Output is correct
29 Correct 3 ms 4144 KB Output is correct
30 Correct 4 ms 4492 KB Output is correct
31 Correct 4 ms 4308 KB Output is correct
32 Correct 3 ms 4564 KB Output is correct
33 Correct 4 ms 4528 KB Output is correct
34 Correct 3 ms 4564 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 34 ms 6620 KB Output is correct
37 Correct 34 ms 7012 KB Output is correct
38 Correct 34 ms 7112 KB Output is correct
39 Correct 35 ms 7364 KB Output is correct
40 Correct 34 ms 7348 KB Output is correct
41 Correct 4 ms 4564 KB Output is correct
42 Correct 32 ms 7060 KB Output is correct
43 Correct 32 ms 7304 KB Output is correct
44 Correct 31 ms 7276 KB Output is correct
45 Correct 30 ms 7004 KB Output is correct
46 Correct 34 ms 7284 KB Output is correct
47 Correct 31 ms 7308 KB Output is correct