Submission #441071

# Submission time Handle Problem Language Result Execution time Memory
441071 2021-07-04T05:33:50 Z Quang Mutating DNA (IOI21_dna) C++17
100 / 100
51 ms 6092 KB
#include "dna.h"
#include <bits/stdc++.h>

using namespace std;

const int N = 100010;

struct Data {
	int a[3][3];
	int* operator[](int u) {
		return a[u];
	}

	Data operator-(const Data &o) const {
		Data res;
		for (int i = 0; i < 3; i++) {
			for (int j = 0; j < 3; j++) {
				res[i][j] = a[i][j] - o.a[i][j];
			}
		}
		return res;
	}
};

Data sum[N];

void init(std::string a, std::string b) {
	map<char, int> m;
	m['A'] = 0;
	m['T'] = 1;
	m['C'] = 2;
	for (int i = 0; i < (int)a.size(); i++) {
		if (a[i] != b[i]) {
			sum[i][m[a[i]]][m[b[i]]]++;
		}
		if (i > 0) {
			for (int j = 0; j < 3; j++) {
				for (int k = 0; k < 3; k++) {
					sum[i][j][k] += sum[i - 1][j][k];
				}
			}
		}
	}
}

Data GetRange(int x, int y) {
	if (x > 0) return sum[y] - sum[x - 1];
	return sum[y];
}

int get_distance(int x, int y) {
	Data now = GetRange(x, y);
	int res = 0;
	for (int i = 0; i < 3; i++) {
		for (int j = i + 1; j < 3; j++) {
			int min_val = min(now[i][j], now[j][i]);
			res += min_val;
			now[i][j] -= min_val;
			now[j][i] -= min_val;
		}
	}

	bool all_zero = true;
	for (int i = 0; i < 3; i++) {
		for (int j = 0; j < 3; j++) {
			all_zero &= (now[i][j] == 0);
		}
	}

	if (all_zero) return res;

	if (now[0][1] != 0 && now[0][1] == now[1][2] && now[1][2] == now[2][0]) {
		res += now[0][1] * 2;
		return res;
	}
	if (now[0][2] != 0 && now[0][2] == now[2][1] && now[2][1] == now[1][0]) {
		res += now[0][2] * 2;
		return res;
	}
	return -1;
}
# Verdict Execution time Memory Grader output
1 Correct 40 ms 5632 KB Output is correct
2 Correct 39 ms 5628 KB Output is correct
3 Correct 39 ms 5304 KB Output is correct
4 Correct 41 ms 5648 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 6 ms 4332 KB Output is correct
5 Correct 5 ms 4300 KB Output is correct
6 Correct 5 ms 4300 KB Output is correct
7 Correct 5 ms 4044 KB Output is correct
8 Correct 5 ms 4300 KB Output is correct
9 Correct 5 ms 4300 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 6 ms 4332 KB Output is correct
5 Correct 5 ms 4300 KB Output is correct
6 Correct 5 ms 4300 KB Output is correct
7 Correct 5 ms 4044 KB Output is correct
8 Correct 5 ms 4300 KB Output is correct
9 Correct 5 ms 4300 KB Output is correct
10 Correct 42 ms 5536 KB Output is correct
11 Correct 40 ms 5632 KB Output is correct
12 Correct 40 ms 5748 KB Output is correct
13 Correct 41 ms 5760 KB Output is correct
14 Correct 42 ms 6024 KB Output is correct
15 Correct 49 ms 5888 KB Output is correct
16 Correct 41 ms 5744 KB Output is correct
17 Correct 40 ms 5884 KB Output is correct
18 Correct 39 ms 6020 KB Output is correct
19 Correct 38 ms 5776 KB Output is correct
20 Correct 38 ms 5888 KB Output is correct
21 Correct 38 ms 6020 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 6 ms 4332 KB Output is correct
5 Correct 5 ms 4300 KB Output is correct
6 Correct 5 ms 4300 KB Output is correct
7 Correct 5 ms 4044 KB Output is correct
8 Correct 5 ms 4300 KB Output is correct
9 Correct 5 ms 4300 KB Output is correct
10 Correct 6 ms 4044 KB Output is correct
11 Correct 6 ms 4300 KB Output is correct
12 Correct 6 ms 4044 KB Output is correct
13 Correct 6 ms 4300 KB Output is correct
14 Correct 6 ms 4300 KB Output is correct
15 Correct 5 ms 4300 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 40 ms 5632 KB Output is correct
2 Correct 39 ms 5628 KB Output is correct
3 Correct 39 ms 5304 KB Output is correct
4 Correct 41 ms 5648 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 6 ms 4332 KB Output is correct
12 Correct 5 ms 4300 KB Output is correct
13 Correct 5 ms 4300 KB Output is correct
14 Correct 5 ms 4044 KB Output is correct
15 Correct 5 ms 4300 KB Output is correct
16 Correct 5 ms 4300 KB Output is correct
17 Correct 42 ms 5536 KB Output is correct
18 Correct 40 ms 5632 KB Output is correct
19 Correct 40 ms 5748 KB Output is correct
20 Correct 41 ms 5760 KB Output is correct
21 Correct 42 ms 6024 KB Output is correct
22 Correct 49 ms 5888 KB Output is correct
23 Correct 41 ms 5744 KB Output is correct
24 Correct 40 ms 5884 KB Output is correct
25 Correct 39 ms 6020 KB Output is correct
26 Correct 38 ms 5776 KB Output is correct
27 Correct 38 ms 5888 KB Output is correct
28 Correct 38 ms 6020 KB Output is correct
29 Correct 6 ms 4044 KB Output is correct
30 Correct 6 ms 4300 KB Output is correct
31 Correct 6 ms 4044 KB Output is correct
32 Correct 6 ms 4300 KB Output is correct
33 Correct 6 ms 4300 KB Output is correct
34 Correct 5 ms 4300 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 41 ms 5268 KB Output is correct
37 Correct 46 ms 5636 KB Output is correct
38 Correct 45 ms 5832 KB Output is correct
39 Correct 43 ms 6016 KB Output is correct
40 Correct 43 ms 6016 KB Output is correct
41 Correct 5 ms 4300 KB Output is correct
42 Correct 40 ms 5752 KB Output is correct
43 Correct 45 ms 6024 KB Output is correct
44 Correct 51 ms 6012 KB Output is correct
45 Correct 38 ms 5768 KB Output is correct
46 Correct 38 ms 6092 KB Output is correct
47 Correct 39 ms 6012 KB Output is correct