oj.uz

Submission #437155

# Submission time Handle Problem Language Result Execution time Memory
437155 2021-06-25T23:50:09 Z ScarletS Mutating DNA (IOI21_dna) C++17
100 / 100
 56 ms 4952 KB 
#include "dna.h"
#include <bits/stdc++.h>
using namespace std;

int p[6][1<<17], r[6];

void init(std::string s, std::string t) {
	int n = s.size();
	for (int i=0;i<n;++i)
	{
		for (int j=0;j<6;++j)
			p[j][i+1] = p[j][i];
		if (s[i] == 'A')
		{
			if (t[i] == 'T')
				++p[0][i+1];
			if (t[i] == 'C')
				++p[1][i+1];
		}
		if (s[i] == 'T')
		{
			if (t[i] == 'A')
				++p[2][i+1];
			if (t[i] == 'C')
				++p[3][i+1];
		}
		if (s[i] == 'C')
		{
			if (t[i] == 'A')
				++p[4][i+1];
			if (t[i] == 'T')
				++p[5][i+1];
		}
	}
}

int pair_up(int x, int y)
{
	int z = min(r[x], r[y]);
	r[x] -= z;
	r[y] -= z;
	return z;
}

int get_distance(int x, int y)
{
	int ans = 0;
	++x;
	++y;
	for (int i=0;i<6;++i)
		r[i] = p[i][y] - p[i][x-1];
	if (r[0] + r[1] != r[2] + r[4] || r[2] + r[3] != r[0] + r[5] || r[4] + r[5] != r[1] + r[3])
		return -1;
	ans += pair_up(0, 2);
	ans += pair_up(1, 4);
	ans += pair_up(3, 5);
	return ans + ((r[0] + r[1] + r[2] + r[3] + r[4] + r[5])/3)*2;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 4484 KB Output is correct
2 Correct 48 ms 4520 KB Output is correct
3 Correct 41 ms 4296 KB Output is correct
4 Correct 41 ms 4484 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 5 ms 3148 KB Output is correct
5 Correct 5 ms 3148 KB Output is correct
6 Correct 5 ms 3148 KB Output is correct
7 Correct 5 ms 3020 KB Output is correct
8 Correct 5 ms 3148 KB Output is correct
9 Correct 5 ms 3148 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 5 ms 3148 KB Output is correct
5 Correct 5 ms 3148 KB Output is correct
6 Correct 5 ms 3148 KB Output is correct
7 Correct 5 ms 3020 KB Output is correct
8 Correct 5 ms 3148 KB Output is correct
9 Correct 5 ms 3148 KB Output is correct
10 Correct 42 ms 4484 KB Output is correct
11 Correct 42 ms 4476 KB Output is correct
12 Correct 40 ms 4624 KB Output is correct
13 Correct 43 ms 4672 KB Output is correct
14 Correct 43 ms 4868 KB Output is correct
15 Correct 40 ms 4764 KB Output is correct
16 Correct 40 ms 4624 KB Output is correct
17 Correct 44 ms 4740 KB Output is correct
18 Correct 42 ms 4916 KB Output is correct
19 Correct 37 ms 4720 KB Output is correct
20 Correct 38 ms 4732 KB Output is correct
21 Correct 38 ms 4860 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 5 ms 3148 KB Output is correct
5 Correct 5 ms 3148 KB Output is correct
6 Correct 5 ms 3148 KB Output is correct
7 Correct 5 ms 3020 KB Output is correct
8 Correct 5 ms 3148 KB Output is correct
9 Correct 5 ms 3148 KB Output is correct
10 Correct 5 ms 2904 KB Output is correct
11 Correct 5 ms 3148 KB Output is correct
12 Correct 6 ms 3020 KB Output is correct
13 Correct 5 ms 3148 KB Output is correct
14 Correct 5 ms 3200 KB Output is correct
15 Correct 5 ms 3148 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 4484 KB Output is correct
2 Correct 48 ms 4520 KB Output is correct
3 Correct 41 ms 4296 KB Output is correct
4 Correct 41 ms 4484 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 5 ms 3148 KB Output is correct
12 Correct 5 ms 3148 KB Output is correct
13 Correct 5 ms 3148 KB Output is correct
14 Correct 5 ms 3020 KB Output is correct
15 Correct 5 ms 3148 KB Output is correct
16 Correct 5 ms 3148 KB Output is correct
17 Correct 42 ms 4484 KB Output is correct
18 Correct 42 ms 4476 KB Output is correct
19 Correct 40 ms 4624 KB Output is correct
20 Correct 43 ms 4672 KB Output is correct
21 Correct 43 ms 4868 KB Output is correct
22 Correct 40 ms 4764 KB Output is correct
23 Correct 40 ms 4624 KB Output is correct
24 Correct 44 ms 4740 KB Output is correct
25 Correct 42 ms 4916 KB Output is correct
26 Correct 37 ms 4720 KB Output is correct
27 Correct 38 ms 4732 KB Output is correct
28 Correct 38 ms 4860 KB Output is correct
29 Correct 5 ms 2904 KB Output is correct
30 Correct 5 ms 3148 KB Output is correct
31 Correct 6 ms 3020 KB Output is correct
32 Correct 5 ms 3148 KB Output is correct
33 Correct 5 ms 3200 KB Output is correct
34 Correct 5 ms 3148 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 40 ms 4252 KB Output is correct
37 Correct 43 ms 4488 KB Output is correct
38 Correct 41 ms 4728 KB Output is correct
39 Correct 43 ms 4892 KB Output is correct
40 Correct 56 ms 4864 KB Output is correct
41 Correct 4 ms 3148 KB Output is correct
42 Correct 39 ms 4648 KB Output is correct
43 Correct 38 ms 4864 KB Output is correct
44 Correct 39 ms 4868 KB Output is correct
45 Correct 37 ms 4732 KB Output is correct
46 Correct 37 ms 4952 KB Output is correct
47 Correct 36 ms 4864 KB Output is correct