oj.uz

Submission #437361

# Submission time Handle Problem Language Result Execution time Memory
437361 2021-06-26T08:20:07 Z m_bezrutchka Mutating DNA (IOI21_dna) C++17
100 / 100
 70 ms 9508 KB 
#include "dna.h"
#include <cstdio>
#include <algorithm>
using namespace std;

const int MAXN = 112345;

int char_to_int(char c) {
	if (c == 'A') return 0;
	if (c == 'C') return 1;
	return 2;
}

char int_to_char(int x) {
	if (x == 0) return 'A';
	if (x == 1) return 'C';
	return 'T';
}

int occur[2][3][MAXN];
int diff[MAXN];
int tot_pairs[3][3][MAXN];
int n;

void init(string a, string b) {
	// printf("%s\n%s\n", a.c_str(), b.c_str());
	// printf("init started\n");
	n = (int) a.size();
	for (int i = 1; i <= n; i++) {
		for (int k = 0; k < 3; k++) {
			occur[0][k][i] = occur[0][k][i - 1];
			occur[1][k][i] = occur[1][k][i - 1];
			for (int r = 0; r < 3; r++) {
				for (int s = 0; s < 3; s++) {
					tot_pairs[r][s][i] = tot_pairs[r][s][i - 1];
				}
			}
		}

		int val_a = char_to_int(a[i - 1]);
		occur[0][val_a][i]++;

		int val_b = char_to_int(b[i - 1]);
		occur[1][val_b][i]++;

		tot_pairs[val_a][val_b][i]++;

		if (val_a != val_b) {
			diff[i] = diff[i - 1] + 1;
		} else {
			diff[i] = diff[i - 1];
		}
	}
	/* printf("init finished\n");

	printf("occur:\n");
	for (int s = 0; s < 2; s++) {
		for (int k = 0; k < 3; k++) {
			printf("%d %c: ", s, int_to_char(k));
			for (int i = 1; i <= n; i++) {
				printf("%d ", occur[s][k][i]);
			}
			printf("\n");
		}
	}

	printf("diff:\n");
	for (int i = 1; i <= n; i++) {
		printf("%d ", diff[i]);
	}
	printf("\n");

	printf("tot_pairs:\n");
	for (int i = 1; i <= n; i++) {
		printf("i = %d\n", i);
		printf("  %c %c %c\n", int_to_char(0), int_to_char(1), int_to_char(2));
		for (int r = 0; r < 3; r++) {
			printf("%c ", int_to_char(r));
			for (int s = 0; s < 3; s++) {
				printf("%d ", tot_pairs[r][s][i]);
			}
			printf("\n");
		}
		printf("\n\n");
	} */
}

