oj.uz

Submission #829971

# Submission time Handle Problem Language Result Execution time Memory
829971 2023-08-18T16:26:16 Z alex_2008 Mutating DNA (IOI21_dna) C++17
100 / 100
 37 ms 6752 KB 
#include "dna.h"
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
typedef long long ll;
using namespace std;
const int N = 1e5 + 10;
int cnt[N][3][3];
int f(char x) {
	if (x == 'A') return 0;
	if (x == 'C') return 1;
	return 2;
}
void init(string a, string b) {
	int n = (int)a.size();
	for (int i = 1; i <= n; i++) {
		for (int j = 0; j <= 2; j++) {
			for (int k = 0; k <= 2; k++) {
				cnt[i][j][k] = cnt[i - 1][j][k];
			}
		}
		cnt[i][f(a[i - 1])][f(b[i - 1])]++;
	}
}
int get_distance(int x, int y) {
	++x; ++y;
	int cntab = cnt[y][0][1] - cnt[x - 1][0][1], cntac = cnt[y][0][2] - cnt[x - 1][0][2],
	cntba = cnt[y][1][0] - cnt[x - 1][1][0], cntbc = cnt[y][1][2] - cnt[x - 1][1][2], 
	cntca = cnt[y][2][0] - cnt[x - 1][2][0], cntcb = cnt[y][2][1] - cnt[x - 1][2][1];
	if (cntab + cntac != cntba + cntca) return -1;
	if (cntba + cntbc != cntab + cntcb) return -1;
	if (cntca + cntcb != cntac + cntbc) return -1;
	int ans = 0;
	int u = min(cntab, cntba);
	cntab -= u; cntba -= u;
	ans += u;
	u = min(cntac, cntca);
	cntac -= u; cntca -= u;
	ans += u;
	u = min(cntbc, cntcb);
	cntbc -= u; cntcb -= u;
	ans += u;
	int l = cntab + cntac + cntba + cntbc + cntca + cntcb;
	l = 2 * l;
	l /= 3;
	ans += l;
	return ans;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 6176 KB Output is correct
2 Correct 27 ms 6152 KB Output is correct
3 Correct 31 ms 5892 KB Output is correct
4 Correct 28 ms 6228 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 304 KB Output is correct

Subtask #2
22.0 / 22.0

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

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 4 ms 4448 KB Output is correct
5 Correct 5 ms 4544 KB Output is correct
6 Correct 4 ms 4564 KB Output is correct
7 Correct 3 ms 4284 KB Output is correct
8 Correct 4 ms 4564 KB Output is correct
9 Correct 3 ms 4564 KB Output is correct
10 Correct 28 ms 6116 KB Output is correct
11 Correct 27 ms 6208 KB Output is correct
12 Correct 27 ms 6168 KB Output is correct
13 Correct 30 ms 6284 KB Output is correct
14 Correct 29 ms 6544 KB Output is correct
15 Correct 31 ms 6496 KB Output is correct
16 Correct 27 ms 6268 KB Output is correct
17 Correct 32 ms 6288 KB Output is correct
18 Correct 27 ms 6472 KB Output is correct
19 Correct 28 ms 6252 KB Output is correct
20 Correct 26 ms 6336 KB Output is correct
21 Correct 26 ms 6536 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 4 ms 4448 KB Output is correct
5 Correct 5 ms 4544 KB Output is correct
6 Correct 4 ms 4564 KB Output is correct
7 Correct 3 ms 4284 KB Output is correct
8 Correct 4 ms 4564 KB Output is correct
9 Correct 3 ms 4564 KB Output is correct
10 Correct 3 ms 4180 KB Output is correct
11 Correct 3 ms 4564 KB Output is correct
12 Correct 3 ms 4308 KB Output is correct
13 Correct 3 ms 4564 KB Output is correct
14 Correct 3 ms 4564 KB Output is correct
15 Correct 3 ms 4580 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 6176 KB Output is correct
2 Correct 27 ms 6152 KB Output is correct
3 Correct 31 ms 5892 KB Output is correct
4 Correct 28 ms 6228 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 304 KB Output is correct
8 Correct 1 ms 308 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 4 ms 4448 KB Output is correct
12 Correct 5 ms 4544 KB Output is correct
13 Correct 4 ms 4564 KB Output is correct
14 Correct 3 ms 4284 KB Output is correct
15 Correct 4 ms 4564 KB Output is correct
16 Correct 3 ms 4564 KB Output is correct
17 Correct 28 ms 6116 KB Output is correct
18 Correct 27 ms 6208 KB Output is correct
19 Correct 27 ms 6168 KB Output is correct
20 Correct 30 ms 6284 KB Output is correct
21 Correct 29 ms 6544 KB Output is correct
22 Correct 31 ms 6496 KB Output is correct
23 Correct 27 ms 6268 KB Output is correct
24 Correct 32 ms 6288 KB Output is correct
25 Correct 27 ms 6472 KB Output is correct
26 Correct 28 ms 6252 KB Output is correct
27 Correct 26 ms 6336 KB Output is correct
28 Correct 26 ms 6536 KB Output is correct
29 Correct 3 ms 4180 KB Output is correct
30 Correct 3 ms 4564 KB Output is correct
31 Correct 3 ms 4308 KB Output is correct
32 Correct 3 ms 4564 KB Output is correct
33 Correct 3 ms 4564 KB Output is correct
34 Correct 3 ms 4580 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 26 ms 5976 KB Output is correct
37 Correct 27 ms 6276 KB Output is correct
38 Correct 34 ms 6436 KB Output is correct
39 Correct 29 ms 6656 KB Output is correct
40 Correct 30 ms 6644 KB Output is correct
41 Correct 3 ms 4564 KB Output is correct
42 Correct 32 ms 6408 KB Output is correct
43 Correct 28 ms 6664 KB Output is correct
44 Correct 27 ms 6668 KB Output is correct
45 Correct 25 ms 6440 KB Output is correct
46 Correct 26 ms 6752 KB Output is correct
47 Correct 26 ms 6724 KB Output is correct