Submission #439591

# Submission time Handle Problem Language Result Execution time Memory
439591 2021-06-30T10:09:54 Z nandonathaniel Mutating DNA (IOI21_dna) C++17
100 / 100
53 ms 7688 KB
#include "dna.h"
#include "bits/stdc++.h"
using namespace std;

int N;
char ch[]={'A','C','T'};
int prefA[100005][3],prefB[100005][3],pref[100005],prefp[100005][6];

void init(std::string a, std::string b) {
	N=a.length();
	for(int i=1;i<=N;i++){
		for(int j=0;j<3;j++){
			prefA[i][j]=prefA[i-1][j];
			prefB[i][j]=prefB[i-1][j];
			if(a[i-1]==ch[j]){
				prefA[i][j]++;
			}
			if(b[i-1]==ch[j]){
				prefB[i][j]++;
			}
		}
		pref[i]=pref[i-1]+(a[i-1]!=b[i-1]);
		prefp[i][0]=prefp[i-1][0];
		if(a[i-1]==ch[0] && b[i-1]==ch[1])prefp[i][0]++;
		prefp[i][1]=prefp[i-1][1];
		if(a[i-1]==ch[1] && b[i-1]==ch[0])prefp[i][1]++;
		prefp[i][2]=prefp[i-1][2];
		if(a[i-1]==ch[0] && b[i-1]==ch[2])prefp[i][2]++;
		prefp[i][3]=prefp[i-1][3];
		if(a[i-1]==ch[2] && b[i-1]==ch[0])prefp[i][3]++;
		prefp[i][4]=prefp[i-1][4];
		if(a[i-1]==ch[1] && b[i-1]==ch[2])prefp[i][4]++;
		prefp[i][5]=prefp[i-1][5];
		if(a[i-1]==ch[2] && b[i-1]==ch[1])prefp[i][5]++;	
	}
}

int get_distance(int x, int y) {
	x++;y++;
	for(int i=0;i<3;i++){
		if(prefA[y][i]-prefA[x-1][i]!=prefB[y][i]-prefB[x-1][i])return -1;
	}
	int beda=pref[y]-pref[x-1];
	int ans=0;
	beda-=2*min(prefp[y][0]-prefp[x-1][0],prefp[y][1]-prefp[x-1][1]);
	ans+=min(prefp[y][0]-prefp[x-1][0],prefp[y][1]-prefp[x-1][1]);
	beda-=2*min(prefp[y][2]-prefp[x-1][2],prefp[y][3]-prefp[x-1][3]);
	ans+=min(prefp[y][2]-prefp[x-1][2],prefp[y][3]-prefp[x-1][3]);
	beda-=2*min(prefp[y][4]-prefp[x-1][4],prefp[y][5]-prefp[x-1][5]);
	ans+=min(prefp[y][4]-prefp[x-1][4],prefp[y][5]-prefp[x-1][5]);
	ans+=(beda/3)*2;
	return ans;
}
# Verdict Execution time Memory Grader output
1 Correct 44 ms 7168 KB Output is correct
2 Correct 42 ms 7176 KB Output is correct
3 Correct 44 ms 6804 KB Output is correct
4 Correct 48 ms 7196 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 6 ms 5836 KB Output is correct
5 Correct 6 ms 5964 KB Output is correct
6 Correct 7 ms 5836 KB Output is correct
7 Correct 6 ms 5580 KB Output is correct
8 Correct 6 ms 5896 KB Output is correct
9 Correct 5 ms 5968 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 6 ms 5836 KB Output is correct
5 Correct 6 ms 5964 KB Output is correct
6 Correct 7 ms 5836 KB Output is correct
7 Correct 6 ms 5580 KB Output is correct
8 Correct 6 ms 5896 KB Output is correct
9 Correct 5 ms 5968 KB Output is correct
10 Correct 43 ms 7172 KB Output is correct
11 Correct 46 ms 7168 KB Output is correct
12 Correct 53 ms 7160 KB Output is correct
13 Correct 46 ms 7292 KB Output is correct
14 Correct 47 ms 7584 KB Output is correct
15 Correct 51 ms 7676 KB Output is correct
16 Correct 40 ms 7148 KB Output is correct
17 Correct 51 ms 7312 KB Output is correct
18 Correct 41 ms 7556 KB Output is correct
19 Correct 38 ms 7208 KB Output is correct
20 Correct 38 ms 7432 KB Output is correct
21 Correct 39 ms 7552 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 6 ms 5836 KB Output is correct
5 Correct 6 ms 5964 KB Output is correct
6 Correct 7 ms 5836 KB Output is correct
7 Correct 6 ms 5580 KB Output is correct
8 Correct 6 ms 5896 KB Output is correct
9 Correct 5 ms 5968 KB Output is correct
10 Correct 7 ms 5452 KB Output is correct
11 Correct 8 ms 5964 KB Output is correct
12 Correct 6 ms 5580 KB Output is correct
13 Correct 7 ms 5836 KB Output is correct
14 Correct 7 ms 5964 KB Output is correct
15 Correct 6 ms 5908 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 44 ms 7168 KB Output is correct
2 Correct 42 ms 7176 KB Output is correct
3 Correct 44 ms 6804 KB Output is correct
4 Correct 48 ms 7196 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 6 ms 5836 KB Output is correct
12 Correct 6 ms 5964 KB Output is correct
13 Correct 7 ms 5836 KB Output is correct
14 Correct 6 ms 5580 KB Output is correct
15 Correct 6 ms 5896 KB Output is correct
16 Correct 5 ms 5968 KB Output is correct
17 Correct 43 ms 7172 KB Output is correct
18 Correct 46 ms 7168 KB Output is correct
19 Correct 53 ms 7160 KB Output is correct
20 Correct 46 ms 7292 KB Output is correct
21 Correct 47 ms 7584 KB Output is correct
22 Correct 51 ms 7676 KB Output is correct
23 Correct 40 ms 7148 KB Output is correct
24 Correct 51 ms 7312 KB Output is correct
25 Correct 41 ms 7556 KB Output is correct
26 Correct 38 ms 7208 KB Output is correct
27 Correct 38 ms 7432 KB Output is correct
28 Correct 39 ms 7552 KB Output is correct
29 Correct 7 ms 5452 KB Output is correct
30 Correct 8 ms 5964 KB Output is correct
31 Correct 6 ms 5580 KB Output is correct
32 Correct 7 ms 5836 KB Output is correct
33 Correct 7 ms 5964 KB Output is correct
34 Correct 6 ms 5908 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 47 ms 6804 KB Output is correct
37 Correct 44 ms 7168 KB Output is correct
38 Correct 44 ms 7304 KB Output is correct
39 Correct 48 ms 7576 KB Output is correct
40 Correct 46 ms 7556 KB Output is correct
41 Correct 5 ms 5964 KB Output is correct
42 Correct 43 ms 7284 KB Output is correct
43 Correct 42 ms 7560 KB Output is correct
44 Correct 42 ms 7552 KB Output is correct
45 Correct 39 ms 7284 KB Output is correct
46 Correct 46 ms 7652 KB Output is correct
47 Correct 40 ms 7688 KB Output is correct