oj.uz

Submission #531588

# Submission time Handle Problem Language Result Execution time Memory
531588 2022-03-01T04:39:09 Z 79brue Mutating DNA (IOI21_dna) C++17
100 / 100
 37 ms 8580 KB 
#include "dna.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

int n;
int cnt[100002][3];
int sum[100002][3][3];

void init(std::string a, std::string b){
    n = (int)a.size();
    for(int i=1; i<=n; i++){
        for(int j=0; j<3; j++) for(int k=0; k<3; k++) sum[i][j][k] = sum[i-1][j][k];
        for(int j=0; j<3; j++) cnt[i][j] = cnt[i-1][j];
        sum[i][a[i-1]=='A'?0:a[i-1]=='T'?1:2][b[i-1]=='A'?0:b[i-1]=='T'?1:2]++;
        cnt[i][a[i-1]=='A'?0:a[i-1]=='T'?1:2]++;
        cnt[i][b[i-1]=='A'?0:b[i-1]=='T'?1:2]--;
    }
}

int get_distance(int x, int y) {
    x++, y++;
	int ans = 0;
	int c[3][3]={{0}};
	for(int i=0; i<3; i++) for(int j=0; j<3; j++) c[i][j] = sum[y][i][j] - sum[x-1][i][j];

	if(cnt[y][0] != cnt[x-1][0]) return -1;
	if(cnt[y][1] != cnt[x-1][1]) return -1;
	if(cnt[y][2] != cnt[x-1][2]) return -1;

	int tmp;
	tmp = min(c[0][1], c[1][0]);
	c[0][1] -= tmp, c[1][0] -= tmp, ans += tmp;
	tmp = min(c[0][2], c[2][0]);
	c[0][2] -= tmp, c[2][0] -= tmp, ans += tmp;
	tmp = min(c[2][1], c[1][2]);
	c[2][1] -= tmp, c[1][2] -= tmp, ans += tmp;

	ans += 2 * (c[0][1] + c[1][0]);
	return ans;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 8108 KB Output is correct
2 Correct 36 ms 8120 KB Output is correct
3 Correct 35 ms 7636 KB Output is correct
4 Correct 35 ms 8180 KB Output is correct
5 Correct 1 ms 300 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 5708 KB Output is correct
5 Correct 5 ms 5688 KB Output is correct
6 Correct 5 ms 5708 KB Output is correct
7 Correct 5 ms 5324 KB Output is correct
8 Correct 5 ms 5676 KB Output is correct
9 Correct 5 ms 5808 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 5708 KB Output is correct
5 Correct 5 ms 5688 KB Output is correct
6 Correct 5 ms 5708 KB Output is correct
7 Correct 5 ms 5324 KB Output is correct
8 Correct 5 ms 5676 KB Output is correct
9 Correct 5 ms 5808 KB Output is correct
10 Correct 34 ms 8068 KB Output is correct
11 Correct 34 ms 8176 KB Output is correct
12 Correct 34 ms 8164 KB Output is correct
13 Correct 36 ms 8228 KB Output is correct
14 Correct 33 ms 8448 KB Output is correct
15 Correct 34 ms 8448 KB Output is correct
16 Correct 31 ms 8040 KB Output is correct
17 Correct 31 ms 8156 KB Output is correct
18 Correct 31 ms 8448 KB Output is correct
19 Correct 29 ms 8016 KB Output is correct
20 Correct 31 ms 8188 KB Output is correct
21 Correct 32 ms 8512 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 5708 KB Output is correct
5 Correct 5 ms 5688 KB Output is correct
6 Correct 5 ms 5708 KB Output is correct
7 Correct 5 ms 5324 KB Output is correct
8 Correct 5 ms 5676 KB Output is correct
9 Correct 5 ms 5808 KB Output is correct
10 Correct 5 ms 5300 KB Output is correct
11 Correct 5 ms 5708 KB Output is correct
12 Correct 5 ms 5324 KB Output is correct
13 Correct 6 ms 5628 KB Output is correct
14 Correct 5 ms 5708 KB Output is correct
15 Correct 5 ms 5708 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 8108 KB Output is correct
2 Correct 36 ms 8120 KB Output is correct
3 Correct 35 ms 7636 KB Output is correct
4 Correct 35 ms 8180 KB Output is correct
5 Correct 1 ms 300 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 5708 KB Output is correct
12 Correct 5 ms 5688 KB Output is correct
13 Correct 5 ms 5708 KB Output is correct
14 Correct 5 ms 5324 KB Output is correct
15 Correct 5 ms 5676 KB Output is correct
16 Correct 5 ms 5808 KB Output is correct
17 Correct 34 ms 8068 KB Output is correct
18 Correct 34 ms 8176 KB Output is correct
19 Correct 34 ms 8164 KB Output is correct
20 Correct 36 ms 8228 KB Output is correct
21 Correct 33 ms 8448 KB Output is correct
22 Correct 34 ms 8448 KB Output is correct
23 Correct 31 ms 8040 KB Output is correct
24 Correct 31 ms 8156 KB Output is correct
25 Correct 31 ms 8448 KB Output is correct
26 Correct 29 ms 8016 KB Output is correct
27 Correct 31 ms 8188 KB Output is correct
28 Correct 32 ms 8512 KB Output is correct
29 Correct 5 ms 5300 KB Output is correct
30 Correct 5 ms 5708 KB Output is correct
31 Correct 5 ms 5324 KB Output is correct
32 Correct 6 ms 5628 KB Output is correct
33 Correct 5 ms 5708 KB Output is correct
34 Correct 5 ms 5708 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 37 ms 7632 KB Output is correct
37 Correct 35 ms 8176 KB Output is correct
38 Correct 34 ms 8164 KB Output is correct
39 Correct 36 ms 8580 KB Output is correct
40 Correct 36 ms 8576 KB Output is correct
41 Correct 4 ms 5716 KB Output is correct
42 Correct 34 ms 8152 KB Output is correct
43 Correct 32 ms 8420 KB Output is correct
44 Correct 33 ms 8424 KB Output is correct
45 Correct 31 ms 8152 KB Output is correct
46 Correct 32 ms 8412 KB Output is correct
47 Correct 30 ms 8424 KB Output is correct