oj.uz

Submission #531843

# Submission time Handle Problem Language Result Execution time Memory
531843 2022-03-01T16:43:26 Z thiago_bastos Mutating DNA (IOI21_dna) C++17
100 / 100
 52 ms 7384 KB 
#include "dna.h"

using namespace std;

const int N = 1e5 + 100;

int cnt[N][3][3];

void transform(string& s) {
	for(char& ch : s) {
		if(ch == 'A') ch = '0';
		else if(ch == 'T') ch = '1';
		else ch = '2';
	}
}

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

int get_distance(int x, int y) {
	
	int f[3][3] = {{0}}, X[3] = {0}, Y[3] = {0}, pairs = 0, triples = 0;
	
	++x, ++y;

	for(int i = 0; i < 3; ++i) {
		for(int j = 0; j < 3; ++j) {
			f[i][j] += cnt[y][i][j] - cnt[x - 1][i][j];
			X[i] += cnt[y][i][j] - cnt[x - 1][i][j];
			Y[j] += cnt[y][i][j] - cnt[x - 1][i][j];
		}
	}

	for(int i = 0; i < 3; ++i) {
		if(X[i] != Y[i])
			return -1;
	}

	for(int i = 0; i < 3; ++i) {
		for(int j = i + 1; j < 3; ++j) {
			int X = min(f[i][j], f[j][i]);
			f[i][j] -= X;
			f[j][i] -= X;
			pairs += X;
		}
	}

	for(int i = 0; i < 3; ++i) {
		for(int j = 0; j < 3; ++j) {
			if(i == j) continue;
			triples += f[i][j];
		}
	}

	return pairs + 2 * triples / 3;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 6916 KB Output is correct
2 Correct 38 ms 6996 KB Output is correct
3 Correct 43 ms 6592 KB Output is correct
4 Correct 44 ms 7044 KB Output is correct
5 Correct 1 ms 288 KB Output is correct
6 Correct 0 ms 292 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 288 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 6 ms 4520 KB Output is correct
5 Correct 5 ms 4528 KB Output is correct
6 Correct 6 ms 4492 KB Output is correct
7 Correct 4 ms 4244 KB Output is correct
8 Correct 5 ms 4496 KB Output is correct
9 Correct 4 ms 4524 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 288 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 6 ms 4520 KB Output is correct
5 Correct 5 ms 4528 KB Output is correct
6 Correct 6 ms 4492 KB Output is correct
7 Correct 4 ms 4244 KB Output is correct
8 Correct 5 ms 4496 KB Output is correct
9 Correct 4 ms 4524 KB Output is correct
10 Correct 36 ms 6884 KB Output is correct
11 Correct 40 ms 7044 KB Output is correct
12 Correct 44 ms 7064 KB Output is correct
13 Correct 41 ms 7156 KB Output is correct
14 Correct 41 ms 7348 KB Output is correct
15 Correct 44 ms 7252 KB Output is correct
16 Correct 45 ms 6988 KB Output is correct
17 Correct 36 ms 7136 KB Output is correct
18 Correct 36 ms 7268 KB Output is correct
19 Correct 34 ms 6976 KB Output is correct
20 Correct 35 ms 7040 KB Output is correct
21 Correct 33 ms 7272 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 288 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 6 ms 4520 KB Output is correct
5 Correct 5 ms 4528 KB Output is correct
6 Correct 6 ms 4492 KB Output is correct
7 Correct 4 ms 4244 KB Output is correct
8 Correct 5 ms 4496 KB Output is correct
9 Correct 4 ms 4524 KB Output is correct
10 Correct 5 ms 4164 KB Output is correct
11 Correct 4 ms 4556 KB Output is correct
12 Correct 4 ms 4300 KB Output is correct
13 Correct 5 ms 4556 KB Output is correct
14 Correct 5 ms 4552 KB Output is correct
15 Correct 4 ms 4552 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 6916 KB Output is correct
2 Correct 38 ms 6996 KB Output is correct
3 Correct 43 ms 6592 KB Output is correct
4 Correct 44 ms 7044 KB Output is correct
5 Correct 1 ms 288 KB Output is correct
6 Correct 0 ms 292 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 288 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 6 ms 4520 KB Output is correct
12 Correct 5 ms 4528 KB Output is correct
13 Correct 6 ms 4492 KB Output is correct
14 Correct 4 ms 4244 KB Output is correct
15 Correct 5 ms 4496 KB Output is correct
16 Correct 4 ms 4524 KB Output is correct
17 Correct 36 ms 6884 KB Output is correct
18 Correct 40 ms 7044 KB Output is correct
19 Correct 44 ms 7064 KB Output is correct
20 Correct 41 ms 7156 KB Output is correct
21 Correct 41 ms 7348 KB Output is correct
22 Correct 44 ms 7252 KB Output is correct
23 Correct 45 ms 6988 KB Output is correct
24 Correct 36 ms 7136 KB Output is correct
25 Correct 36 ms 7268 KB Output is correct
26 Correct 34 ms 6976 KB Output is correct
27 Correct 35 ms 7040 KB Output is correct
28 Correct 33 ms 7272 KB Output is correct
29 Correct 5 ms 4164 KB Output is correct
30 Correct 4 ms 4556 KB Output is correct
31 Correct 4 ms 4300 KB Output is correct
32 Correct 5 ms 4556 KB Output is correct
33 Correct 5 ms 4552 KB Output is correct
34 Correct 4 ms 4552 KB Output is correct
35 Correct 0 ms 288 KB Output is correct
36 Correct 42 ms 6612 KB Output is correct
37 Correct 38 ms 7004 KB Output is correct
38 Correct 52 ms 7040 KB Output is correct
39 Correct 38 ms 7328 KB Output is correct
40 Correct 50 ms 7384 KB Output is correct
41 Correct 5 ms 4536 KB Output is correct
42 Correct 33 ms 7032 KB Output is correct
43 Correct 39 ms 7252 KB Output is correct
44 Correct 37 ms 7264 KB Output is correct
45 Correct 35 ms 6996 KB Output is correct
46 Correct 38 ms 7304 KB Output is correct
47 Correct 35 ms 7256 KB Output is correct