oj.uz

Submission #935148

# Submission time Handle Problem Language Result Execution time Memory
935148 2024-02-28T17:54:27 Z jerzyk Mutating DNA (IOI21_dna) C++17
100 / 100
 30 ms 9744 KB 
#include <bits/stdc++.h>

using namespace std;
const int N = 100 * 1000 + 7;
int sum[2][3][N], ilz[3][3][N];

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

int get_distance(int x, int y)
{
	int w, i, j, p, k, d;
	p = x + 1;
	k = y + 1;
	w = 0;
	d = k - p + 1;
	for(i = 0; i < 3; ++i)
		if(sum[0][i][k] - sum[0][i][p - 1] != sum[1][i][k] - sum[1][i][p - 1])
			return -1;
	for(i = 0; i < 3; ++i)
	{
		for(j = 0; j <= i; ++j)
		{
			if(i == j)
			{
				d -= min(ilz[i][j][k] - ilz[i][j][p - 1], ilz[j][i][k] - ilz[j][i][p - 1]);
			}
			else
			{
				d -= 2 * min(ilz[i][j][k] - ilz[i][j][p - 1], ilz[j][i][k] - ilz[j][i][p - 1]);
				w += min(ilz[i][j][k] - ilz[i][j][p - 1], ilz[j][i][k] - ilz[j][i][p - 1]);
			}
		}
	}
	return w + (d * 2 / 3);
}

void init(string a, string b)
{
	int i, k, j, n1, n2;
	for(i = 1; i <= (int)a.size(); ++i)
	{
		n1 = Num(a[i - 1]);
		n2 = Num(b[i - 1]);
		++sum[0][n1][i];
		++sum[1][n2][i];
		++ilz[n1][n2][i];
		for(j = 0; j < 3; ++j)
		{
			sum[0][j][i] += sum[0][j][i - 1];
			sum[1][j][i] += sum[1][j][i - 1];
		}
		for(j = 0; j < 3; ++j)
			for(k = 0; k < 3; ++k)
				ilz[j][k][i] += ilz[j][k][i - 1];
	}
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 8272 KB Output is correct
2 Correct 27 ms 8784 KB Output is correct
3 Correct 27 ms 8480 KB Output is correct
4 Correct 27 ms 8616 KB Output is correct
5 Correct 1 ms 4440 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 2492 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 4 ms 6748 KB Output is correct
5 Correct 4 ms 6744 KB Output is correct
6 Correct 3 ms 6748 KB Output is correct
7 Correct 3 ms 6812 KB Output is correct
8 Correct 4 ms 6852 KB Output is correct
9 Correct 4 ms 6800 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 4 ms 6748 KB Output is correct
5 Correct 4 ms 6744 KB Output is correct
6 Correct 3 ms 6748 KB Output is correct
7 Correct 3 ms 6812 KB Output is correct
8 Correct 4 ms 6852 KB Output is correct
9 Correct 4 ms 6800 KB Output is correct
10 Correct 27 ms 8732 KB Output is correct
11 Correct 27 ms 8976 KB Output is correct
12 Correct 27 ms 9248 KB Output is correct
13 Correct 28 ms 8984 KB Output is correct
14 Correct 28 ms 9496 KB Output is correct
15 Correct 26 ms 8464 KB Output is correct
16 Correct 28 ms 9248 KB Output is correct
17 Correct 30 ms 8740 KB Output is correct
18 Correct 28 ms 9500 KB Output is correct
19 Correct 27 ms 9504 KB Output is correct
20 Correct 25 ms 8984 KB Output is correct
21 Correct 26 ms 9224 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 4 ms 6748 KB Output is correct
5 Correct 4 ms 6744 KB Output is correct
6 Correct 3 ms 6748 KB Output is correct
7 Correct 3 ms 6812 KB Output is correct
8 Correct 4 ms 6852 KB Output is correct
9 Correct 4 ms 6800 KB Output is correct
10 Correct 4 ms 6748 KB Output is correct
11 Correct 4 ms 7000 KB Output is correct
12 Correct 4 ms 6492 KB Output is correct
13 Correct 4 ms 6844 KB Output is correct
14 Correct 5 ms 6748 KB Output is correct
15 Correct 4 ms 6952 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 8272 KB Output is correct
2 Correct 27 ms 8784 KB Output is correct
3 Correct 27 ms 8480 KB Output is correct
4 Correct 27 ms 8616 KB Output is correct
5 Correct 1 ms 4440 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 2492 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4440 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 4 ms 6748 KB Output is correct
12 Correct 4 ms 6744 KB Output is correct
13 Correct 3 ms 6748 KB Output is correct
14 Correct 3 ms 6812 KB Output is correct
15 Correct 4 ms 6852 KB Output is correct
16 Correct 4 ms 6800 KB Output is correct
17 Correct 27 ms 8732 KB Output is correct
18 Correct 27 ms 8976 KB Output is correct
19 Correct 27 ms 9248 KB Output is correct
20 Correct 28 ms 8984 KB Output is correct
21 Correct 28 ms 9496 KB Output is correct
22 Correct 26 ms 8464 KB Output is correct
23 Correct 28 ms 9248 KB Output is correct
24 Correct 30 ms 8740 KB Output is correct
25 Correct 28 ms 9500 KB Output is correct
26 Correct 27 ms 9504 KB Output is correct
27 Correct 25 ms 8984 KB Output is correct
28 Correct 26 ms 9224 KB Output is correct
29 Correct 4 ms 6748 KB Output is correct
30 Correct 4 ms 7000 KB Output is correct
31 Correct 4 ms 6492 KB Output is correct
32 Correct 4 ms 6844 KB Output is correct
33 Correct 5 ms 6748 KB Output is correct
34 Correct 4 ms 6952 KB Output is correct
35 Correct 1 ms 2396 KB Output is correct
36 Correct 26 ms 8692 KB Output is correct
37 Correct 26 ms 9232 KB Output is correct
38 Correct 28 ms 9176 KB Output is correct
39 Correct 29 ms 8972 KB Output is correct
40 Correct 29 ms 9532 KB Output is correct
41 Correct 3 ms 7000 KB Output is correct
42 Correct 27 ms 9252 KB Output is correct
43 Correct 27 ms 9232 KB Output is correct
44 Correct 29 ms 9492 KB Output is correct
45 Correct 26 ms 9208 KB Output is correct
46 Correct 29 ms 9744 KB Output is correct
47 Correct 27 ms 9232 KB Output is correct