int get_distance(int x, int y) {
	x++; y++;
	for (int k = 0; k < 3; k++) {
		int count_a = occur[0][k][y] - occur[0][k][x - 1];
		int count_b = occur[1][k][y] - occur[1][k][x - 1];
		if (count_a != count_b) {
			return -1;
		}
	}

	int num_diff = diff[y] - diff[x - 1];
	int num_pairs = 0;
	for (int r = 0; r < 3; r++) {
		for (int s = r + 1; s < 3; s++) {
			int r_to_s = tot_pairs[r][s][y] - tot_pairs[r][s][x - 1];
			int s_to_r = tot_pairs[s][r][y] - tot_pairs[s][r][x - 1];
			num_pairs += min(r_to_s, s_to_r);
		}
	}
	int num_triples = (num_diff - 2 * num_pairs) / 3;
	// printf("%d %d %d\n", num_diff, num_pairs, num_triples);
	return num_pairs + 2 * num_triples;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 9312 KB Output is correct
2 Correct 54 ms 9304 KB Output is correct
3 Correct 54 ms 8720 KB Output is correct
4 Correct 54 ms 9344 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 8 ms 7244 KB Output is correct
5 Correct 9 ms 7276 KB Output is correct
6 Correct 8 ms 7244 KB Output is correct
7 Correct 8 ms 6860 KB Output is correct
8 Correct 9 ms 7372 KB Output is correct
9 Correct 8 ms 7372 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 8 ms 7244 KB Output is correct
5 Correct 9 ms 7276 KB Output is correct
6 Correct 8 ms 7244 KB Output is correct
7 Correct 8 ms 6860 KB Output is correct
8 Correct 9 ms 7372 KB Output is correct
9 Correct 8 ms 7372 KB Output is correct
10 Correct 70 ms 9220 KB Output is correct
11 Correct 54 ms 9344 KB Output is correct
12 Correct 54 ms 9208 KB Output is correct
13 Correct 55 ms 9028 KB Output is correct
14 Correct 62 ms 9344 KB Output is correct
15 Correct 57 ms 9360 KB Output is correct
16 Correct 47 ms 8972 KB Output is correct
17 Correct 48 ms 9020 KB Output is correct
18 Correct 64 ms 9476 KB Output is correct
19 Correct 44 ms 8920 KB Output is correct
20 Correct 43 ms 9152 KB Output is correct
21 Correct 45 ms 9392 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 8 ms 7244 KB Output is correct
5 Correct 9 ms 7276 KB Output is correct
6 Correct 8 ms 7244 KB Output is correct
7 Correct 8 ms 6860 KB Output is correct
8 Correct 9 ms 7372 KB Output is correct
9 Correct 8 ms 7372 KB Output is correct
10 Correct 8 ms 6736 KB Output is correct
11 Correct 11 ms 7372 KB Output is correct
12 Correct 9 ms 6888 KB Output is correct
13 Correct 10 ms 7372 KB Output is correct
14 Correct 10 ms 7372 KB Output is correct
15 Correct 8 ms 7372 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 9312 KB Output is correct
2 Correct 54 ms 9304 KB Output is correct
3 Correct 54 ms 8720 KB Output is correct
4 Correct 54 ms 9344 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 8 ms 7244 KB Output is correct
12 Correct 9 ms 7276 KB Output is correct
13 Correct 8 ms 7244 KB Output is correct
14 Correct 8 ms 6860 KB Output is correct
15 Correct 9 ms 7372 KB Output is correct
16 Correct 8 ms 7372 KB Output is correct
17 Correct 70 ms 9220 KB Output is correct
18 Correct 54 ms 9344 KB Output is correct
19 Correct 54 ms 9208 KB Output is correct
20 Correct 55 ms 9028 KB Output is correct
21 Correct 62 ms 9344 KB Output is correct
22 Correct 57 ms 9360 KB Output is correct
23 Correct 47 ms 8972 KB Output is correct
24 Correct 48 ms 9020 KB Output is correct
25 Correct 64 ms 9476 KB Output is correct
26 Correct 44 ms 8920 KB Output is correct
27 Correct 43 ms 9152 KB Output is correct
28 Correct 45 ms 9392 KB Output is correct
29 Correct 8 ms 6736 KB Output is correct
30 Correct 11 ms 7372 KB Output is correct
31 Correct 9 ms 6888 KB Output is correct
32 Correct 10 ms 7372 KB Output is correct
33 Correct 10 ms 7372 KB Output is correct
34 Correct 8 ms 7372 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 50 ms 8592 KB Output is correct
37 Correct 51 ms 9124 KB Output is correct
38 Correct 52 ms 9100 KB Output is correct
39 Correct 55 ms 9444 KB Output is correct
40 Correct 54 ms 9508 KB Output is correct
41 Correct 8 ms 7344 KB Output is correct
42 Correct 47 ms 9100 KB Output is correct
43 Correct 51 ms 9508 KB Output is correct
44 Correct 52 ms 9444 KB Output is correct
45 Correct 43 ms 9176 KB Output is correct
46 Correct 44 ms 9508 KB Output is correct
47 Correct 43 ms 9508 KB Output is correct