oj.uz

Submission #964533

# Submission time Handle Problem Language Result Execution time Memory
964533 2024-04-17T05:17:38 Z UmairAhmadMirza Mutating DNA (IOI21_dna) C++17
100 / 100
 33 ms 5708 KB 
#include <bits/stdc++.h>
using namespace std;
int const N=1e5+5;
int n;
string a,b;
// int preA[N],preT[N],preC[N];
int AT[N],TC[N],CA[N];
int eq[N];
void init(string aa,string bb){
	n=aa.length();
	a=aa;
	b=bb;
	for (int i = 1; i <=n; ++i)
	{
		// preA[i]=preA[i-1];
		// preT[i]=preT[i-1];
		// preC[i]=preC[i-1];
		AT[i]=AT[i-1];
		CA[i]=CA[i-1];
		TC[i]=TC[i-1];
		eq[i]=eq[i-1];
		// if(b[i-1]=='A')
		// 	preA[i]++;
		// else if(b[i-1]=='T')
		// 	preT[i]++;
		// else
		// 	preC[i]++;
		if(a[i-1]==b[i-1])
			eq[i]++;
		else if(a[i-1]=='A'&&b[i-1]=='T')
			AT[i]++;
		else if(a[i-1]=='T'&&b[i-1]=='A')
			AT[i]--;
		else if(a[i-1]=='T'&&b[i-1]=='C')
			TC[i]++;
		else if(a[i-1]=='C'&&b[i-1]=='T')
			TC[i]--;
		else if(a[i-1]=='C'&&b[i-1]=='A')
			CA[i]++;
		else
			CA[i]--;
	}
}
int get_distance(int x, int y){
	//check
	y++;
	int one=AT[y]-AT[x];
	int two=TC[y]-TC[x];
	int three=CA[y]-CA[x];
	// cout<<one<<' '<<two<<' '<<three<<endl;
	if(one!=two || one!=three)
		return -1;
	int ans=abs(one)*2;
	int tot=y-x;
	tot-=(eq[y]-eq[x]);
	tot-=abs(one)*3;
	ans+=tot/2;
	return ans;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 4188 KB Output is correct
2 Correct 25 ms 4800 KB Output is correct
3 Correct 24 ms 4476 KB Output is correct
4 Correct 28 ms 4724 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 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 1 ms 348 KB Output is correct
4 Correct 3 ms 2648 KB Output is correct
5 Correct 3 ms 2648 KB Output is correct
6 Correct 3 ms 2684 KB Output is correct
7 Correct 2 ms 2648 KB Output is correct
8 Correct 3 ms 2792 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 1 ms 348 KB Output is correct
4 Correct 3 ms 2648 KB Output is correct
5 Correct 3 ms 2648 KB Output is correct
6 Correct 3 ms 2684 KB Output is correct
7 Correct 2 ms 2648 KB Output is correct
8 Correct 3 ms 2792 KB Output is correct
9 Correct 2 ms 2652 KB Output is correct
10 Correct 26 ms 4860 KB Output is correct
11 Correct 29 ms 4872 KB Output is correct
12 Correct 26 ms 5204 KB Output is correct
13 Correct 26 ms 5044 KB Output is correct
14 Correct 31 ms 5200 KB Output is correct
15 Correct 26 ms 4448 KB Output is correct
16 Correct 29 ms 5076 KB Output is correct
17 Correct 30 ms 4792 KB Output is correct
18 Correct 26 ms 5276 KB Output is correct
19 Correct 30 ms 5488 KB Output is correct
20 Correct 24 ms 5020 KB Output is correct
21 Correct 27 ms 5196 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 1 ms 348 KB Output is correct
4 Correct 3 ms 2648 KB Output is correct
5 Correct 3 ms 2648 KB Output is correct
6 Correct 3 ms 2684 KB Output is correct
7 Correct 2 ms 2648 KB Output is correct
8 Correct 3 ms 2792 KB Output is correct
9 Correct 2 ms 2652 KB Output is correct
10 Correct 3 ms 2904 KB Output is correct
11 Correct 4 ms 2808 KB Output is correct
12 Correct 3 ms 2712 KB Output is correct
13 Correct 3 ms 2692 KB Output is correct
14 Correct 4 ms 2648 KB Output is correct
15 Correct 4 ms 2908 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 4188 KB Output is correct
2 Correct 25 ms 4800 KB Output is correct
3 Correct 24 ms 4476 KB Output is correct
4 Correct 28 ms 4724 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 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 1 ms 348 KB Output is correct
11 Correct 3 ms 2648 KB Output is correct
12 Correct 3 ms 2648 KB Output is correct
13 Correct 3 ms 2684 KB Output is correct
14 Correct 2 ms 2648 KB Output is correct
15 Correct 3 ms 2792 KB Output is correct
16 Correct 2 ms 2652 KB Output is correct
17 Correct 26 ms 4860 KB Output is correct
18 Correct 29 ms 4872 KB Output is correct
19 Correct 26 ms 5204 KB Output is correct
20 Correct 26 ms 5044 KB Output is correct
21 Correct 31 ms 5200 KB Output is correct
22 Correct 26 ms 4448 KB Output is correct
23 Correct 29 ms 5076 KB Output is correct
24 Correct 30 ms 4792 KB Output is correct
25 Correct 26 ms 5276 KB Output is correct
26 Correct 30 ms 5488 KB Output is correct
27 Correct 24 ms 5020 KB Output is correct
28 Correct 27 ms 5196 KB Output is correct
29 Correct 3 ms 2904 KB Output is correct
30 Correct 4 ms 2808 KB Output is correct
31 Correct 3 ms 2712 KB Output is correct
32 Correct 3 ms 2692 KB Output is correct
33 Correct 4 ms 2648 KB Output is correct
34 Correct 4 ms 2908 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 26 ms 4956 KB Output is correct
37 Correct 27 ms 5160 KB Output is correct
38 Correct 33 ms 5128 KB Output is correct
39 Correct 28 ms 5148 KB Output is correct
40 Correct 26 ms 5460 KB Output is correct
41 Correct 2 ms 2908 KB Output is correct
42 Correct 28 ms 5236 KB Output is correct
43 Correct 31 ms 5364 KB Output is correct
44 Correct 25 ms 5424 KB Output is correct
45 Correct 25 ms 5100 KB Output is correct
46 Correct 24 ms 5708 KB Output is correct
47 Correct 28 ms 5204 KB Output is correct