oj.uz

Submission #581644

# Submission time Handle Problem Language Result Execution time Memory
581644 2022-06-23T00:36:02 Z penguinhacker Mutating DNA (IOI21_dna) C++17
100 / 100
 50 ms 8944 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ar array

const int mxN=1e5;
map<char, int> mp;
int cnt1[mxN+1][3], cnt2[mxN+1][3][3], bad[mxN+1];

void init(string a, string b) {
	mp['A']=0, mp['T']=1, mp['C']=2;
	int n=a.size();
	for (int i=0; i<n; ++i) {
		for (int x=0; x<3; ++x) {
			cnt1[i+1][x]=cnt1[i][x]+(mp[a[i]]==x)-(mp[b[i]]==x);
			for (int y=0; y<3; ++y)
				cnt2[i+1][x][y]=cnt2[i][x][y]+(mp[a[i]]==x&&mp[b[i]]==y);
		}
		bad[i+1]=bad[i]+(a[i]!=b[i]);
	}
}

int get_distance(int x, int y) {
	for (int i=0; i<3; ++i)
		if (cnt1[y+1][i]-cnt1[x][i])
			return -1;
	int ans=0, extra=0;
	for (int i=0; i<3; ++i)
		for (int j=i+1; j<3; ++j) {
			int a=cnt2[y+1][i][j]-cnt2[x][i][j];
			int b=cnt2[y+1][j][i]-cnt2[x][j][i];
			ans+=min(a, b);
			extra+=max(a, b)-min(a, b);
		}
	assert(extra%3==0);
	return ans+extra/3*2;
}

/*int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	init("ATACAT", "ACTATA");
	cout << get_distance(1, 3) << " " << get_distance(4, 5) << " " << get_distance(3, 5);
	return 0;
}*/

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 7176 KB Output is correct
2 Correct 43 ms 7176 KB Output is correct
3 Correct 45 ms 6900 KB Output is correct
4 Correct 50 ms 7304 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 13 ms 5844 KB Output is correct
5 Correct 13 ms 5972 KB Output is correct
6 Correct 13 ms 5864 KB Output is correct
7 Correct 12 ms 5588 KB Output is correct
8 Correct 13 ms 5972 KB Output is correct
9 Correct 10 ms 5972 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 13 ms 5844 KB Output is correct
5 Correct 13 ms 5972 KB Output is correct
6 Correct 13 ms 5864 KB Output is correct
7 Correct 12 ms 5588 KB Output is correct
8 Correct 13 ms 5972 KB Output is correct
9 Correct 10 ms 5972 KB Output is correct
10 Correct 44 ms 7220 KB Output is correct
11 Correct 42 ms 7176 KB Output is correct
12 Correct 40 ms 7236 KB Output is correct
13 Correct 40 ms 7308 KB Output is correct
14 Correct 42 ms 7560 KB Output is correct
15 Correct 42 ms 7504 KB Output is correct
16 Correct 37 ms 7160 KB Output is correct
17 Correct 36 ms 7316 KB Output is correct
18 Correct 38 ms 7568 KB Output is correct
19 Correct 34 ms 7200 KB Output is correct
20 Correct 35 ms 7444 KB Output is correct
21 Correct 35 ms 7564 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 13 ms 5844 KB Output is correct
5 Correct 13 ms 5972 KB Output is correct
6 Correct 13 ms 5864 KB Output is correct
7 Correct 12 ms 5588 KB Output is correct
8 Correct 13 ms 5972 KB Output is correct
9 Correct 10 ms 5972 KB Output is correct
10 Correct 13 ms 5460 KB Output is correct
11 Correct 14 ms 5972 KB Output is correct
12 Correct 13 ms 5540 KB Output is correct
13 Correct 14 ms 6100 KB Output is correct
14 Correct 15 ms 6084 KB Output is correct
15 Correct 12 ms 6112 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 7176 KB Output is correct
2 Correct 43 ms 7176 KB Output is correct
3 Correct 45 ms 6900 KB Output is correct
4 Correct 50 ms 7304 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 13 ms 5844 KB Output is correct
12 Correct 13 ms 5972 KB Output is correct
13 Correct 13 ms 5864 KB Output is correct
14 Correct 12 ms 5588 KB Output is correct
15 Correct 13 ms 5972 KB Output is correct
16 Correct 10 ms 5972 KB Output is correct
17 Correct 44 ms 7220 KB Output is correct
18 Correct 42 ms 7176 KB Output is correct
19 Correct 40 ms 7236 KB Output is correct
20 Correct 40 ms 7308 KB Output is correct
21 Correct 42 ms 7560 KB Output is correct
22 Correct 42 ms 7504 KB Output is correct
23 Correct 37 ms 7160 KB Output is correct
24 Correct 36 ms 7316 KB Output is correct
25 Correct 38 ms 7568 KB Output is correct
26 Correct 34 ms 7200 KB Output is correct
27 Correct 35 ms 7444 KB Output is correct
28 Correct 35 ms 7564 KB Output is correct
29 Correct 13 ms 5460 KB Output is correct
30 Correct 14 ms 5972 KB Output is correct
31 Correct 13 ms 5540 KB Output is correct
32 Correct 14 ms 6100 KB Output is correct
33 Correct 15 ms 6084 KB Output is correct
34 Correct 12 ms 6112 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 40 ms 8040 KB Output is correct
37 Correct 47 ms 8564 KB Output is correct
38 Correct 42 ms 8656 KB Output is correct
39 Correct 42 ms 8944 KB Output is correct
40 Correct 44 ms 8928 KB Output is correct
41 Correct 10 ms 6100 KB Output is correct
42 Correct 39 ms 8544 KB Output is correct
43 Correct 40 ms 8824 KB Output is correct
44 Correct 41 ms 8816 KB Output is correct
45 Correct 38 ms 8560 KB Output is correct
46 Correct 39 ms 8816 KB Output is correct
47 Correct 38 ms 8832 KB Output is correct