oj.uz

Submission #828474

# Submission time Handle Problem Language Result Execution time Memory
828474 2023-08-17T10:12:18 Z TheSahib Mutating DNA (IOI21_dna) C++17
100 / 100
 31 ms 7420 KB 
#pragma GCC optimize("O3")
#include "dna.h"
#include <bits/stdc++.h>

using namespace std;

const int MAX = 1e5 + 5;

int n;
int pre[MAX][3][3];

map<char, int> mp = {{'A', 0}, {'C', 1}, {'T', 2}};

void init(string a, string b) {
	n = a.size();
	for (int i = 0; i < n; i++)
	{
		pre[i + 1][mp[a[i]]][mp[b[i]]]++;
	}
	for (int i = 1; i <= n; i++)
	{
		for (int j = 0; j < 3; j++)
		{
			for (int k = 0; k < 3; k++)
			{
				pre[i][j][k] += pre[i - 1][j][k];
			}
		}
	}
}

int get_distance(int x, int y) {
	y += 1;
	int arr[3][3];
	for (int i = 0; i < 3; i++)
	{
		for (int j = 0; j < 3; j++)
		{
			arr[i][j] = pre[y][i][j] - pre[x][i][j];
		}
	}
	for (int i = 0; i < 3; i++)
	{
		int s1 = 0, s2 = 0;
		s1 += arr[i][0] + arr[i][1] + arr[i][2];
		s2 += arr[0][i] + arr[1][i] + arr[2][i];
		if(s1 != s2){
			return -1;
		}
	}
	int s = 0, ans = 0;
	for (int i = 0; i < 3; i++)
	{
		for (int j = i + 1; j < 3; j++)
		{
			if(arr[i][j] < arr[j][i]) swap(arr[i][j], arr[j][i]);
			ans += arr[j][i];
			s += arr[i][j] - arr[j][i];
		}
	}
	ans += s / 3 * 2;
	return ans;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 6408 KB Output is correct
2 Correct 27 ms 6448 KB Output is correct
3 Correct 27 ms 6156 KB Output is correct
4 Correct 28 ms 7032 KB Output is correct
5 Correct 0 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 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 4 ms 4544 KB Output is correct
5 Correct 4 ms 4544 KB Output is correct
6 Correct 4 ms 4564 KB Output is correct
7 Correct 4 ms 4308 KB Output is correct
8 Correct 4 ms 4540 KB Output is correct
9 Correct 3 ms 4564 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 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 4 ms 4544 KB Output is correct
5 Correct 4 ms 4544 KB Output is correct
6 Correct 4 ms 4564 KB Output is correct
7 Correct 4 ms 4308 KB Output is correct
8 Correct 4 ms 4540 KB Output is correct
9 Correct 3 ms 4564 KB Output is correct
10 Correct 27 ms 6416 KB Output is correct
11 Correct 27 ms 6400 KB Output is correct
12 Correct 27 ms 6532 KB Output is correct
13 Correct 28 ms 6548 KB Output is correct
14 Correct 28 ms 6796 KB Output is correct
15 Correct 27 ms 6776 KB Output is correct
16 Correct 28 ms 6504 KB Output is correct
17 Correct 28 ms 6560 KB Output is correct
18 Correct 27 ms 6792 KB Output is correct
19 Correct 27 ms 6576 KB Output is correct
20 Correct 27 ms 6580 KB Output is correct
21 Correct 26 ms 6792 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 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 4 ms 4544 KB Output is correct
5 Correct 4 ms 4544 KB Output is correct
6 Correct 4 ms 4564 KB Output is correct
7 Correct 4 ms 4308 KB Output is correct
8 Correct 4 ms 4540 KB Output is correct
9 Correct 3 ms 4564 KB Output is correct
10 Correct 4 ms 4156 KB Output is correct
11 Correct 4 ms 4548 KB Output is correct
12 Correct 4 ms 4260 KB Output is correct
13 Correct 5 ms 4556 KB Output is correct
14 Correct 6 ms 4564 KB Output is correct
15 Correct 4 ms 4540 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 6408 KB Output is correct
2 Correct 27 ms 6448 KB Output is correct
3 Correct 27 ms 6156 KB Output is correct
4 Correct 28 ms 7032 KB Output is correct
5 Correct 0 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 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 4 ms 4544 KB Output is correct
12 Correct 4 ms 4544 KB Output is correct
13 Correct 4 ms 4564 KB Output is correct
14 Correct 4 ms 4308 KB Output is correct
15 Correct 4 ms 4540 KB Output is correct
16 Correct 3 ms 4564 KB Output is correct
17 Correct 27 ms 6416 KB Output is correct
18 Correct 27 ms 6400 KB Output is correct
19 Correct 27 ms 6532 KB Output is correct
20 Correct 28 ms 6548 KB Output is correct
21 Correct 28 ms 6796 KB Output is correct
22 Correct 27 ms 6776 KB Output is correct
23 Correct 28 ms 6504 KB Output is correct
24 Correct 28 ms 6560 KB Output is correct
25 Correct 27 ms 6792 KB Output is correct
26 Correct 27 ms 6576 KB Output is correct
27 Correct 27 ms 6580 KB Output is correct
28 Correct 26 ms 6792 KB Output is correct
29 Correct 4 ms 4156 KB Output is correct
30 Correct 4 ms 4548 KB Output is correct
31 Correct 4 ms 4260 KB Output is correct
32 Correct 5 ms 4556 KB Output is correct
33 Correct 6 ms 4564 KB Output is correct
34 Correct 4 ms 4540 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 27 ms 6648 KB Output is correct
37 Correct 31 ms 6996 KB Output is correct
38 Correct 28 ms 7144 KB Output is correct
39 Correct 29 ms 7364 KB Output is correct
40 Correct 29 ms 7420 KB Output is correct
41 Correct 3 ms 4564 KB Output is correct
42 Correct 28 ms 7016 KB Output is correct
43 Correct 28 ms 7272 KB Output is correct
44 Correct 28 ms 7276 KB Output is correct
45 Correct 26 ms 7020 KB Output is correct
46 Correct 27 ms 7312 KB Output is correct
47 Correct 26 ms 7284 KB Output is correct