Submission #866180

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
866180	2023-10-25T14:31:04 Z	lomta	Mutating DNA (IOI21_dna)	C++17	100 / 100	34 ms	5400 KB

#include <bits/stdc++.h>
using namespace std;
 
 
 
const int N = 1e5 + 5;
int pref1[N],pref2[N],pref3[N],pref4[N];
 
 
 
 
 
void init(string a, string b) {
	
	int n=a.size();
	
	pref1[0]=0;
	for(int i=0;i<n;i++){
		pref1[i+1]=pref1[i];
		if(a[i]=='A' && b[i]=='T'){
			pref1[i+1]++;
		}
		if(a[i]=='T' && b[i]=='A'){
			pref1[i+1]--;
		}
	}
	
	pref2[0]=0;
	for(int i=0;i<n;i++){
		pref2[i+1]=pref2[i];
		if(a[i]=='T' && b[i]=='C'){
			pref2[i+1]++;
		}
		if(a[i]=='C' && b[i]=='T'){
			pref2[i+1]--;
		}
	}
	pref3[0]=0;
	for(int i=0;i<n;i++){
		pref3[i+1]=pref3[i];
		if(a[i]=='C' && b[i]=='A'){
			pref3[i+1]++;
		}
		if(a[i]=='A' && b[i]=='C'){
			pref3[i+1]--;
		}
	}
	
	
	
	pref4[0]=0;
	for(int i=0;i<n;i++){
		pref4[i+1]=pref4[i];
		if(a[i]==b[i]){
			pref4[i+1]++;
		}
		
	}
}
 
int get_distance(int x, int y) {
	int sz=y-x+1;
	x++;
	y++;
	x--;
	int a1=pref1[y]-pref1[x];
	int b1=pref2[y]-pref2[x];
	int c1=pref3[y]-pref3[x];
	int d1=pref4[y]-pref4[x];
	/*
	cout<<"a1: "<<a1<<endl;
	cout<<"b1: "<<b1<<endl;
	cout<<"c1: "<<c1<<endl;
	*/
	if(a1==b1 && b1==c1 && c1==a1){
		
		return (sz-abs(a1)-abs(b1)-abs(c1)-abs(d1))/2+(abs(a1)+abs(b1)+abs(c1))/3*2;
	}
	return -1;
}

Subtask #1
21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	25 ms	3864 KB	Output is correct
2	Correct	26 ms	4876 KB	Output is correct
3	Correct	26 ms	4708 KB	Output is correct
4	Correct	27 ms	4748 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct

Subtask #2
22.0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	4 ms	2396 KB	Output is correct
5	Correct	4 ms	2704 KB	Output is correct
6	Correct	4 ms	2760 KB	Output is correct
7	Correct	4 ms	2396 KB	Output is correct
8	Correct	4 ms	2652 KB	Output is correct
9	Correct	2 ms	2652 KB	Output is correct

Subtask #3
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	4 ms	2396 KB	Output is correct
5	Correct	4 ms	2704 KB	Output is correct
6	Correct	4 ms	2760 KB	Output is correct
7	Correct	4 ms	2396 KB	Output is correct
8	Correct	4 ms	2652 KB	Output is correct
9	Correct	2 ms	2652 KB	Output is correct
10	Correct	28 ms	4880 KB	Output is correct
11	Correct	26 ms	4876 KB	Output is correct
12	Correct	26 ms	5108 KB	Output is correct
13	Correct	27 ms	5144 KB	Output is correct
14	Correct	27 ms	5132 KB	Output is correct
15	Correct	28 ms	5116 KB	Output is correct
16	Correct	34 ms	4648 KB	Output is correct
17	Correct	26 ms	4900 KB	Output is correct
18	Correct	26 ms	4888 KB	Output is correct
19	Correct	25 ms	4732 KB	Output is correct
20	Correct	25 ms	4900 KB	Output is correct
21	Correct	25 ms	4864 KB	Output is correct

Subtask #4
28.0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	4 ms	2396 KB	Output is correct
5	Correct	4 ms	2704 KB	Output is correct
6	Correct	4 ms	2760 KB	Output is correct
7	Correct	4 ms	2396 KB	Output is correct
8	Correct	4 ms	2652 KB	Output is correct
9	Correct	2 ms	2652 KB	Output is correct
10	Correct	4 ms	2392 KB	Output is correct
11	Correct	4 ms	2652 KB	Output is correct
12	Correct	4 ms	2600 KB	Output is correct
13	Correct	4 ms	2652 KB	Output is correct
14	Correct	4 ms	2796 KB	Output is correct
15	Correct	4 ms	2652 KB	Output is correct

Subtask #5
16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	25 ms	3864 KB	Output is correct
2	Correct	26 ms	4876 KB	Output is correct
3	Correct	26 ms	4708 KB	Output is correct
4	Correct	27 ms	4748 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	4 ms	2396 KB	Output is correct
12	Correct	4 ms	2704 KB	Output is correct
13	Correct	4 ms	2760 KB	Output is correct
14	Correct	4 ms	2396 KB	Output is correct
15	Correct	4 ms	2652 KB	Output is correct
16	Correct	2 ms	2652 KB	Output is correct
17	Correct	28 ms	4880 KB	Output is correct
18	Correct	26 ms	4876 KB	Output is correct
19	Correct	26 ms	5108 KB	Output is correct
20	Correct	27 ms	5144 KB	Output is correct
21	Correct	27 ms	5132 KB	Output is correct
22	Correct	28 ms	5116 KB	Output is correct
23	Correct	34 ms	4648 KB	Output is correct
24	Correct	26 ms	4900 KB	Output is correct
25	Correct	26 ms	4888 KB	Output is correct
26	Correct	25 ms	4732 KB	Output is correct
27	Correct	25 ms	4900 KB	Output is correct
28	Correct	25 ms	4864 KB	Output is correct
29	Correct	4 ms	2392 KB	Output is correct
30	Correct	4 ms	2652 KB	Output is correct
31	Correct	4 ms	2600 KB	Output is correct
32	Correct	4 ms	2652 KB	Output is correct
33	Correct	4 ms	2796 KB	Output is correct
34	Correct	4 ms	2652 KB	Output is correct
35	Correct	0 ms	344 KB	Output is correct
36	Correct	26 ms	4632 KB	Output is correct
37	Correct	28 ms	4768 KB	Output is correct
38	Correct	27 ms	5400 KB	Output is correct
39	Correct	27 ms	5132 KB	Output is correct
40	Correct	28 ms	5128 KB	Output is correct
41	Correct	2 ms	2652 KB	Output is correct
42	Correct	31 ms	4848 KB	Output is correct
43	Correct	27 ms	4880 KB	Output is correct
44	Correct	26 ms	4888 KB	Output is correct
45	Correct	25 ms	4888 KB	Output is correct
46	Correct	25 ms	4884 KB	Output is correct
47	Correct	25 ms	4888 KB	Output is correct

Submission #866180

Compilation message

Subtask #1 21.0 / 21.0

Subtask #2 22.0 / 22.0

Subtask #3 13.0 / 13.0

Subtask #4 28.0 / 28.0

Subtask #5 16.0 / 16.0

Subtask #1
21.0 / 21.0

Subtask #2
22.0 / 22.0

Subtask #3
13.0 / 13.0

Subtask #4
28.0 / 28.0

Subtask #5
16.0 / 16.0