oj.uz

Submission #832349

# Submission time Handle Problem Language Result Execution time Memory
832349 2023-08-21T09:30:34 Z Pablo_No Mutating DNA (IOI21_dna) C++17
100 / 100
 34 ms 7412 KB 
#include "dna.h"

#include <algorithm>
#include <iostream>

using namespace std;

const int N = 1e5+5;

int p[3][3][N];

int GN;

void init(std::string a, std::string b) {
	GN = a.length();

	for(char& c : a)
	{
		if(c == 'T')
			c = 'B';
	}

	for(char& c : b)
	{
		if(c == 'T')
			c = 'B';
	}

	for(int i = 0; i < GN; i++)
	{
		int c1 = a[i]-'A';
		int c2 = b[i]-'A';

		for(int k1 = 0; k1 < 3; k1++)
			for(int k2 = 0; k2 < 3; k2++)
			{
				p[k1][k2][i+1] = p[k1][k2][i] + (c1 == k1)*(c2 == k2);
			}
	}

}

int get_distance(int x, int y) {
	x++, y++;

	int ab, bc, ca, ba, ac, cb;

	int aa = p[0][0][y]-p[0][0][x-1];
	int bb = p[1][1][y]-p[1][1][x-1];
	int cc = p[2][2][y]-p[2][2][x-1];

	ab = p[0][1][y]-p[0][1][x-1];
	bc = p[1][2][y]-p[1][2][x-1];
	ca = p[2][0][y]-p[2][0][x-1];
	ba = p[1][0][y]-p[1][0][x-1];
	ac = p[0][2][y]-p[0][2][x-1];
	cb = p[2][1][y]-p[2][1][x-1];

	//cerr << ab << bc << ca << ba << ac << cb << '\n';

	if(ab+ac != ba+ca ||
	   bc+ba != ab+cb ||
	   ca+cb != ac+bc)
	   return -1;

	int tt = min(ab, ba)+min(bc, cb)+min(ca, ac);
	
	return tt+(y-x+1-tt*2-aa-bb-cc)*2/3;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 6008 KB Output is correct
2 Correct 26 ms 7036 KB Output is correct
3 Correct 26 ms 6616 KB Output is correct
4 Correct 25 ms 6980 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 4 ms 4564 KB Output is correct
5 Correct 4 ms 4544 KB Output is correct
6 Correct 4 ms 4544 KB Output is correct
7 Correct 4 ms 4308 KB Output is correct
8 Correct 4 ms 4564 KB Output is correct
9 Correct 4 ms 4536 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 4 ms 4564 KB Output is correct
5 Correct 4 ms 4544 KB Output is correct
6 Correct 4 ms 4544 KB Output is correct
7 Correct 4 ms 4308 KB Output is correct
8 Correct 4 ms 4564 KB Output is correct
9 Correct 4 ms 4536 KB Output is correct
10 Correct 25 ms 6960 KB Output is correct
11 Correct 25 ms 7032 KB Output is correct
12 Correct 26 ms 7072 KB Output is correct
13 Correct 27 ms 7140 KB Output is correct
14 Correct 27 ms 7288 KB Output is correct
15 Correct 25 ms 7284 KB Output is correct
16 Correct 26 ms 7024 KB Output is correct
17 Correct 26 ms 7060 KB Output is correct
18 Correct 28 ms 7312 KB Output is correct
19 Correct 33 ms 7024 KB Output is correct
20 Correct 25 ms 7204 KB Output is correct
21 Correct 26 ms 7284 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 4 ms 4564 KB Output is correct
5 Correct 4 ms 4544 KB Output is correct
6 Correct 4 ms 4544 KB Output is correct
7 Correct 4 ms 4308 KB Output is correct
8 Correct 4 ms 4564 KB Output is correct
9 Correct 4 ms 4536 KB Output is correct
10 Correct 4 ms 4180 KB Output is correct
11 Correct 4 ms 4532 KB Output is correct
12 Correct 4 ms 4308 KB Output is correct
13 Correct 5 ms 4564 KB Output is correct
14 Correct 4 ms 4564 KB Output is correct
15 Correct 4 ms 4612 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 6008 KB Output is correct
2 Correct 26 ms 7036 KB Output is correct
3 Correct 26 ms 6616 KB Output is correct
4 Correct 25 ms 6980 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 4 ms 4564 KB Output is correct
12 Correct 4 ms 4544 KB Output is correct
13 Correct 4 ms 4544 KB Output is correct
14 Correct 4 ms 4308 KB Output is correct
15 Correct 4 ms 4564 KB Output is correct
16 Correct 4 ms 4536 KB Output is correct
17 Correct 25 ms 6960 KB Output is correct
18 Correct 25 ms 7032 KB Output is correct
19 Correct 26 ms 7072 KB Output is correct
20 Correct 27 ms 7140 KB Output is correct
21 Correct 27 ms 7288 KB Output is correct
22 Correct 25 ms 7284 KB Output is correct
23 Correct 26 ms 7024 KB Output is correct
24 Correct 26 ms 7060 KB Output is correct
25 Correct 28 ms 7312 KB Output is correct
26 Correct 33 ms 7024 KB Output is correct
27 Correct 25 ms 7204 KB Output is correct
28 Correct 26 ms 7284 KB Output is correct
29 Correct 4 ms 4180 KB Output is correct
30 Correct 4 ms 4532 KB Output is correct
31 Correct 4 ms 4308 KB Output is correct
32 Correct 5 ms 4564 KB Output is correct
33 Correct 4 ms 4564 KB Output is correct
34 Correct 4 ms 4612 KB Output is correct
35 Correct 1 ms 304 KB Output is correct
36 Correct 25 ms 6668 KB Output is correct
37 Correct 25 ms 6992 KB Output is correct
38 Correct 29 ms 7152 KB Output is correct
39 Correct 34 ms 7412 KB Output is correct
40 Correct 31 ms 7372 KB Output is correct
41 Correct 3 ms 4564 KB Output is correct
42 Correct 32 ms 7108 KB Output is correct
43 Correct 26 ms 7288 KB Output is correct
44 Correct 26 ms 7292 KB Output is correct
45 Correct 25 ms 7060 KB Output is correct
46 Correct 25 ms 7304 KB Output is correct
47 Correct 25 ms 7292 KB Output is correct