oj.uz

Submission #954821

# Submission time Handle Problem Language Result Execution time Memory
954821 2024-03-28T15:55:43 Z 4QT0R Mutating DNA (IOI21_dna) C++17
100 / 100
 31 ms 6156 KB 
#include <bits/stdc++.h>
using namespace std;

int ac[100002];
int ca[100002];
int at[100002];
int ta[100002];
int ct[100002];
int tc[100002];
int n;

void init(string a, string b){
	n=a.size();
	for (int i = 1; i<=n; i++){
		ac[i]=ac[i-1];
		ca[i]=ca[i-1];
		at[i]=at[i-1];
		ta[i]=ta[i-1];
		ct[i]=ct[i-1];
		tc[i]=tc[i-1];
		if (a[i-1]=='A'){
			if (b[i-1]=='C')ac[i]++;
			if (b[i-1]=='T')at[i]++;
		}
		else if (a[i-1]=='C'){
			if (b[i-1]=='A')ca[i]++;
			if (b[i-1]=='T')ct[i]++;
		}
		else{
			if (b[i-1]=='A')ta[i]++;
			if (b[i-1]=='C')tc[i]++;
		}
	}
}

int get_distance(int x, int y){
	y++;
	int pac=ac[y]-ac[x];
	int pca=ca[y]-ca[x];
	int pat=at[y]-at[x];
	int pta=ta[y]-ta[x];
	int pct=ct[y]-ct[x];
	int ptc=tc[y]-tc[x];
	int ans=0;
	int a1=pac+pat,a2=pca+pta,t1=pta+ptc,t2=pat+pct,c1=pca+pct,c2=pac+ptc;
	if (a1!=a2 || t1!=t2 || c1!=c2)return -1;
	if (pca<pac){
		ans+=pca;
		pac-=pca;
		ans+=2*pac;
	}
	else{
		ans+=pac;
		pca-=pac;
		ans+=2*pca;
	}
	if (pat<pta){
		ans+=pat;
		pta-=pat;
	}
	else{
		ans+=pta;
		pat-=pta;
	}
	if (pct<ptc){
		ans+=pct;
		ptc-=pct;
	}
	else{
		ans+=ptc;
		pct-=ptc;
	}
	return ans;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 4712 KB Output is correct
2 Correct 25 ms 5388 KB Output is correct
3 Correct 30 ms 4904 KB Output is correct
4 Correct 25 ms 5136 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 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 3288 KB Output is correct
5 Correct 3 ms 3420 KB Output is correct
6 Correct 3 ms 3420 KB Output is correct
7 Correct 3 ms 3164 KB Output is correct
8 Correct 3 ms 3420 KB Output is correct
9 Correct 2 ms 3420 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 3288 KB Output is correct
5 Correct 3 ms 3420 KB Output is correct
6 Correct 3 ms 3420 KB Output is correct
7 Correct 3 ms 3164 KB Output is correct
8 Correct 3 ms 3420 KB Output is correct
9 Correct 2 ms 3420 KB Output is correct
10 Correct 24 ms 5404 KB Output is correct
11 Correct 24 ms 5388 KB Output is correct
12 Correct 26 ms 5772 KB Output is correct
13 Correct 26 ms 5448 KB Output is correct
14 Correct 26 ms 5900 KB Output is correct
15 Correct 25 ms 4896 KB Output is correct
16 Correct 31 ms 5664 KB Output is correct
17 Correct 25 ms 5144 KB Output is correct
18 Correct 26 ms 5644 KB Output is correct
19 Correct 23 ms 6084 KB Output is correct
20 Correct 25 ms 5400 KB Output is correct
21 Correct 24 ms 5900 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 3288 KB Output is correct
5 Correct 3 ms 3420 KB Output is correct
6 Correct 3 ms 3420 KB Output is correct
7 Correct 3 ms 3164 KB Output is correct
8 Correct 3 ms 3420 KB Output is correct
9 Correct 2 ms 3420 KB Output is correct
10 Correct 3 ms 3160 KB Output is correct
11 Correct 3 ms 3420 KB Output is correct
12 Correct 3 ms 3164 KB Output is correct
13 Correct 3 ms 3420 KB Output is correct
14 Correct 5 ms 3232 KB Output is correct
15 Correct 4 ms 3420 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 4712 KB Output is correct
2 Correct 25 ms 5388 KB Output is correct
3 Correct 30 ms 4904 KB Output is correct
4 Correct 25 ms 5136 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 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 3288 KB Output is correct
12 Correct 3 ms 3420 KB Output is correct
13 Correct 3 ms 3420 KB Output is correct
14 Correct 3 ms 3164 KB Output is correct
15 Correct 3 ms 3420 KB Output is correct
16 Correct 2 ms 3420 KB Output is correct
17 Correct 24 ms 5404 KB Output is correct
18 Correct 24 ms 5388 KB Output is correct
19 Correct 26 ms 5772 KB Output is correct
20 Correct 26 ms 5448 KB Output is correct
21 Correct 26 ms 5900 KB Output is correct
22 Correct 25 ms 4896 KB Output is correct
23 Correct 31 ms 5664 KB Output is correct
24 Correct 25 ms 5144 KB Output is correct
25 Correct 26 ms 5644 KB Output is correct
26 Correct 23 ms 6084 KB Output is correct
27 Correct 25 ms 5400 KB Output is correct
28 Correct 24 ms 5900 KB Output is correct
29 Correct 3 ms 3160 KB Output is correct
30 Correct 3 ms 3420 KB Output is correct
31 Correct 3 ms 3164 KB Output is correct
32 Correct 3 ms 3420 KB Output is correct
33 Correct 5 ms 3232 KB Output is correct
34 Correct 4 ms 3420 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 24 ms 5392 KB Output is correct
37 Correct 24 ms 5604 KB Output is correct
38 Correct 25 ms 5656 KB Output is correct
39 Correct 26 ms 5616 KB Output is correct
40 Correct 27 ms 5912 KB Output is correct
41 Correct 2 ms 3420 KB Output is correct
42 Correct 25 ms 5660 KB Output is correct
43 Correct 25 ms 5648 KB Output is correct
44 Correct 25 ms 6040 KB Output is correct
45 Correct 24 ms 5668 KB Output is correct
46 Correct 23 ms 6156 KB Output is correct
47 Correct 24 ms 5652 KB Output is correct