oj.uz

Submission #829866

# Submission time Handle Problem Language Result Execution time Memory
829866 2023-08-18T15:26:24 Z Sohsoh84 Mutating DNA (IOI21_dna) C++17
100 / 100
 31 ms 8628 KB 
#include "dna.h"
#include <bits/stdc++.h>

using namespace std;

#define sep		' '
#define debug(x)	cerr << #x << ": " << x << endl;

const int MAXN = 1e6 + 10;

int n, ps[MAXN], c1[MAXN], c2[MAXN], f[MAXN][3][3];

inline int r(char x) {
	if (x == 'A') return 0;
	if (x == 'T') return 1;
	return 2;
}

void init(string a, string b) {
	n = a.size();
	a = '#' + a;
	b = '#' + b;
	
	for (int i = 1; i <= n; i++) {
		ps[i] = ps[i - 1] + (a[i] != b[i]);
		c1[i] = c1[i - 1] + (a[i] == 'A') - (b[i] == 'A');
		c2[i] = c2[i - 1] + (a[i] == 'T') - (b[i] == 'T');
		
		for (int a = 0; a < 3; a++)
			for (int b = 0; b < 3; b++)
				f[i][a][b] = f[i - 1][a][b];

		f[i][r(a[i])][r(b[i])]++;
	}
}

int get_distance(int x, int y) {
	x++;
	y++;

	if (c1[y] - c1[x - 1] || c2[y] - c2[x - 1]) return -1;

	int ans = 0;
	int ms = ps[y] - ps[x - 1];

	for (int i = 0; i < 3; i++) {
		for (int j = i + 1; j < 3; j++) {
			int c = min(f[y][i][j] - f[x - 1][i][j], f[y][j][i] - f[x - 1][j][i]);
			ms -= 2 * c;
			ans += c;
		}
	}

	ans += ms * 2 / 3;
	return ans;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 8220 KB Output is correct
2 Correct 26 ms 8216 KB Output is correct
3 Correct 26 ms 7744 KB Output is correct
4 Correct 25 ms 8216 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 340 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 304 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 4 ms 5812 KB Output is correct
5 Correct 4 ms 5828 KB Output is correct
6 Correct 4 ms 5856 KB Output is correct
7 Correct 4 ms 5460 KB Output is correct
8 Correct 4 ms 5844 KB Output is correct
9 Correct 3 ms 5844 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 304 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 4 ms 5812 KB Output is correct
5 Correct 4 ms 5828 KB Output is correct
6 Correct 4 ms 5856 KB Output is correct
7 Correct 4 ms 5460 KB Output is correct
8 Correct 4 ms 5844 KB Output is correct
9 Correct 3 ms 5844 KB Output is correct
10 Correct 25 ms 8204 KB Output is correct
11 Correct 26 ms 8220 KB Output is correct
12 Correct 26 ms 8216 KB Output is correct
13 Correct 26 ms 8244 KB Output is correct
14 Correct 27 ms 8516 KB Output is correct
15 Correct 25 ms 8476 KB Output is correct
16 Correct 26 ms 8072 KB Output is correct
17 Correct 26 ms 8204 KB Output is correct
18 Correct 26 ms 8476 KB Output is correct
19 Correct 25 ms 8144 KB Output is correct
20 Correct 25 ms 8260 KB Output is correct
21 Correct 31 ms 8472 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 304 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 4 ms 5812 KB Output is correct
5 Correct 4 ms 5828 KB Output is correct
6 Correct 4 ms 5856 KB Output is correct
7 Correct 4 ms 5460 KB Output is correct
8 Correct 4 ms 5844 KB Output is correct
9 Correct 3 ms 5844 KB Output is correct
10 Correct 4 ms 5332 KB Output is correct
11 Correct 4 ms 5828 KB Output is correct
12 Correct 4 ms 5436 KB Output is correct
13 Correct 4 ms 5844 KB Output is correct
14 Correct 4 ms 5888 KB Output is correct
15 Correct 3 ms 5844 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 8220 KB Output is correct
2 Correct 26 ms 8216 KB Output is correct
3 Correct 26 ms 7744 KB Output is correct
4 Correct 25 ms 8216 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 304 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 4 ms 5812 KB Output is correct
12 Correct 4 ms 5828 KB Output is correct
13 Correct 4 ms 5856 KB Output is correct
14 Correct 4 ms 5460 KB Output is correct
15 Correct 4 ms 5844 KB Output is correct
16 Correct 3 ms 5844 KB Output is correct
17 Correct 25 ms 8204 KB Output is correct
18 Correct 26 ms 8220 KB Output is correct
19 Correct 26 ms 8216 KB Output is correct
20 Correct 26 ms 8244 KB Output is correct
21 Correct 27 ms 8516 KB Output is correct
22 Correct 25 ms 8476 KB Output is correct
23 Correct 26 ms 8072 KB Output is correct
24 Correct 26 ms 8204 KB Output is correct
25 Correct 26 ms 8476 KB Output is correct
26 Correct 25 ms 8144 KB Output is correct
27 Correct 25 ms 8260 KB Output is correct
28 Correct 31 ms 8472 KB Output is correct
29 Correct 4 ms 5332 KB Output is correct
30 Correct 4 ms 5828 KB Output is correct
31 Correct 4 ms 5436 KB Output is correct
32 Correct 4 ms 5844 KB Output is correct
33 Correct 4 ms 5888 KB Output is correct
34 Correct 3 ms 5844 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 25 ms 7756 KB Output is correct
37 Correct 26 ms 8248 KB Output is correct
38 Correct 26 ms 8208 KB Output is correct
39 Correct 26 ms 8516 KB Output is correct
40 Correct 31 ms 8628 KB Output is correct
41 Correct 3 ms 5816 KB Output is correct
42 Correct 28 ms 8192 KB Output is correct
43 Correct 26 ms 8472 KB Output is correct
44 Correct 30 ms 8496 KB Output is correct
45 Correct 26 ms 8256 KB Output is correct
46 Correct 25 ms 8488 KB Output is correct
47 Correct 26 ms 8488 KB Output is correct