oj.uz

Submission #437110

# Submission time Handle Problem Language Result Execution time Memory
437110 2021-06-25T19:48:18 Z dqhungdl Mutating DNA (IOI21_dna) C++17
100 / 100
 50 ms 6064 KB 
#include "dna.h"

#include <bits/stdc++.h>
using namespace std;

int n,S[100005][3][3];

int getId(char c) {
	if(c=='A')
		return 0;
	if(c=='C')
		return 1;
	return 2;
}

void init(std::string a, std::string b) {
	n=a.size();
	for(int i=0;i<n;i++) {
		if(i>0)
			for(int t1=0;t1<3;t1++)
				for(int t2=0;t2<3;t2++)
					S[i][t1][t2]=S[i-1][t1][t2];
		S[i][getId(a[i])][getId(b[i])]++;
	}
}

int get_distance(int x, int y) {
	int C[3][3];
	for(int t1=0;t1<3;t1++)
		for(int t2=0;t2<3;t2++)
			C[t1][t2]=S[y][t1][t2]-(x==0?0:S[x-1][t1][t2]);
	if(C[0][1]+C[0][2]!=C[1][0]+C[2][0]||C[1][0]+C[1][2]!=C[0][1]+C[2][1])
		return -1;
	int s1=0,s2=1e9;
	for(int t1=0;t1<3;t1++)
		for(int t2=t1+1;t2<3;t2++) {
			int tmp=min(C[t1][t2],C[t2][t1]);
			C[t1][t2]-=tmp;
			C[t2][t1]-=tmp;
			s1+=tmp;
		}
	for(int t1=0;t1<3;t1++)
		for(int t2=t1+1;t2<3;t2++)
			s2=min(s2,max(C[t1][t2],C[t2][t1]));
	return s1+2*s2;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 5608 KB Output is correct
2 Correct 42 ms 5628 KB Output is correct
3 Correct 41 ms 5348 KB Output is correct
4 Correct 42 ms 5596 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 5 ms 4300 KB Output is correct
5 Correct 7 ms 4304 KB Output is correct
6 Correct 5 ms 4300 KB Output is correct
7 Correct 5 ms 4024 KB Output is correct
8 Correct 5 ms 4300 KB Output is correct
9 Correct 5 ms 4400 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 5 ms 4300 KB Output is correct
5 Correct 7 ms 4304 KB Output is correct
6 Correct 5 ms 4300 KB Output is correct
7 Correct 5 ms 4024 KB Output is correct
8 Correct 5 ms 4300 KB Output is correct
9 Correct 5 ms 4400 KB Output is correct
10 Correct 41 ms 5628 KB Output is correct
11 Correct 43 ms 5672 KB Output is correct
12 Correct 43 ms 5860 KB Output is correct
13 Correct 44 ms 5776 KB Output is correct
14 Correct 43 ms 6016 KB Output is correct
15 Correct 41 ms 6008 KB Output is correct
16 Correct 39 ms 5776 KB Output is correct
17 Correct 40 ms 5900 KB Output is correct
18 Correct 49 ms 6028 KB Output is correct
19 Correct 38 ms 5740 KB Output is correct
20 Correct 38 ms 5884 KB Output is correct
21 Correct 38 ms 6012 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 5 ms 4300 KB Output is correct
5 Correct 7 ms 4304 KB Output is correct
6 Correct 5 ms 4300 KB Output is correct
7 Correct 5 ms 4024 KB Output is correct
8 Correct 5 ms 4300 KB Output is correct
9 Correct 5 ms 4400 KB Output is correct
10 Correct 5 ms 3996 KB Output is correct
11 Correct 5 ms 4300 KB Output is correct
12 Correct 5 ms 4044 KB Output is correct
13 Correct 6 ms 4428 KB Output is correct
14 Correct 6 ms 4300 KB Output is correct
15 Correct 6 ms 4332 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 5608 KB Output is correct
2 Correct 42 ms 5628 KB Output is correct
3 Correct 41 ms 5348 KB Output is correct
4 Correct 42 ms 5596 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 5 ms 4300 KB Output is correct
12 Correct 7 ms 4304 KB Output is correct
13 Correct 5 ms 4300 KB Output is correct
14 Correct 5 ms 4024 KB Output is correct
15 Correct 5 ms 4300 KB Output is correct
16 Correct 5 ms 4400 KB Output is correct
17 Correct 41 ms 5628 KB Output is correct
18 Correct 43 ms 5672 KB Output is correct
19 Correct 43 ms 5860 KB Output is correct
20 Correct 44 ms 5776 KB Output is correct
21 Correct 43 ms 6016 KB Output is correct
22 Correct 41 ms 6008 KB Output is correct
23 Correct 39 ms 5776 KB Output is correct
24 Correct 40 ms 5900 KB Output is correct
25 Correct 49 ms 6028 KB Output is correct
26 Correct 38 ms 5740 KB Output is correct
27 Correct 38 ms 5884 KB Output is correct
28 Correct 38 ms 6012 KB Output is correct
29 Correct 5 ms 3996 KB Output is correct
30 Correct 5 ms 4300 KB Output is correct
31 Correct 5 ms 4044 KB Output is correct
32 Correct 6 ms 4428 KB Output is correct
33 Correct 6 ms 4300 KB Output is correct
34 Correct 6 ms 4332 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 42 ms 5352 KB Output is correct
37 Correct 43 ms 5652 KB Output is correct
38 Correct 42 ms 5788 KB Output is correct
39 Correct 43 ms 6012 KB Output is correct
40 Correct 41 ms 6012 KB Output is correct
41 Correct 5 ms 4300 KB Output is correct
42 Correct 40 ms 5840 KB Output is correct
43 Correct 40 ms 6012 KB Output is correct
44 Correct 40 ms 5952 KB Output is correct
45 Correct 41 ms 5816 KB Output is correct
46 Correct 50 ms 6016 KB Output is correct
47 Correct 38 ms 6064 KB Output is correct