oj.uz

Submission #443156

# Submission time Handle Problem Language Result Execution time Memory
443156 2021-07-09T21:17:29 Z wind_reaper Mutating DNA (IOI21_dna) C++17
100 / 100
 46 ms 6052 KB 
#include "dna.h"
#include <bits/stdc++.h>

using namespace std;

const int MXN = 100000;
int cnt[MXN][3][3];
int cur[3][3];

void init(string a, string b) {
	map<char, int> mp;
	mp['A'] = 0, mp['T'] = 1, mp['C'] = 2;

	int N = a.size();
	for(int i = 0; i < N; i++){
		if(i) for(int j = 0; j < 3; j++)
			for(int k = 0; k < 3; k++)
				cnt[i][j][k] = cnt[i-1][j][k];

		cnt[i][mp[a[i]]][mp[b[i]]]++;
	}
}

int get_distance(int l, int r) {
	auto get_inv = [&](int x, int y){
		return cnt[r][x][y] - (l ? cnt[l-1][x][y] : 0);
	};

	for(int i = 0; i < 3; i++)
		for(int j = 0; j < 3; j++)
			cur[i][j] = get_inv(i, j);

	int ans = 0;

	for(int i = 0; i < 3; i++){
		int j = (i + 1) % 3;
		int x = min(cur[i][j], cur[j][i]);
		cur[j][i] -= x, cur[i][j] -= x;
		ans += x;
	}

	bool pos = 1;
	for(int i = 0; i < 3; i++) pos &= (cur[i][(i + 1)%3] == cur[0][1]);
	for(int i = 0; i < 3; i++) pos &= (cur[(i + 1)%3][i] == cur[1][0]);

	if(!pos) return -1;
	return ans + 2*(cur[0][1] + cur[1][0]);
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 5632 KB Output is correct
2 Correct 40 ms 5628 KB Output is correct
3 Correct 40 ms 5360 KB Output is correct
4 Correct 41 ms 5628 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 4300 KB Output is correct
5 Correct 5 ms 4300 KB Output is correct
6 Correct 5 ms 4300 KB Output is correct
7 Correct 5 ms 4044 KB Output is correct
8 Correct 5 ms 4300 KB Output is correct
9 Correct 4 ms 4300 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 4300 KB Output is correct
5 Correct 5 ms 4300 KB Output is correct
6 Correct 5 ms 4300 KB Output is correct
7 Correct 5 ms 4044 KB Output is correct
8 Correct 5 ms 4300 KB Output is correct
9 Correct 4 ms 4300 KB Output is correct
10 Correct 42 ms 5580 KB Output is correct
11 Correct 41 ms 5640 KB Output is correct
12 Correct 41 ms 5648 KB Output is correct
13 Correct 41 ms 5756 KB Output is correct
14 Correct 42 ms 5996 KB Output is correct
15 Correct 46 ms 5892 KB Output is correct
16 Correct 40 ms 5736 KB Output is correct
17 Correct 39 ms 5884 KB Output is correct
18 Correct 40 ms 6016 KB Output is correct
19 Correct 37 ms 5736 KB Output is correct
20 Correct 38 ms 5888 KB Output is correct
21 Correct 37 ms 6020 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 4300 KB Output is correct
5 Correct 5 ms 4300 KB Output is correct
6 Correct 5 ms 4300 KB Output is correct
7 Correct 5 ms 4044 KB Output is correct
8 Correct 5 ms 4300 KB Output is correct
9 Correct 4 ms 4300 KB Output is correct
10 Correct 5 ms 3996 KB Output is correct
11 Correct 5 ms 4300 KB Output is correct
12 Correct 6 ms 4064 KB Output is correct
13 Correct 7 ms 4364 KB Output is correct
14 Correct 6 ms 4300 KB Output is correct
15 Correct 4 ms 4300 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 5632 KB Output is correct
2 Correct 40 ms 5628 KB Output is correct
3 Correct 40 ms 5360 KB Output is correct
4 Correct 41 ms 5628 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 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 4300 KB Output is correct
12 Correct 5 ms 4300 KB Output is correct
13 Correct 5 ms 4300 KB Output is correct
14 Correct 5 ms 4044 KB Output is correct
15 Correct 5 ms 4300 KB Output is correct
16 Correct 4 ms 4300 KB Output is correct
17 Correct 42 ms 5580 KB Output is correct
18 Correct 41 ms 5640 KB Output is correct
19 Correct 41 ms 5648 KB Output is correct
20 Correct 41 ms 5756 KB Output is correct
21 Correct 42 ms 5996 KB Output is correct
22 Correct 46 ms 5892 KB Output is correct
23 Correct 40 ms 5736 KB Output is correct
24 Correct 39 ms 5884 KB Output is correct
25 Correct 40 ms 6016 KB Output is correct
26 Correct 37 ms 5736 KB Output is correct
27 Correct 38 ms 5888 KB Output is correct
28 Correct 37 ms 6020 KB Output is correct
29 Correct 5 ms 3996 KB Output is correct
30 Correct 5 ms 4300 KB Output is correct
31 Correct 6 ms 4064 KB Output is correct
32 Correct 7 ms 4364 KB Output is correct
33 Correct 6 ms 4300 KB Output is correct
34 Correct 4 ms 4300 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 42 ms 5304 KB Output is correct
37 Correct 42 ms 5640 KB Output is correct
38 Correct 41 ms 5752 KB Output is correct
39 Correct 42 ms 6012 KB Output is correct
40 Correct 42 ms 6016 KB Output is correct
41 Correct 6 ms 4300 KB Output is correct
42 Correct 39 ms 5752 KB Output is correct
43 Correct 40 ms 6012 KB Output is correct
44 Correct 40 ms 6052 KB Output is correct
45 Correct 40 ms 5744 KB Output is correct
46 Correct 40 ms 6016 KB Output is correct
47 Correct 38 ms 6052 KB Output is correct