oj.uz

Submission #834101

# Submission time Handle Problem Language Result Execution time Memory
834101 2023-08-22T10:47:43 Z Abrar_Al_Samit Mutating DNA (IOI21_dna) C++17
100 / 100
 36 ms 6920 KB 
#include "dna.h"
#include <bits/stdc++.h>

using namespace std;


const int nax = 100000;
int a[nax], b[nax];

int cnt[nax][6]; //01, 02, 10, 12, 20, 21
int opp[] = {2, 4, 0, 5, 1, 3};
int n;

void init(string s, string t) {
	n = s.size();
	for(int i=0; i<n; ++i) {
		if(s[i]=='A') a[i] = 0;
		else if(s[i]=='T') a[i] = 1;
		else a[i] = 2;

		if(t[i]=='A') b[i] = 0;
		else if(t[i]=='T') b[i] = 1;
		else b[i] = 2;
	}
	for(int i=0; i<n; ++i) {
		if(a[i]!=b[i]) {
			if(a[i]==0) {
				if(b[i]==1) cnt[i][0] = 1;
				else cnt[i][1] = 1;
			} else if(a[i]==1) {
				if(b[i]==0) cnt[i][2] = 1;
				else cnt[i][3] = 1;
			} else {
				if(b[i]==0) cnt[i][4] = 1;
				else cnt[i][5] = 1;
			}
		}
		if(!i) continue;
		for(int j=0; j<6; ++j) {
			cnt[i][j] += cnt[i-1][j];
		}
	}
}

int get_distance(int l, int r) {
	int cur[6];
	for(int j=0; j<6; ++j) {
		cur[j] = cnt[r][j] - (l ? cnt[l-1][j] : 0);
	}
	int ans = 0;
	for(int j=0; j<6; ++j) {
		int sub = min(cur[j], cur[opp[j]]);
		cur[j] -= sub;
		cur[opp[j]] -= sub;
		ans += sub;
	}

	if(cur[0] && cur[1]) return -1;
	if(cur[2] && cur[3]) return -1;
	if(cur[4] && cur[5]) return -1;

	int m[3] = {cur[0]+cur[1], cur[2]+cur[3], cur[4]+cur[5]};
	if(m[0]!=m[1] || m[1]!=m[2]) return -1;
	ans += m[0] * 2;
	return ans;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 6532 KB Output is correct
2 Correct 34 ms 6656 KB Output is correct
3 Correct 31 ms 6244 KB Output is correct
4 Correct 36 ms 6600 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 4 ms 4116 KB Output is correct
5 Correct 4 ms 4180 KB Output is correct
6 Correct 4 ms 4180 KB Output is correct
7 Correct 5 ms 3924 KB Output is correct
8 Correct 4 ms 4180 KB Output is correct
9 Correct 3 ms 4180 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 4 ms 4116 KB Output is correct
5 Correct 4 ms 4180 KB Output is correct
6 Correct 4 ms 4180 KB Output is correct
7 Correct 5 ms 3924 KB Output is correct
8 Correct 4 ms 4180 KB Output is correct
9 Correct 3 ms 4180 KB Output is correct
10 Correct 28 ms 6524 KB Output is correct
11 Correct 36 ms 6688 KB Output is correct
12 Correct 29 ms 6680 KB Output is correct
13 Correct 29 ms 6812 KB Output is correct
14 Correct 29 ms 6920 KB Output is correct
15 Correct 27 ms 6920 KB Output is correct
16 Correct 29 ms 6648 KB Output is correct
17 Correct 28 ms 6772 KB Output is correct
18 Correct 29 ms 6920 KB Output is correct
19 Correct 26 ms 6804 KB Output is correct
20 Correct 27 ms 6812 KB Output is correct
21 Correct 27 ms 6920 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 4 ms 4116 KB Output is correct
5 Correct 4 ms 4180 KB Output is correct
6 Correct 4 ms 4180 KB Output is correct
7 Correct 5 ms 3924 KB Output is correct
8 Correct 4 ms 4180 KB Output is correct
9 Correct 3 ms 4180 KB Output is correct
10 Correct 5 ms 3796 KB Output is correct
11 Correct 5 ms 4180 KB Output is correct
12 Correct 4 ms 3924 KB Output is correct
13 Correct 5 ms 4180 KB Output is correct
14 Correct 5 ms 4180 KB Output is correct
15 Correct 4 ms 4180 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 6532 KB Output is correct
2 Correct 34 ms 6656 KB Output is correct
3 Correct 31 ms 6244 KB Output is correct
4 Correct 36 ms 6600 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 4 ms 4116 KB Output is correct
12 Correct 4 ms 4180 KB Output is correct
13 Correct 4 ms 4180 KB Output is correct
14 Correct 5 ms 3924 KB Output is correct
15 Correct 4 ms 4180 KB Output is correct
16 Correct 3 ms 4180 KB Output is correct
17 Correct 28 ms 6524 KB Output is correct
18 Correct 36 ms 6688 KB Output is correct
19 Correct 29 ms 6680 KB Output is correct
20 Correct 29 ms 6812 KB Output is correct
21 Correct 29 ms 6920 KB Output is correct
22 Correct 27 ms 6920 KB Output is correct
23 Correct 29 ms 6648 KB Output is correct
24 Correct 28 ms 6772 KB Output is correct
25 Correct 29 ms 6920 KB Output is correct
26 Correct 26 ms 6804 KB Output is correct
27 Correct 27 ms 6812 KB Output is correct
28 Correct 27 ms 6920 KB Output is correct
29 Correct 5 ms 3796 KB Output is correct
30 Correct 5 ms 4180 KB Output is correct
31 Correct 4 ms 3924 KB Output is correct
32 Correct 5 ms 4180 KB Output is correct
33 Correct 5 ms 4180 KB Output is correct
34 Correct 4 ms 4180 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 32 ms 6260 KB Output is correct
37 Correct 29 ms 6552 KB Output is correct
38 Correct 30 ms 6804 KB Output is correct
39 Correct 30 ms 6916 KB Output is correct
40 Correct 30 ms 6920 KB Output is correct
41 Correct 3 ms 4180 KB Output is correct
42 Correct 30 ms 6712 KB Output is correct
43 Correct 30 ms 6908 KB Output is correct
44 Correct 30 ms 6920 KB Output is correct
45 Correct 28 ms 6728 KB Output is correct
46 Correct 27 ms 6920 KB Output is correct
47 Correct 32 ms 6916 KB Output is correct