oj.uz

Submission #437095

# Submission time Handle Problem Language Result Execution time Memory
437095 2021-06-25T19:05:27 Z tutis Mutating DNA (IOI21_dna) C++17
100 / 100
 72 ms 6096 KB 
#include "dna.h"
int C[3][3][100001];
void init(std::string a, std::string b) {
	int n = a.size();
	for (int i = 0; i < n; i++)
	{
		for (int x = 0; x < 3; x++)
			for (int y = 0; y < 3; y++)
				C[x][y][i + 1] = C[x][y][i];
		int c1 = 0;
		int c2 = 0;
		if (a[i] == 'A')
			c1 = 1;
		if (a[i] == 'T')
			c1 = 2;
		if (b[i] == 'A')
			c2 = 1;
		if (b[i] == 'T')
			c2 = 2;
		C[c1][c2][i + 1]++;
	}
}
#include <bits/stdc++.h>
using namespace std;
int get_distance(int x, int y) {
	int A[3][3];
	for (int a = 0; a < 3; a++)
	{
		for (int b = 0; b < 3; b++)
		{
			A[a][b] = C[a][b][y + 1] - C[a][b][x];
		}
	}
	for (int a = 0; a < 3; a++)
	{
		int bal = 0;
		for (int b = 0; b < 3; b++)
		{
			bal += A[a][b];
			bal -= A[b][a];
		}
		if (bal != 0)
			return -1;
	}
	int ans = 0;
	bool ok = true;
	while (ok)
	{
		ok = false;
		for (int x : {0, 1, 2})
		{
			for (int y : {0, 1, 2})
			{
				if (x == y)
					continue;
				int c = min({A[x][y], A[y][x]});
				A[x][y] -= c;
				A[y][x] -= c;
				ans += c;
				if (c != 0)
					ok = true;
			}
		}
		for (int x : {0, 1, 2})
		{
			for (int y : {0, 1, 2})
			{
				if (x == y)
					continue;
				int z = 3 - x - y;
				int c = min({A[x][y], A[y][z], A[z][x]});
				A[x][y] -= c;
				A[y][z] -= c;
				A[z][x] -= c;
				ans += 2 * c;
				if (c != 0)
					ok = true;
			}
		}
	}
	return ans;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 5760 KB Output is correct
2 Correct 52 ms 5628 KB Output is correct
3 Correct 48 ms 5332 KB Output is correct
4 Correct 49 ms 5628 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 6 ms 4300 KB Output is correct
5 Correct 5 ms 4300 KB Output is correct
6 Correct 5 ms 4300 KB Output is correct
7 Correct 5 ms 4052 KB Output is correct
8 Correct 7 ms 4392 KB Output is correct
9 Correct 4 ms 4300 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 6 ms 4300 KB Output is correct
5 Correct 5 ms 4300 KB Output is correct
6 Correct 5 ms 4300 KB Output is correct
7 Correct 5 ms 4052 KB Output is correct
8 Correct 7 ms 4392 KB Output is correct
9 Correct 4 ms 4300 KB Output is correct
10 Correct 66 ms 5656 KB Output is correct
11 Correct 56 ms 5632 KB Output is correct
12 Correct 55 ms 5776 KB Output is correct
13 Correct 58 ms 5900 KB Output is correct
14 Correct 57 ms 6012 KB Output is correct
15 Correct 60 ms 5888 KB Output is correct
16 Correct 53 ms 5776 KB Output is correct
17 Correct 54 ms 5880 KB Output is correct
18 Correct 54 ms 6024 KB Output is correct
19 Correct 64 ms 5784 KB Output is correct
20 Correct 72 ms 5888 KB Output is correct
21 Correct 51 ms 6012 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 6 ms 4300 KB Output is correct
5 Correct 5 ms 4300 KB Output is correct
6 Correct 5 ms 4300 KB Output is correct
7 Correct 5 ms 4052 KB Output is correct
8 Correct 7 ms 4392 KB Output is correct
9 Correct 4 ms 4300 KB Output is correct
10 Correct 5 ms 4044 KB Output is correct
11 Correct 6 ms 4300 KB Output is correct
12 Correct 5 ms 4044 KB Output is correct
13 Correct 6 ms 4272 KB Output is correct
14 Correct 6 ms 4300 KB Output is correct
15 Correct 5 ms 4300 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 5760 KB Output is correct
2 Correct 52 ms 5628 KB Output is correct
3 Correct 48 ms 5332 KB Output is correct
4 Correct 49 ms 5628 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 6 ms 4300 KB Output is correct
12 Correct 5 ms 4300 KB Output is correct
13 Correct 5 ms 4300 KB Output is correct
14 Correct 5 ms 4052 KB Output is correct
15 Correct 7 ms 4392 KB Output is correct
16 Correct 4 ms 4300 KB Output is correct
17 Correct 66 ms 5656 KB Output is correct
18 Correct 56 ms 5632 KB Output is correct
19 Correct 55 ms 5776 KB Output is correct
20 Correct 58 ms 5900 KB Output is correct
21 Correct 57 ms 6012 KB Output is correct
22 Correct 60 ms 5888 KB Output is correct
23 Correct 53 ms 5776 KB Output is correct
24 Correct 54 ms 5880 KB Output is correct
25 Correct 54 ms 6024 KB Output is correct
26 Correct 64 ms 5784 KB Output is correct
27 Correct 72 ms 5888 KB Output is correct
28 Correct 51 ms 6012 KB Output is correct
29 Correct 5 ms 4044 KB Output is correct
30 Correct 6 ms 4300 KB Output is correct
31 Correct 5 ms 4044 KB Output is correct
32 Correct 6 ms 4272 KB Output is correct
33 Correct 6 ms 4300 KB Output is correct
34 Correct 5 ms 4300 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 52 ms 5352 KB Output is correct
37 Correct 51 ms 5624 KB Output is correct
38 Correct 61 ms 5772 KB Output is correct
39 Correct 65 ms 6016 KB Output is correct
40 Correct 66 ms 6020 KB Output is correct
41 Correct 5 ms 4396 KB Output is correct
42 Correct 52 ms 5748 KB Output is correct
43 Correct 57 ms 5980 KB Output is correct
44 Correct 71 ms 6020 KB Output is correct
45 Correct 51 ms 5876 KB Output is correct
46 Correct 57 ms 6008 KB Output is correct
47 Correct 51 ms 6096 KB Output is correct