oj.uz

Submission #437655

# Submission time Handle Problem Language Result Execution time Memory
437655 2021-06-26T18:21:09 Z PinkRabbit Mutating DNA (IOI21_dna) C++17
100 / 100
 57 ms 6256 KB 
// PinkRabbit

#include "dna.h"
#include <algorithm>
#include <string>
#include <map>

const int MN = 100005;

int N;
char a[MN], b[MN];
int sum[MN][3][3];

void init(std::string t_a, std::string t_b) {
	N = (int)t_a.length();
	for (int i = 1; i <= N; ++i)
		a[i] = t_a[i - 1],
		b[i] = t_b[i - 1];
	
	std::map<char, int> mp;
	mp['A'] = 0;
	mp['T'] = 1;
	mp['C'] = 2;
	
	for (int i = 1; i <= N; ++i) {
		for (int j1 = 0; j1 < 3; ++j1)
			for (int j2 = 0; j2 < 3; ++j2)
				sum[i][j1][j2] = sum[i - 1][j1][j2];
		int c1 = mp[a[i]];
		int c2 = mp[b[i]];
		++sum[i][c1][c2];
	}
}

int get_distance(int x, int y) {
	++x, ++y;
	int ans = y - x + 1;
	static int buk[3][3];
	for (int j1 = 0; j1 < 3; ++j1)
		for (int j2 = 0; j2 < 3; ++j2)
			buk[j1][j2] = sum[y][j1][j2] - sum[x - 1][j1][j2];
	for (int j = 0; j < 3; ++j)
		ans -= buk[j][j], buk[j][j] = 0;
	for (int j = 0; j < 3; ++j) {
		int k = (j + 1) % 3;
		int c = std::min(buk[j][k], buk[k][j]);
		ans -= c;
		buk[j][k] -= c;
		buk[k][j] -= c;
	}
	if (buk[0][1]) {
		int c = std::min({buk[0][1], buk[1][2], buk[2][0]});
		ans -= c;
		buk[0][1] -= c;
		buk[1][2] -= c;
		buk[2][0] -= c;
	} else {
		int c = std::min({buk[0][2], buk[2][1], buk[1][0]});
		ans -= c;
		buk[0][2] -= c;
		buk[2][1] -= c;
		buk[1][0] -= c;
	}
	for (int j1 = 0; j1 < 3; ++j1)
		for (int j2 = 0; j2 < 3; ++j2)
			if (buk[j1][j2])
				return -1;
	return ans;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 5768 KB Output is correct
2 Correct 43 ms 5880 KB Output is correct
3 Correct 41 ms 5420 KB Output is correct
4 Correct 44 ms 5888 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 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 1 ms 204 KB Output is correct
4 Correct 6 ms 4444 KB Output is correct
5 Correct 7 ms 4556 KB Output is correct
6 Correct 6 ms 4488 KB Output is correct
7 Correct 5 ms 4172 KB Output is correct
8 Correct 6 ms 4556 KB Output is correct
9 Correct 5 ms 4612 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 1 ms 204 KB Output is correct
4 Correct 6 ms 4444 KB Output is correct
5 Correct 7 ms 4556 KB Output is correct
6 Correct 6 ms 4488 KB Output is correct
7 Correct 5 ms 4172 KB Output is correct
8 Correct 6 ms 4556 KB Output is correct
9 Correct 5 ms 4612 KB Output is correct
10 Correct 48 ms 5768 KB Output is correct
11 Correct 50 ms 5856 KB Output is correct
12 Correct 43 ms 5852 KB Output is correct
13 Correct 43 ms 6004 KB Output is correct
14 Correct 43 ms 6184 KB Output is correct
15 Correct 42 ms 6132 KB Output is correct
16 Correct 40 ms 5900 KB Output is correct
17 Correct 44 ms 6004 KB Output is correct
18 Correct 51 ms 6144 KB Output is correct
19 Correct 40 ms 5912 KB Output is correct
20 Correct 40 ms 5996 KB Output is correct
21 Correct 40 ms 6200 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 1 ms 204 KB Output is correct
4 Correct 6 ms 4444 KB Output is correct
5 Correct 7 ms 4556 KB Output is correct
6 Correct 6 ms 4488 KB Output is correct
7 Correct 5 ms 4172 KB Output is correct
8 Correct 6 ms 4556 KB Output is correct
9 Correct 5 ms 4612 KB Output is correct
10 Correct 6 ms 4172 KB Output is correct
11 Correct 6 ms 4556 KB Output is correct
12 Correct 7 ms 4300 KB Output is correct
13 Correct 7 ms 4672 KB Output is correct
14 Correct 8 ms 4556 KB Output is correct
15 Correct 6 ms 4556 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 5768 KB Output is correct
2 Correct 43 ms 5880 KB Output is correct
3 Correct 41 ms 5420 KB Output is correct
4 Correct 44 ms 5888 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 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 1 ms 204 KB Output is correct
11 Correct 6 ms 4444 KB Output is correct
12 Correct 7 ms 4556 KB Output is correct
13 Correct 6 ms 4488 KB Output is correct
14 Correct 5 ms 4172 KB Output is correct
15 Correct 6 ms 4556 KB Output is correct
16 Correct 5 ms 4612 KB Output is correct
17 Correct 48 ms 5768 KB Output is correct
18 Correct 50 ms 5856 KB Output is correct
19 Correct 43 ms 5852 KB Output is correct
20 Correct 43 ms 6004 KB Output is correct
21 Correct 43 ms 6184 KB Output is correct
22 Correct 42 ms 6132 KB Output is correct
23 Correct 40 ms 5900 KB Output is correct
24 Correct 44 ms 6004 KB Output is correct
25 Correct 51 ms 6144 KB Output is correct
26 Correct 40 ms 5912 KB Output is correct
27 Correct 40 ms 5996 KB Output is correct
28 Correct 40 ms 6200 KB Output is correct
29 Correct 6 ms 4172 KB Output is correct
30 Correct 6 ms 4556 KB Output is correct
31 Correct 7 ms 4300 KB Output is correct
32 Correct 7 ms 4672 KB Output is correct
33 Correct 8 ms 4556 KB Output is correct
34 Correct 6 ms 4556 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 43 ms 5524 KB Output is correct
37 Correct 42 ms 5880 KB Output is correct
38 Correct 46 ms 5952 KB Output is correct
39 Correct 57 ms 6136 KB Output is correct
40 Correct 50 ms 6132 KB Output is correct
41 Correct 5 ms 4556 KB Output is correct
42 Correct 43 ms 5944 KB Output is correct
43 Correct 44 ms 6256 KB Output is correct
44 Correct 41 ms 6256 KB Output is correct
45 Correct 38 ms 6000 KB Output is correct
46 Correct 40 ms 6252 KB Output is correct
47 Correct 48 ms 6180 KB Output is correct