Submission #947729

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
947729	2024-03-17T00:52:20 Z	biank	Mutating DNA (IOI21_dna)	C++17	100 / 100	28 ms	6168 KB

dna

#include <bits/stdc++.h>

using namespace std;

#define sz(x) int(x.size())

const int MAX_M = 6;
const string s1 = "ACTACT";
const string s2 = "CAATTC";

vector<int> p[MAX_M];

void init(string a, string b) {
	int n = sz(a);
	for (int i = 0; i < MAX_M; i++) {
		p[i].assign(n + 1, 0);
	}
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < MAX_M; j++) {
			p[j][i + 1] = p[j][i] + (a[i] == s1[j] && b[i] == s2[j]);
		}
	}
}

int get_distance(int x, int y) {
	int cant[MAX_M];
	for (int i=0; i < MAX_M; i++) {
		cant[i] = p[i][y+1] - p[i][x];
	}
	int ans = 0;
	for (int i = 0; i < MAX_M; i += 2) {
		int moves = min(cant[i], cant[i + 1]);
		cant[i] -= moves;
		cant[i + 1] -= moves;
		ans += moves;
	}
    for (int i = 0; i < MAX_M - 2; i++) {
        if (cant[i] != cant[i + 2]) return -1;
    }
	ans += 2 * cant[0] + 2 * cant[1];
	return ans;
}

Subtask #1

21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	25 ms	4884 KB	Output is correct
2	Correct	25 ms	5396 KB	Output is correct
3	Correct	27 ms	4896 KB	Output is correct
4	Correct	25 ms	5136 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct

Subtask #2

22.0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	4 ms	3672 KB	Output is correct
5	Correct	3 ms	3448 KB	Output is correct
6	Correct	5 ms	3420 KB	Output is correct
7	Correct	3 ms	3164 KB	Output is correct
8	Correct	3 ms	3672 KB	Output is correct
9	Correct	3 ms	3212 KB	Output is correct

Subtask #3

13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	4 ms	3672 KB	Output is correct
5	Correct	3 ms	3448 KB	Output is correct
6	Correct	5 ms	3420 KB	Output is correct
7	Correct	3 ms	3164 KB	Output is correct
8	Correct	3 ms	3672 KB	Output is correct
9	Correct	3 ms	3212 KB	Output is correct
10	Correct	25 ms	5212 KB	Output is correct
11	Correct	26 ms	5392 KB	Output is correct
12	Correct	26 ms	5660 KB	Output is correct
13	Correct	26 ms	5660 KB	Output is correct
14	Correct	27 ms	5900 KB	Output is correct
15	Correct	25 ms	5076 KB	Output is correct
16	Correct	25 ms	5924 KB	Output is correct
17	Correct	26 ms	5148 KB	Output is correct
18	Correct	26 ms	5780 KB	Output is correct
19	Correct	24 ms	5916 KB	Output is correct
20	Correct	25 ms	5412 KB	Output is correct
21	Correct	25 ms	5900 KB	Output is correct

Subtask #4

28.0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	4 ms	3672 KB	Output is correct
5	Correct	3 ms	3448 KB	Output is correct
6	Correct	5 ms	3420 KB	Output is correct
7	Correct	3 ms	3164 KB	Output is correct
8	Correct	3 ms	3672 KB	Output is correct
9	Correct	3 ms	3212 KB	Output is correct
10	Correct	3 ms	3164 KB	Output is correct
11	Correct	4 ms	3516 KB	Output is correct
12	Correct	3 ms	3164 KB	Output is correct
13	Correct	3 ms	3444 KB	Output is correct
14	Correct	3 ms	3416 KB	Output is correct
15	Correct	3 ms	3420 KB	Output is correct

Subtask #5

16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	25 ms	4884 KB	Output is correct
2	Correct	25 ms	5396 KB	Output is correct
3	Correct	27 ms	4896 KB	Output is correct
4	Correct	25 ms	5136 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	4 ms	3672 KB	Output is correct
12	Correct	3 ms	3448 KB	Output is correct
13	Correct	5 ms	3420 KB	Output is correct
14	Correct	3 ms	3164 KB	Output is correct
15	Correct	3 ms	3672 KB	Output is correct
16	Correct	3 ms	3212 KB	Output is correct
17	Correct	25 ms	5212 KB	Output is correct
18	Correct	26 ms	5392 KB	Output is correct
19	Correct	26 ms	5660 KB	Output is correct
20	Correct	26 ms	5660 KB	Output is correct
21	Correct	27 ms	5900 KB	Output is correct
22	Correct	25 ms	5076 KB	Output is correct
23	Correct	25 ms	5924 KB	Output is correct
24	Correct	26 ms	5148 KB	Output is correct
25	Correct	26 ms	5780 KB	Output is correct
26	Correct	24 ms	5916 KB	Output is correct
27	Correct	25 ms	5412 KB	Output is correct
28	Correct	25 ms	5900 KB	Output is correct
29	Correct	3 ms	3164 KB	Output is correct
30	Correct	4 ms	3516 KB	Output is correct
31	Correct	3 ms	3164 KB	Output is correct
32	Correct	3 ms	3444 KB	Output is correct
33	Correct	3 ms	3416 KB	Output is correct
34	Correct	3 ms	3420 KB	Output is correct
35	Correct	0 ms	348 KB	Output is correct
36	Correct	24 ms	5412 KB	Output is correct
37	Correct	25 ms	5744 KB	Output is correct
38	Correct	27 ms	5656 KB	Output is correct
39	Correct	28 ms	5652 KB	Output is correct
40	Correct	26 ms	5912 KB	Output is correct
41	Correct	3 ms	3420 KB	Output is correct
42	Correct	25 ms	5620 KB	Output is correct
43	Correct	26 ms	5656 KB	Output is correct
44	Correct	25 ms	5912 KB	Output is correct
45	Correct	24 ms	5656 KB	Output is correct
46	Correct	24 ms	6168 KB	Output is correct
47	Correct	25 ms	5644 KB	Output is correct