oj.uz

Submission #552816

# Submission time Handle Problem Language Result Execution time Memory
552816 2022-04-24T05:39:38 Z Jomnoi Mutating DNA (IOI21_dna) C++17
100 / 100
 59 ms 13232 KB 
#include <bits/stdc++.h>
#include "dna.h"
using namespace std;

const int MAX_N = 1e5 + 10;

int preA[3][MAX_N], preB[3][MAX_N];
int preAB[3][3][MAX_N], preBA[3][3][MAX_N];

void init(string a, string b) {
	map <char, int> mp;
	mp['A'] = 0, mp['C'] = 1, mp['T'] = 2;

	int N = a.length();
	for(int i = 1; i <= N; i++) {
		for(int j = 0; j < 3; j++) {
			preA[j][i] = preA[j][i - 1];
			preB[j][i] = preB[j][i - 1];
			for(int k = 0; k < 3; k++) {
				preAB[j][k][i] += preAB[j][k][i - 1];
				preBA[j][k][i] += preBA[j][k][i - 1];
			}
		}
		preA[mp[a[i - 1]]][i]++;
		preB[mp[b[i - 1]]][i]++;
		preAB[mp[a[i - 1]]][mp[b[i - 1]]][i]++;
		preBA[mp[b[i - 1]]][mp[a[i - 1]]][i]++;
	}
}

int range(int x, int y, int *a) {
	return a[y + 1] - a[x];
}

int get_distance(int x, int y) {
	for(int i = 0; i < 3; i++) {
		if(range(x, y, preA[i]) != range(x, y, preB[i])) {
			return -1;
		}
	}

	int ans = 0, tmp = 0;
	for(int i = 0; i < 3; i++) {
		for(int j = i + 1; j < 3; j++) {
			int L = range(x, y, preAB[i][j]), R = range(x, y, preBA[i][j]);
			ans += min(L, R);
			tmp += max(L, R) - min(L, R);
		}
	}
	return ans + tmp * 2 / 3;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 11428 KB Output is correct
2 Correct 45 ms 11640 KB Output is correct
3 Correct 46 ms 10860 KB Output is correct
4 Correct 44 ms 12820 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 308 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 1 ms 340 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 12 ms 10284 KB Output is correct
5 Correct 13 ms 10452 KB Output is correct
6 Correct 12 ms 10328 KB Output is correct
7 Correct 12 ms 9732 KB Output is correct
8 Correct 14 ms 10324 KB Output is correct
9 Correct 11 ms 10324 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 12 ms 10284 KB Output is correct
5 Correct 13 ms 10452 KB Output is correct
6 Correct 12 ms 10328 KB Output is correct
7 Correct 12 ms 9732 KB Output is correct
8 Correct 14 ms 10324 KB Output is correct
9 Correct 11 ms 10324 KB Output is correct
10 Correct 48 ms 11656 KB Output is correct
11 Correct 45 ms 11656 KB Output is correct
12 Correct 46 ms 11312 KB Output is correct
13 Correct 45 ms 11656 KB Output is correct
14 Correct 45 ms 12040 KB Output is correct
15 Correct 42 ms 11984 KB Output is correct
16 Correct 38 ms 11444 KB Output is correct
17 Correct 43 ms 11700 KB Output is correct
18 Correct 39 ms 12052 KB Output is correct
19 Correct 36 ms 11480 KB Output is correct
20 Correct 38 ms 11676 KB Output is correct
21 Correct 44 ms 12048 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 12 ms 10284 KB Output is correct
5 Correct 13 ms 10452 KB Output is correct
6 Correct 12 ms 10328 KB Output is correct
7 Correct 12 ms 9732 KB Output is correct
8 Correct 14 ms 10324 KB Output is correct
9 Correct 11 ms 10324 KB Output is correct
10 Correct 13 ms 9568 KB Output is correct
11 Correct 12 ms 10432 KB Output is correct
12 Correct 10 ms 9812 KB Output is correct
13 Correct 12 ms 10436 KB Output is correct
14 Correct 15 ms 10396 KB Output is correct
15 Correct 10 ms 10452 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 11428 KB Output is correct
2 Correct 45 ms 11640 KB Output is correct
3 Correct 46 ms 10860 KB Output is correct
4 Correct 44 ms 12820 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 308 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 12 ms 10284 KB Output is correct
12 Correct 13 ms 10452 KB Output is correct
13 Correct 12 ms 10328 KB Output is correct
14 Correct 12 ms 9732 KB Output is correct
15 Correct 14 ms 10324 KB Output is correct
16 Correct 11 ms 10324 KB Output is correct
17 Correct 48 ms 11656 KB Output is correct
18 Correct 45 ms 11656 KB Output is correct
19 Correct 46 ms 11312 KB Output is correct
20 Correct 45 ms 11656 KB Output is correct
21 Correct 45 ms 12040 KB Output is correct
22 Correct 42 ms 11984 KB Output is correct
23 Correct 38 ms 11444 KB Output is correct
24 Correct 43 ms 11700 KB Output is correct
25 Correct 39 ms 12052 KB Output is correct
26 Correct 36 ms 11480 KB Output is correct
27 Correct 38 ms 11676 KB Output is correct
28 Correct 44 ms 12048 KB Output is correct
29 Correct 13 ms 9568 KB Output is correct
30 Correct 12 ms 10432 KB Output is correct
31 Correct 10 ms 9812 KB Output is correct
32 Correct 12 ms 10436 KB Output is correct
33 Correct 15 ms 10396 KB Output is correct
34 Correct 10 ms 10452 KB Output is correct
35 Correct 1 ms 308 KB Output is correct
36 Correct 42 ms 12092 KB Output is correct
37 Correct 43 ms 12912 KB Output is correct
38 Correct 47 ms 12692 KB Output is correct
39 Correct 59 ms 13232 KB Output is correct
40 Correct 42 ms 13204 KB Output is correct
41 Correct 10 ms 10452 KB Output is correct
42 Correct 40 ms 12692 KB Output is correct
43 Correct 39 ms 13144 KB Output is correct
44 Correct 40 ms 13152 KB Output is correct
45 Correct 47 ms 12644 KB Output is correct
46 Correct 40 ms 13196 KB Output is correct
47 Correct 37 ms 13160 KB Output is correct