oj.uz

Submission #437339

# Submission time Handle Problem Language Result Execution time Memory
437339 2021-06-26T07:42:49 Z DunderMifflin Mutating DNA (IOI21_dna) C++17
100 / 100
 81 ms 8544 KB 
#include "dna.h"
#include<map>
using namespace std;

const int N = 123456;

int pref[3][3][N];
int asum[3][N];
int bsum[3][N];
map<char, int> f;

void init(std::string a, std::string b) {
	f['A'] = 0; f['C'] = 1; f['T'] = 2;
	int n = (int) a.size(); 
	a = " " + a;
	b = " " + b;
	for (int i = 1; i <= n; i++) {
		for (int k = 0; k < 3; k++) {
			for (int l = 0; l < 3; l++) {
				pref[k][l][i] = pref[k][l][i - 1] + (f[a[i]] == k && f[b[i]] == l);
			}
			asum[k][i] = asum[k][i - 1] + (f[a[i]] == k);
			bsum[k][i] = bsum[k][i - 1] + (f[b[i]] == k);
		}
	}
}

int get_distance(int x, int y) {
	x++; y++;
	for (int t = 0; t < 3; t++) {
		if (asum[t][y] - asum[t][x - 1] != bsum[t][y] - bsum[t][x - 1]) {
			return -1;
		}
	}
	int ans = 0, extra = 0;
	for (int k = 0; k < 3; k++) {
		for (int l = k + 1; l < 3; l++) {
			ans += min(pref[k][l][y] - pref[k][l][x - 1], pref[l][k][y] - pref[l][k][x - 1]);
			if (k == 0 and l == 1)
				extra = abs((pref[k][l][y] - pref[k][l][x - 1]) - (pref[l][k][y] - pref[l][k][x - 1]));
		}
	}
	return ans + 2 * extra;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 7968 KB Output is correct
2 Correct 77 ms 8044 KB Output is correct
3 Correct 52 ms 7508 KB Output is correct
4 Correct 76 ms 8096 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 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 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 16 ms 6784 KB Output is correct
5 Correct 22 ms 6864 KB Output is correct
6 Correct 14 ms 6812 KB Output is correct
7 Correct 14 ms 6444 KB Output is correct
8 Correct 18 ms 6860 KB Output is correct
9 Correct 13 ms 6984 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 16 ms 6784 KB Output is correct
5 Correct 22 ms 6864 KB Output is correct
6 Correct 14 ms 6812 KB Output is correct
7 Correct 14 ms 6444 KB Output is correct
8 Correct 18 ms 6860 KB Output is correct
9 Correct 13 ms 6984 KB Output is correct
10 Correct 53 ms 7988 KB Output is correct
11 Correct 57 ms 8100 KB Output is correct
12 Correct 57 ms 7976 KB Output is correct
13 Correct 57 ms 8088 KB Output is correct
14 Correct 77 ms 8340 KB Output is correct
15 Correct 54 ms 8376 KB Output is correct
16 Correct 54 ms 8004 KB Output is correct
17 Correct 63 ms 8160 KB Output is correct
18 Correct 60 ms 8416 KB Output is correct
19 Correct 49 ms 7952 KB Output is correct
20 Correct 48 ms 8184 KB Output is correct
21 Correct 55 ms 8416 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 16 ms 6784 KB Output is correct
5 Correct 22 ms 6864 KB Output is correct
6 Correct 14 ms 6812 KB Output is correct
7 Correct 14 ms 6444 KB Output is correct
8 Correct 18 ms 6860 KB Output is correct
9 Correct 13 ms 6984 KB Output is correct
10 Correct 18 ms 6220 KB Output is correct
11 Correct 15 ms 6848 KB Output is correct
12 Correct 14 ms 6424 KB Output is correct
13 Correct 20 ms 6840 KB Output is correct
14 Correct 19 ms 6792 KB Output is correct
15 Correct 17 ms 6896 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 7968 KB Output is correct
2 Correct 77 ms 8044 KB Output is correct
3 Correct 52 ms 7508 KB Output is correct
4 Correct 76 ms 8096 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 16 ms 6784 KB Output is correct
12 Correct 22 ms 6864 KB Output is correct
13 Correct 14 ms 6812 KB Output is correct
14 Correct 14 ms 6444 KB Output is correct
15 Correct 18 ms 6860 KB Output is correct
16 Correct 13 ms 6984 KB Output is correct
17 Correct 53 ms 7988 KB Output is correct
18 Correct 57 ms 8100 KB Output is correct
19 Correct 57 ms 7976 KB Output is correct
20 Correct 57 ms 8088 KB Output is correct
21 Correct 77 ms 8340 KB Output is correct
22 Correct 54 ms 8376 KB Output is correct
23 Correct 54 ms 8004 KB Output is correct
24 Correct 63 ms 8160 KB Output is correct
25 Correct 60 ms 8416 KB Output is correct
26 Correct 49 ms 7952 KB Output is correct
27 Correct 48 ms 8184 KB Output is correct
28 Correct 55 ms 8416 KB Output is correct
29 Correct 18 ms 6220 KB Output is correct
30 Correct 15 ms 6848 KB Output is correct
31 Correct 14 ms 6424 KB Output is correct
32 Correct 20 ms 6840 KB Output is correct
33 Correct 19 ms 6792 KB Output is correct
34 Correct 17 ms 6896 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 54 ms 7552 KB Output is correct
37 Correct 75 ms 8080 KB Output is correct
38 Correct 78 ms 8036 KB Output is correct
39 Correct 59 ms 8376 KB Output is correct
40 Correct 81 ms 8360 KB Output is correct
41 Correct 12 ms 6860 KB Output is correct
42 Correct 53 ms 7976 KB Output is correct
43 Correct 56 ms 8476 KB Output is correct
44 Correct 66 ms 8544 KB Output is correct
45 Correct 63 ms 8112 KB Output is correct
46 Correct 50 ms 8468 KB Output is correct
47 Correct 50 ms 8468 KB Output is correct