답안 #493163

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
493163	2021-12-10T07:56:13 Z	zhougz	DNA 돌연변이 (IOI21_dna)	C++17	100 / 100	51 ms	7360 KB

dna

#include "dna.h"

#include <bits/stdc++.h>

using namespace std;

int pre[100'050][3][3];

void init(std::string a, std::string b) {
	assert(a.length() == b.length());
	const int n = a.length();
	auto id = [](char c) -> int {
		return (c == 'A' ? 0 : (c == 'C' ? 1 : 2));
	};
	for (int i = 1; i <= n; i++) {
		for (int j = 0; j < 3; j++) {
			for (int k = 0; k < 3; k++) {
				pre[i][j][k] += pre[i - 1][j][k];
			}
		}
		pre[i][id(a[i - 1])][id(b[i - 1])]++;
	}
}

int get_distance(int x, int y) {
	int arr[3][3], diff[3];
	fill(diff, diff + 3, 0);
	for (int j = 0; j < 3; j++) {
		for (int k = 0; k < 3; k++) {
			arr[j][k] = pre[y + 1][j][k] - pre[x][j][k];
			diff[j] += arr[j][k];
			diff[k] -= arr[j][k];
		}
	}
	for (int i = 0; i < 3; i++) {
		if (diff[i] != 0) {
			return -1;
		}
	}
	int res = 0;
	// Swap pairs first
	for (int j = 0; j < 3; j++) {
		for (int k = 0; k < j; k++) {
			int pair_swaps = min(arr[j][k], arr[k][j]);
			arr[j][k] -= pair_swaps;
			arr[k][j] -= pair_swaps;
			res += pair_swaps;
		}
	}
	// I believe over here there are left with only triplets
	// Furthermore the frequency that A, C, T appears should be equal
	int triplet_swaps = max(arr[0][1], arr[1][0]);
	assert(triplet_swaps == max(arr[0][2], arr[2][0]) && triplet_swaps == max(arr[1][2], arr[2][1]));
	res += 2 * triplet_swaps;
	return res;
}

Subtask #1

21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	38 ms	6916 KB	Output is correct
2	Correct	36 ms	7040 KB	Output is correct
3	Correct	35 ms	6676 KB	Output is correct
4	Correct	33 ms	7032 KB	Output is correct
5	Correct	1 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

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	5 ms	4556 KB	Output is correct
5	Correct	5 ms	4556 KB	Output is correct
6	Correct	4 ms	4572 KB	Output is correct
7	Correct	4 ms	4284 KB	Output is correct
8	Correct	5 ms	4556 KB	Output is correct
9	Correct	3 ms	4540 KB	Output is correct

Subtask #3

13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	5 ms	4556 KB	Output is correct
5	Correct	5 ms	4556 KB	Output is correct
6	Correct	4 ms	4572 KB	Output is correct
7	Correct	4 ms	4284 KB	Output is correct
8	Correct	5 ms	4556 KB	Output is correct
9	Correct	3 ms	4540 KB	Output is correct
10	Correct	34 ms	6892 KB	Output is correct
11	Correct	35 ms	6968 KB	Output is correct
12	Correct	41 ms	7052 KB	Output is correct
13	Correct	37 ms	7192 KB	Output is correct
14	Correct	35 ms	7360 KB	Output is correct
15	Correct	43 ms	7296 KB	Output is correct
16	Correct	34 ms	6988 KB	Output is correct
17	Correct	35 ms	7032 KB	Output is correct
18	Correct	40 ms	7276 KB	Output is correct
19	Correct	30 ms	7016 KB	Output is correct
20	Correct	33 ms	7116 KB	Output is correct
21	Correct	38 ms	7264 KB	Output is correct

Subtask #4

28.0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	5 ms	4556 KB	Output is correct
5	Correct	5 ms	4556 KB	Output is correct
6	Correct	4 ms	4572 KB	Output is correct
7	Correct	4 ms	4284 KB	Output is correct
8	Correct	5 ms	4556 KB	Output is correct
9	Correct	3 ms	4540 KB	Output is correct
10	Correct	4 ms	4172 KB	Output is correct
11	Correct	5 ms	4556 KB	Output is correct
12	Correct	4 ms	4252 KB	Output is correct
13	Correct	4 ms	4556 KB	Output is correct
14	Correct	4 ms	4556 KB	Output is correct
15	Correct	4 ms	4556 KB	Output is correct

Subtask #5

16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	38 ms	6916 KB	Output is correct
2	Correct	36 ms	7040 KB	Output is correct
3	Correct	35 ms	6676 KB	Output is correct
4	Correct	33 ms	7032 KB	Output is correct
5	Correct	1 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	0 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	5 ms	4556 KB	Output is correct
12	Correct	5 ms	4556 KB	Output is correct
13	Correct	4 ms	4572 KB	Output is correct
14	Correct	4 ms	4284 KB	Output is correct
15	Correct	5 ms	4556 KB	Output is correct
16	Correct	3 ms	4540 KB	Output is correct
17	Correct	34 ms	6892 KB	Output is correct
18	Correct	35 ms	6968 KB	Output is correct
19	Correct	41 ms	7052 KB	Output is correct
20	Correct	37 ms	7192 KB	Output is correct
21	Correct	35 ms	7360 KB	Output is correct
22	Correct	43 ms	7296 KB	Output is correct
23	Correct	34 ms	6988 KB	Output is correct
24	Correct	35 ms	7032 KB	Output is correct
25	Correct	40 ms	7276 KB	Output is correct
26	Correct	30 ms	7016 KB	Output is correct
27	Correct	33 ms	7116 KB	Output is correct
28	Correct	38 ms	7264 KB	Output is correct
29	Correct	4 ms	4172 KB	Output is correct
30	Correct	5 ms	4556 KB	Output is correct
31	Correct	4 ms	4252 KB	Output is correct
32	Correct	4 ms	4556 KB	Output is correct
33	Correct	4 ms	4556 KB	Output is correct
34	Correct	4 ms	4556 KB	Output is correct
35	Correct	0 ms	204 KB	Output is correct
36	Correct	35 ms	6656 KB	Output is correct
37	Correct	45 ms	7016 KB	Output is correct
38	Correct	35 ms	7128 KB	Output is correct
39	Correct	39 ms	7320 KB	Output is correct
40	Correct	34 ms	7328 KB	Output is correct
41	Correct	5 ms	4556 KB	Output is correct
42	Correct	49 ms	7032 KB	Output is correct
43	Correct	48 ms	7280 KB	Output is correct
44	Correct	33 ms	7256 KB	Output is correct
45	Correct	32 ms	7052 KB	Output is correct
46	Correct	33 ms	7316 KB	Output is correct
47	Correct	51 ms	7344 KB	Output is correct