oj.uz

Submission #448824

# Submission time Handle Problem Language Result Execution time Memory
448824 2021-08-02T00:00:25 Z osmanallazov Mutating DNA (IOI21_dna) C++17
100 / 100
 60 ms 7412 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 48 ms 7020 KB Output is correct
2 Correct 51 ms 6980 KB Output is correct
3 Correct 56 ms 6636 KB Output is correct
4 Correct 49 ms 7024 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 300 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 5 ms 4556 KB Output is correct
5 Correct 5 ms 4556 KB Output is correct
6 Correct 5 ms 4556 KB Output is correct
7 Correct 5 ms 4340 KB Output is correct
8 Correct 5 ms 4536 KB Output is correct
9 Correct 4 ms 4556 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 5 ms 4556 KB Output is correct
5 Correct 5 ms 4556 KB Output is correct
6 Correct 5 ms 4556 KB Output is correct
7 Correct 5 ms 4340 KB Output is correct
8 Correct 5 ms 4536 KB Output is correct
9 Correct 4 ms 4556 KB Output is correct
10 Correct 49 ms 6980 KB Output is correct
11 Correct 50 ms 7016 KB Output is correct
12 Correct 56 ms 7056 KB Output is correct
13 Correct 55 ms 7220 KB Output is correct
14 Correct 55 ms 7352 KB Output is correct
15 Correct 55 ms 7296 KB Output is correct
16 Correct 56 ms 7008 KB Output is correct
17 Correct 52 ms 7156 KB Output is correct
18 Correct 52 ms 7296 KB Output is correct
19 Correct 49 ms 6956 KB Output is correct
20 Correct 51 ms 7096 KB Output is correct
21 Correct 60 ms 7284 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 5 ms 4556 KB Output is correct
5 Correct 5 ms 4556 KB Output is correct
6 Correct 5 ms 4556 KB Output is correct
7 Correct 5 ms 4340 KB Output is correct
8 Correct 5 ms 4536 KB Output is correct
9 Correct 4 ms 4556 KB Output is correct
10 Correct 4 ms 4172 KB Output is correct
11 Correct 4 ms 4560 KB Output is correct
12 Correct 5 ms 4300 KB Output is correct
13 Correct 5 ms 4536 KB Output is correct
14 Correct 5 ms 4556 KB Output is correct
15 Correct 4 ms 4532 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 7020 KB Output is correct
2 Correct 51 ms 6980 KB Output is correct
3 Correct 56 ms 6636 KB Output is correct
4 Correct 49 ms 7024 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 300 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 5 ms 4556 KB Output is correct
12 Correct 5 ms 4556 KB Output is correct
13 Correct 5 ms 4556 KB Output is correct
14 Correct 5 ms 4340 KB Output is correct
15 Correct 5 ms 4536 KB Output is correct
16 Correct 4 ms 4556 KB Output is correct
17 Correct 49 ms 6980 KB Output is correct
18 Correct 50 ms 7016 KB Output is correct
19 Correct 56 ms 7056 KB Output is correct
20 Correct 55 ms 7220 KB Output is correct
21 Correct 55 ms 7352 KB Output is correct
22 Correct 55 ms 7296 KB Output is correct
23 Correct 56 ms 7008 KB Output is correct
24 Correct 52 ms 7156 KB Output is correct
25 Correct 52 ms 7296 KB Output is correct
26 Correct 49 ms 6956 KB Output is correct
27 Correct 51 ms 7096 KB Output is correct
28 Correct 60 ms 7284 KB Output is correct
29 Correct 4 ms 4172 KB Output is correct
30 Correct 4 ms 4560 KB Output is correct
31 Correct 5 ms 4300 KB Output is correct
32 Correct 5 ms 4536 KB Output is correct
33 Correct 5 ms 4556 KB Output is correct
34 Correct 4 ms 4532 KB Output is correct
35 Correct 0 ms 332 KB Output is correct
36 Correct 59 ms 6624 KB Output is correct
37 Correct 50 ms 7000 KB Output is correct
38 Correct 53 ms 7176 KB Output is correct
39 Correct 54 ms 7412 KB Output is correct
40 Correct 57 ms 7356 KB Output is correct
41 Correct 4 ms 4556 KB Output is correct
42 Correct 53 ms 7008 KB Output is correct
43 Correct 54 ms 7276 KB Output is correct
44 Correct 52 ms 7272 KB Output is correct
45 Correct 50 ms 7052 KB Output is correct
46 Correct 50 ms 7248 KB Output is correct
47 Correct 50 ms 7280 KB Output is correct