oj.uz

Submission #565165

# Submission time Handle Problem Language Result Execution time Memory
565165 2022-05-20T11:13:39 Z teraqqq Mutating DNA (IOI21_dna) C++17
100 / 100
 64 ms 9736 KB 
#include <bits/stdc++.h>

#include "dna.h"

using namespace std;

const int N = 1e5+7;

int cnt[3][3][N], cnta[3][N], cntb[3][N];
int id[256];

void init(std::string a, std::string b) {
	id['A'] = 0;
	id['C'] = 1;
	id['T'] = 2;

	const int n = a.size();
	for (int i = 0; i < n; ++i) {
		const int x = id[(int)a[i]], y = id[(int)b[i]];
		
		for (int p = 0; p < 3; ++p) {
			cnta[p][i+1] = cnta[p][i];
			cntb[p][i+1] = cntb[p][i];
			for (int q = 0; q < 3; ++q) cnt[p][q][i+1] = cnt[p][q][i];
		}

		cnt[x][y][i+1]++;
		cnta[x][i+1]++;
		cntb[y][i+1]++;
	}
}

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

	for (int i = 0; i < 3; ++i) {
		if (cnta[i][y] - cnta[i][x] != cntb[i][y] - cntb[i][x]) return -1;
	}

	vector q(3, vector<int>(3));
	for (int i = 0; i < 3; ++i)
	for (int j = 0; j < 3; ++j) {
		q[i][j] = cnt[i][j][y] - cnt[i][j][x];
		if (i == j) q[i][j] = 0;
	}

	int ans = 0;

	for (int s = 0; s < 3; ++s)
	for (int t = 0; t < s; ++t) {
		int delta = min(q[s][t], q[t][s]);
		ans += delta;
		q[s][t] -= delta;
		q[t][s] -= delta;
	}

	int lam = 0;
	for (auto& u : q) for (int x : u) lam += x;
	ans += lam / 3 * 2;

	return ans;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 7980 KB Output is correct
2 Correct 58 ms 9336 KB Output is correct
3 Correct 56 ms 8860 KB Output is correct
4 Correct 60 ms 9328 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 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 5 ms 6740 KB Output is correct
5 Correct 5 ms 6992 KB Output is correct
6 Correct 6 ms 6852 KB Output is correct
7 Correct 5 ms 6560 KB Output is correct
8 Correct 5 ms 6868 KB Output is correct
9 Correct 6 ms 6928 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 5 ms 6740 KB Output is correct
5 Correct 5 ms 6992 KB Output is correct
6 Correct 6 ms 6852 KB Output is correct
7 Correct 5 ms 6560 KB Output is correct
8 Correct 5 ms 6868 KB Output is correct
9 Correct 6 ms 6928 KB Output is correct
10 Correct 57 ms 9328 KB Output is correct
11 Correct 53 ms 9292 KB Output is correct
12 Correct 54 ms 9216 KB Output is correct
13 Correct 55 ms 9468 KB Output is correct
14 Correct 64 ms 9736 KB Output is correct
15 Correct 58 ms 9580 KB Output is correct
16 Correct 46 ms 9192 KB Output is correct
17 Correct 50 ms 9424 KB Output is correct
18 Correct 56 ms 9628 KB Output is correct
19 Correct 42 ms 9208 KB Output is correct
20 Correct 45 ms 9432 KB Output is correct
21 Correct 43 ms 9592 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 5 ms 6740 KB Output is correct
5 Correct 5 ms 6992 KB Output is correct
6 Correct 6 ms 6852 KB Output is correct
7 Correct 5 ms 6560 KB Output is correct
8 Correct 5 ms 6868 KB Output is correct
9 Correct 6 ms 6928 KB Output is correct
10 Correct 5 ms 6336 KB Output is correct
11 Correct 5 ms 6848 KB Output is correct
12 Correct 6 ms 6484 KB Output is correct
13 Correct 5 ms 6868 KB Output is correct
14 Correct 6 ms 6868 KB Output is correct
15 Correct 7 ms 6848 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 7980 KB Output is correct
2 Correct 58 ms 9336 KB Output is correct
3 Correct 56 ms 8860 KB Output is correct
4 Correct 60 ms 9328 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 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 5 ms 6740 KB Output is correct
12 Correct 5 ms 6992 KB Output is correct
13 Correct 6 ms 6852 KB Output is correct
14 Correct 5 ms 6560 KB Output is correct
15 Correct 5 ms 6868 KB Output is correct
16 Correct 6 ms 6928 KB Output is correct
17 Correct 57 ms 9328 KB Output is correct
18 Correct 53 ms 9292 KB Output is correct
19 Correct 54 ms 9216 KB Output is correct
20 Correct 55 ms 9468 KB Output is correct
21 Correct 64 ms 9736 KB Output is correct
22 Correct 58 ms 9580 KB Output is correct
23 Correct 46 ms 9192 KB Output is correct
24 Correct 50 ms 9424 KB Output is correct
25 Correct 56 ms 9628 KB Output is correct
26 Correct 42 ms 9208 KB Output is correct
27 Correct 45 ms 9432 KB Output is correct
28 Correct 43 ms 9592 KB Output is correct
29 Correct 5 ms 6336 KB Output is correct
30 Correct 5 ms 6848 KB Output is correct
31 Correct 6 ms 6484 KB Output is correct
32 Correct 5 ms 6868 KB Output is correct
33 Correct 6 ms 6868 KB Output is correct
34 Correct 7 ms 6848 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 50 ms 8856 KB Output is correct
37 Correct 52 ms 9332 KB Output is correct
38 Correct 57 ms 9324 KB Output is correct
39 Correct 59 ms 9716 KB Output is correct
40 Correct 62 ms 9708 KB Output is correct
41 Correct 5 ms 6848 KB Output is correct
42 Correct 51 ms 9296 KB Output is correct
43 Correct 52 ms 9592 KB Output is correct
44 Correct 50 ms 9660 KB Output is correct
45 Correct 42 ms 9240 KB Output is correct
46 Correct 43 ms 9612 KB Output is correct
47 Correct 46 ms 9596 KB Output is correct