oj.uz

Submission #818104

# Submission time Handle Problem Language Result Execution time Memory
818104 2023-08-10T02:17:24 Z LittleCube Mutating DNA (IOI21_dna) C++17
100 / 100
 33 ms 7816 KB 
#include "dna.h"
#include <bits/stdc++.h>
using namespace std;

int n, S[100005][3], P[100005][7], s[3], p[6];

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

int pch(char c, char d)
{
	if (c == 'A' && d == 'T')
		return 0;
	if (c == 'T' && d == 'A')
		return 1;
	if (c == 'A' && d == 'C')
		return 2;
	if (c == 'C' && d == 'A')
		return 3;
	if (c == 'C' && d == 'T')
		return 4;
	if (c == 'T' && d == 'C')
		return 5;
	return 6;
}

void init(std::string a, std::string b)
{
	n = a.size();
	a = ' ' + a;
	b = ' ' + b;
	for (int i = 1; i <= n; i++)
		S[i][ch(a[i])]++, S[i][ch(b[i])]--, P[i][pch(a[i], b[i])]++;
	for (int i = 1; i <= n; i++)
	{
		for (int j = 0; j < 3; j++)
			S[i][j] += S[i - 1][j];
		for (int j = 0; j < 6; j++)
			P[i][j] += P[i - 1][j];
	}
}

int get_distance(int x, int y)
{
	y++;
	for (int j = 0; j < 3; j++)
	{
		s[j] = S[y][j] - S[x][j];
		if (s[j])
			return -1;
	}
	for (int j = 0; j < 6; j++)
		p[j] = P[y][j] - P[x][j];
	int ans = 0;
	for (int j = 0; j < 6; j += 2)
	{
		int m = min(p[j], p[j ^ 1]);
		ans += m;
		p[j] -= m;
		p[j ^ 1] -= m;
	}
	return ans + max(p[0], p[1]) * 2;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 7380 KB Output is correct
2 Correct 29 ms 7440 KB Output is correct
3 Correct 26 ms 6932 KB Output is correct
4 Correct 27 ms 7444 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 308 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 4 ms 4948 KB Output is correct
5 Correct 4 ms 5076 KB Output is correct
6 Correct 6 ms 4948 KB Output is correct
7 Correct 4 ms 4692 KB Output is correct
8 Correct 4 ms 5076 KB Output is correct
9 Correct 4 ms 5056 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 308 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 4 ms 4948 KB Output is correct
5 Correct 4 ms 5076 KB Output is correct
6 Correct 6 ms 4948 KB Output is correct
7 Correct 4 ms 4692 KB Output is correct
8 Correct 4 ms 5076 KB Output is correct
9 Correct 4 ms 5056 KB Output is correct
10 Correct 27 ms 7404 KB Output is correct
11 Correct 27 ms 7448 KB Output is correct
12 Correct 27 ms 7432 KB Output is correct
13 Correct 27 ms 7476 KB Output is correct
14 Correct 32 ms 7708 KB Output is correct
15 Correct 26 ms 7740 KB Output is correct
16 Correct 27 ms 7308 KB Output is correct
17 Correct 28 ms 7448 KB Output is correct
18 Correct 28 ms 7684 KB Output is correct
19 Correct 27 ms 7344 KB Output is correct
20 Correct 26 ms 7532 KB Output is correct
21 Correct 31 ms 7720 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 308 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 4 ms 4948 KB Output is correct
5 Correct 4 ms 5076 KB Output is correct
6 Correct 6 ms 4948 KB Output is correct
7 Correct 4 ms 4692 KB Output is correct
8 Correct 4 ms 5076 KB Output is correct
9 Correct 4 ms 5056 KB Output is correct
10 Correct 4 ms 4692 KB Output is correct
11 Correct 5 ms 5060 KB Output is correct
12 Correct 6 ms 4692 KB Output is correct
13 Correct 6 ms 4948 KB Output is correct
14 Correct 4 ms 5076 KB Output is correct
15 Correct 4 ms 5076 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 7380 KB Output is correct
2 Correct 29 ms 7440 KB Output is correct
3 Correct 26 ms 6932 KB Output is correct
4 Correct 27 ms 7444 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 308 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 4 ms 4948 KB Output is correct
12 Correct 4 ms 5076 KB Output is correct
13 Correct 6 ms 4948 KB Output is correct
14 Correct 4 ms 4692 KB Output is correct
15 Correct 4 ms 5076 KB Output is correct
16 Correct 4 ms 5056 KB Output is correct
17 Correct 27 ms 7404 KB Output is correct
18 Correct 27 ms 7448 KB Output is correct
19 Correct 27 ms 7432 KB Output is correct
20 Correct 27 ms 7476 KB Output is correct
21 Correct 32 ms 7708 KB Output is correct
22 Correct 26 ms 7740 KB Output is correct
23 Correct 27 ms 7308 KB Output is correct
24 Correct 28 ms 7448 KB Output is correct
25 Correct 28 ms 7684 KB Output is correct
26 Correct 27 ms 7344 KB Output is correct
27 Correct 26 ms 7532 KB Output is correct
28 Correct 31 ms 7720 KB Output is correct
29 Correct 4 ms 4692 KB Output is correct
30 Correct 5 ms 5060 KB Output is correct
31 Correct 6 ms 4692 KB Output is correct
32 Correct 6 ms 4948 KB Output is correct
33 Correct 4 ms 5076 KB Output is correct
34 Correct 4 ms 5076 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 27 ms 6976 KB Output is correct
37 Correct 27 ms 7448 KB Output is correct
38 Correct 28 ms 7460 KB Output is correct
39 Correct 30 ms 7816 KB Output is correct
40 Correct 33 ms 7760 KB Output is correct
41 Correct 4 ms 5064 KB Output is correct
42 Correct 27 ms 7432 KB Output is correct
43 Correct 28 ms 7704 KB Output is correct
44 Correct 31 ms 7736 KB Output is correct
45 Correct 26 ms 7448 KB Output is correct
46 Correct 26 ms 7664 KB Output is correct
47 Correct 27 ms 7704 KB Output is correct