Submission #774727

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
774727	2023-07-06T02:16:19 Z	SanguineChameleon	Mutating DNA (IOI21_dna)	C++17	100 / 100	32 ms	8584 KB

dna

#include "dna.h"
#include <bits/stdc++.h>
using namespace std;

const int maxn = 1e5 + 20;
int diff[maxn][3];
int cnt[maxn][3][3];

void init(string a, string b) {
	int n = a.size();
	for (int i = 1; i <= n; i++) {
		for (int x = 0; x < 3; x++) {
			diff[i][x] = diff[i - 1][x];
			for (int y = 0; y < 3; y++) {
				cnt[i][x][y] = cnt[i - 1][x][y];
			}
		}
		int x = a[i - 1] == 'A' ? 0 : a[i - 1] == 'T' ? 1 : 2;
		int y = b[i - 1] == 'A' ? 0 : b[i - 1] == 'T' ? 1 : 2;
		cnt[i][x][y]++;
		diff[i][x]++;
		diff[i][y]--;
	}
}

int get_distance(int lt, int rt) {
	lt++;
	rt++;
	for (int x = 0; x < 3; x++) {
		if (diff[rt][x] != diff[lt - 1][x]) {
			return -1;
		}
	}
	int res = 0;
	for (int x = 0; x < 3; x++) {
		for (int y = x + 1; y < 3; y++) {
			res += min(cnt[rt][x][y] - cnt[lt - 1][x][y], cnt[rt][y][x] - cnt[lt - 1][y][x]);
		}
	}
	res += abs((cnt[rt][0][1] - cnt[lt - 1][0][1]) - (cnt[rt][1][0] - cnt[lt - 1][1][0])) * 2;
	return res;
}

Subtask #1

21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	25 ms	8076 KB	Output is correct
2	Correct	26 ms	8188 KB	Output is correct
3	Correct	28 ms	7716 KB	Output is correct
4	Correct	25 ms	8188 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct

Subtask #2

22.0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	304 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	4 ms	5716 KB	Output is correct
5	Correct	4 ms	5696 KB	Output is correct
6	Correct	4 ms	5716 KB	Output is correct
7	Correct	4 ms	5332 KB	Output is correct
8	Correct	4 ms	5716 KB	Output is correct
9	Correct	3 ms	5716 KB	Output is correct

Subtask #3

13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	304 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	4 ms	5716 KB	Output is correct
5	Correct	4 ms	5696 KB	Output is correct
6	Correct	4 ms	5716 KB	Output is correct
7	Correct	4 ms	5332 KB	Output is correct
8	Correct	4 ms	5716 KB	Output is correct
9	Correct	3 ms	5716 KB	Output is correct
10	Correct	26 ms	8164 KB	Output is correct
11	Correct	26 ms	8184 KB	Output is correct
12	Correct	27 ms	8164 KB	Output is correct
13	Correct	26 ms	8212 KB	Output is correct
14	Correct	32 ms	8460 KB	Output is correct
15	Correct	25 ms	8448 KB	Output is correct
16	Correct	26 ms	8052 KB	Output is correct
17	Correct	26 ms	8196 KB	Output is correct
18	Correct	26 ms	8436 KB	Output is correct
19	Correct	25 ms	8044 KB	Output is correct
20	Correct	25 ms	8308 KB	Output is correct
21	Correct	25 ms	8456 KB	Output is correct

Subtask #4

28.0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	304 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	4 ms	5716 KB	Output is correct
5	Correct	4 ms	5696 KB	Output is correct
6	Correct	4 ms	5716 KB	Output is correct
7	Correct	4 ms	5332 KB	Output is correct
8	Correct	4 ms	5716 KB	Output is correct
9	Correct	3 ms	5716 KB	Output is correct
10	Correct	4 ms	5204 KB	Output is correct
11	Correct	4 ms	5728 KB	Output is correct
12	Correct	4 ms	5336 KB	Output is correct
13	Correct	4 ms	5696 KB	Output is correct
14	Correct	4 ms	5732 KB	Output is correct
15	Correct	4 ms	5716 KB	Output is correct

Subtask #5

16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	25 ms	8076 KB	Output is correct
2	Correct	26 ms	8188 KB	Output is correct
3	Correct	28 ms	7716 KB	Output is correct
4	Correct	25 ms	8188 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	304 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	4 ms	5716 KB	Output is correct
12	Correct	4 ms	5696 KB	Output is correct
13	Correct	4 ms	5716 KB	Output is correct
14	Correct	4 ms	5332 KB	Output is correct
15	Correct	4 ms	5716 KB	Output is correct
16	Correct	3 ms	5716 KB	Output is correct
17	Correct	26 ms	8164 KB	Output is correct
18	Correct	26 ms	8184 KB	Output is correct
19	Correct	27 ms	8164 KB	Output is correct
20	Correct	26 ms	8212 KB	Output is correct
21	Correct	32 ms	8460 KB	Output is correct
22	Correct	25 ms	8448 KB	Output is correct
23	Correct	26 ms	8052 KB	Output is correct
24	Correct	26 ms	8196 KB	Output is correct
25	Correct	26 ms	8436 KB	Output is correct
26	Correct	25 ms	8044 KB	Output is correct
27	Correct	25 ms	8308 KB	Output is correct
28	Correct	25 ms	8456 KB	Output is correct
29	Correct	4 ms	5204 KB	Output is correct
30	Correct	4 ms	5728 KB	Output is correct
31	Correct	4 ms	5336 KB	Output is correct
32	Correct	4 ms	5696 KB	Output is correct
33	Correct	4 ms	5732 KB	Output is correct
34	Correct	4 ms	5716 KB	Output is correct
35	Correct	1 ms	308 KB	Output is correct
36	Correct	25 ms	7712 KB	Output is correct
37	Correct	25 ms	8148 KB	Output is correct
38	Correct	26 ms	8232 KB	Output is correct
39	Correct	27 ms	8584 KB	Output is correct
40	Correct	27 ms	8584 KB	Output is correct
41	Correct	3 ms	5716 KB	Output is correct
42	Correct	31 ms	8144 KB	Output is correct
43	Correct	25 ms	8484 KB	Output is correct
44	Correct	27 ms	8456 KB	Output is correct
45	Correct	28 ms	8188 KB	Output is correct
46	Correct	26 ms	8464 KB	Output is correct
47	Correct	25 ms	8436 KB	Output is correct