Submission #955111

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
955111	2024-03-29T12:03:11 Z	IUA_Hasin	Mutating DNA (IOI21_dna)	C++17	56 / 100	38 ms	8532 KB

dna

#include <bits/stdc++.h>
 
#define endl                                "\n"
#define finp                                for(int i=0; i<n; i++)
#define fknp                                for(int k=0; k<n; k++)
#define yeap                                cout<<"YES"<<endl
#define nope                                cout<<"NO"<<endl
#define inpintn                             int n; cin>>n
#define inpintarrn                          int arr[n]; for(int i=0; i<n; i++){cin>>arr[i];}
#define inpllarrn                           long long arr[n]; for(int i=0; i<n; i++){cin>>arr[i];}
#define ll                                  long long
 
using namespace std;

#include "dna.h"

ll const N = 1e5+10;
string aa, bb;
ll arra[N], arrc[N], arrt[N];
ll brra[N], brrc[N], brrt[N];
ll diff[N];

void init(std::string a, std::string b) {
	aa = a;
	bb = b;
	ll siz = a.size();
	for(int i=0; i<siz; i++){
		if(a[i]=='A'){
			arra[i+1] = arra[i]+1;
			arrc[i+1] = arrc[i];
			arrt[i+1] = arrt[i];
		} else if(a[i]=='C'){
			arra[i+1] = arra[i];
			arrc[i+1] = arrc[i]+1;
			arrt[i+1] = arrt[i];
		} else {
			arra[i+1] = arra[i];
			arrc[i+1] = arrc[i];
			arrt[i+1] = arrt[i]+1;
		}

		if(b[i]=='A'){
			brra[i+1] = brra[i]+1;
			brrc[i+1] = brrc[i];
			brrt[i+1] = brrt[i];
		} else if(b[i]=='C'){
			brra[i+1] = brra[i];
			brrc[i+1] = brrc[i]+1;
			brrt[i+1] = brrt[i];
		} else {
			brra[i+1] = brra[i];
			brrc[i+1] = brrc[i];
			brrt[i+1] = brrt[i]+1;
		}
	}

	for(int i=0; i<siz; i++){
		char p = aa[i];
		char q = bb[i];
		if(p!=q){
			diff[i+1] = diff[i]+1;
		} else {
			diff[i+1] = diff[i];
		}
	}

}

int get_distance(int x, int y) {
	x = x+1;
	y = y+1;
	// ll siz1 = aa.size();
	// ll diff[siz1+1];
	// diff[0] = 0;
	// for(int i=0; i<siz1; i++){
	// 	char p = aa[i];
	// 	char q = bb[i];
	// 	if(p!=q){
	// 		diff[i+1] = diff[i]+1;
	// 	} else {
	// 		diff[i+1] = diff[i];
	// 	}
	// }

	ll xa = arra[y]-arra[x-1];
	ll xc = arrc[y]-arrc[x-1];
	ll xt = arrt[y]-arrt[x-1];	
	ll ya = brra[y]-brra[x-1];
	ll yc = brrc[y]-brrc[x-1];
	ll yt = brrt[y]-brrt[x-1];
	ll d = diff[y]-diff[x-1];

	if(y-x<=2){
		if(xa==ya && xc==yc && xt==yt){
			if(d==0){
				return 0;
			} else if(d==2){
				return 1;
			} else {
				return 2;
			}
		} else {
			return -1;
		}
	} else {
		if(xa==ya && xc==yc && xt==yt){
			ll ans = d/2;
			return ans;
		} else {
			return -1;
		}
	}

	// if(xa==ya && xc==yc && xt==yt){
	// 	ll ans = d/2;
	// 	return ans;
	// } else {
	// 	return -1;
	// }

}

Subtask #1

21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	30 ms	8016 KB	Output is correct
2	Correct	29 ms	8028 KB	Output is correct
3	Correct	27 ms	7508 KB	Output is correct
4	Correct	28 ms	8532 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct

Subtask #2

22.0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 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	6492 KB	Output is correct
5	Correct	5 ms	6492 KB	Output is correct
6	Correct	5 ms	6624 KB	Output is correct
7	Correct	4 ms	6236 KB	Output is correct
8	Correct	4 ms	6492 KB	Output is correct
9	Correct	4 ms	6492 KB	Output is correct

Subtask #3

13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 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	6492 KB	Output is correct
5	Correct	5 ms	6492 KB	Output is correct
6	Correct	5 ms	6624 KB	Output is correct
7	Correct	4 ms	6236 KB	Output is correct
8	Correct	4 ms	6492 KB	Output is correct
9	Correct	4 ms	6492 KB	Output is correct
10	Correct	30 ms	8028 KB	Output is correct
11	Correct	27 ms	8016 KB	Output is correct
12	Correct	28 ms	7772 KB	Output is correct
13	Correct	33 ms	8024 KB	Output is correct
14	Correct	38 ms	8276 KB	Output is correct
15	Correct	27 ms	8276 KB	Output is correct
16	Correct	30 ms	7772 KB	Output is correct
17	Correct	27 ms	8024 KB	Output is correct
18	Correct	30 ms	8288 KB	Output is correct
19	Correct	26 ms	8028 KB	Output is correct
20	Correct	25 ms	8028 KB	Output is correct
21	Correct	26 ms	8276 KB	Output is correct

Subtask #4

0.0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 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	6492 KB	Output is correct
5	Correct	5 ms	6492 KB	Output is correct
6	Correct	5 ms	6624 KB	Output is correct
7	Correct	4 ms	6236 KB	Output is correct
8	Correct	4 ms	6492 KB	Output is correct
9	Correct	4 ms	6492 KB	Output is correct
10	Correct	4 ms	5980 KB	Output is correct
11	Correct	5 ms	6652 KB	Output is correct
12	Incorrect	5 ms	6236 KB	Output isn't correct
13	Halted	0 ms	0 KB	-

Subtask #5

0.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	30 ms	8016 KB	Output is correct
2	Correct	29 ms	8028 KB	Output is correct
3	Correct	27 ms	7508 KB	Output is correct
4	Correct	28 ms	8532 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 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	6492 KB	Output is correct
12	Correct	5 ms	6492 KB	Output is correct
13	Correct	5 ms	6624 KB	Output is correct
14	Correct	4 ms	6236 KB	Output is correct
15	Correct	4 ms	6492 KB	Output is correct
16	Correct	4 ms	6492 KB	Output is correct
17	Correct	30 ms	8028 KB	Output is correct
18	Correct	27 ms	8016 KB	Output is correct
19	Correct	28 ms	7772 KB	Output is correct
20	Correct	33 ms	8024 KB	Output is correct
21	Correct	38 ms	8276 KB	Output is correct
22	Correct	27 ms	8276 KB	Output is correct
23	Correct	30 ms	7772 KB	Output is correct
24	Correct	27 ms	8024 KB	Output is correct
25	Correct	30 ms	8288 KB	Output is correct
26	Correct	26 ms	8028 KB	Output is correct
27	Correct	25 ms	8028 KB	Output is correct
28	Correct	26 ms	8276 KB	Output is correct
29	Correct	4 ms	5980 KB	Output is correct
30	Correct	5 ms	6652 KB	Output is correct
31	Incorrect	5 ms	6236 KB	Output isn't correct
32	Halted	0 ms	0 KB	-