oj.uz

Submission #565409

# Submission time Handle Problem Language Result Execution time Memory
565409 2022-05-20T21:00:00 Z TomkeMonke Mutating DNA (IOI21_dna) C++17
100 / 100
 60 ms 6868 KB 
#include <bits/stdc++.h>
#include "dna.h"

using namespace std;

const int MAXN = 1e5 + 7;

int word1[MAXN];
int word2[MAXN];

int pref[MAXN][3][3];

void init(string a, string b){
	
	int n = a.size();
	
	for(int i = 0; i < n; i++){
		
		if(a[i] == 'A')
			word1[i + 1] = 0;
		
		if(a[i] == 'T')
			word1[i + 1] = 1;
		
		if(a[i] == 'C')
			word1[i + 1] = 2;
			
		if(b[i] == 'A')
			word2[i + 1] = 0;
		
		if(b[i] == 'T')
			word2[i + 1] = 1;
		
		if(b[i] == 'C')
			word2[i + 1] = 2;
	}
	
	for(int i = 1; i <= n; i++){
		
		for(int c1 = 0; c1 < 3; c1++){
			
			for(int c2 = 0; c2 < 3; c2++){
				
				if((word1[i] == c1) && (word2[i] == c2))
					pref[i][c1][c2] = pref[i - 1][c1][c2] + 1;
				
				else 
					pref[i][c1][c2] = pref[i - 1][c1][c2] + 0;
			}
		}
	}
}


int get_distance(int x, int y){
	
	x = x + 1;
	y = y + 1;
	
	// 0 - A, 1 - T, 2 - C
	// 0 -> 1 (zamiana A na T)
	
	int AT = pref[y][0][1] - pref[x - 1][0][1];
	int TA = pref[y][1][0] - pref[x - 1][1][0];
	
	int TC = pref[y][1][2] - pref[x - 1][1][2];
	int CT = pref[y][2][1] - pref[x - 1][2][1];
	
	int CA = pref[y][2][0] - pref[x - 1][2][0];
	int AC = pref[y][0][2] - pref[x - 1][0][2];
	
	if((AT + AC == TA + CA) && (TA + TC == AT + CT)){
		
		int ans = min(AT, TA) + min(TC, CT) + min(CA, AC);
		ans += 2 * abs(AT - TA);
		
		return ans;
	}
	
	else return -1;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 6364 KB Output is correct
2 Correct 60 ms 6456 KB Output is correct
3 Correct 37 ms 6004 KB Output is correct
4 Correct 40 ms 6432 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 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 1 ms 256 KB Output is correct
4 Correct 9 ms 5076 KB Output is correct
5 Correct 6 ms 5076 KB Output is correct
6 Correct 8 ms 5076 KB Output is correct
7 Correct 6 ms 4820 KB Output is correct
8 Correct 9 ms 5116 KB Output is correct
9 Correct 5 ms 5076 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 1 ms 256 KB Output is correct
4 Correct 9 ms 5076 KB Output is correct
5 Correct 6 ms 5076 KB Output is correct
6 Correct 8 ms 5076 KB Output is correct
7 Correct 6 ms 4820 KB Output is correct
8 Correct 9 ms 5116 KB Output is correct
9 Correct 5 ms 5076 KB Output is correct
10 Correct 46 ms 6412 KB Output is correct
11 Correct 38 ms 6396 KB Output is correct
12 Correct 49 ms 6396 KB Output is correct
13 Correct 40 ms 6532 KB Output is correct
14 Correct 38 ms 6780 KB Output is correct
15 Correct 46 ms 6788 KB Output is correct
16 Correct 38 ms 6516 KB Output is correct
17 Correct 46 ms 6656 KB Output is correct
18 Correct 38 ms 6772 KB Output is correct
19 Correct 34 ms 6520 KB Output is correct
20 Correct 35 ms 6676 KB Output is correct
21 Correct 45 ms 6804 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 1 ms 256 KB Output is correct
4 Correct 9 ms 5076 KB Output is correct
5 Correct 6 ms 5076 KB Output is correct
6 Correct 8 ms 5076 KB Output is correct
7 Correct 6 ms 4820 KB Output is correct
8 Correct 9 ms 5116 KB Output is correct
9 Correct 5 ms 5076 KB Output is correct
10 Correct 7 ms 4692 KB Output is correct
11 Correct 8 ms 5076 KB Output is correct
12 Correct 6 ms 4820 KB Output is correct
13 Correct 9 ms 5076 KB Output is correct
14 Correct 7 ms 5076 KB Output is correct
15 Correct 7 ms 5132 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 6364 KB Output is correct
2 Correct 60 ms 6456 KB Output is correct
3 Correct 37 ms 6004 KB Output is correct
4 Correct 40 ms 6432 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 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 1 ms 256 KB Output is correct
11 Correct 9 ms 5076 KB Output is correct
12 Correct 6 ms 5076 KB Output is correct
13 Correct 8 ms 5076 KB Output is correct
14 Correct 6 ms 4820 KB Output is correct
15 Correct 9 ms 5116 KB Output is correct
16 Correct 5 ms 5076 KB Output is correct
17 Correct 46 ms 6412 KB Output is correct
18 Correct 38 ms 6396 KB Output is correct
19 Correct 49 ms 6396 KB Output is correct
20 Correct 40 ms 6532 KB Output is correct
21 Correct 38 ms 6780 KB Output is correct
22 Correct 46 ms 6788 KB Output is correct
23 Correct 38 ms 6516 KB Output is correct
24 Correct 46 ms 6656 KB Output is correct
25 Correct 38 ms 6772 KB Output is correct
26 Correct 34 ms 6520 KB Output is correct
27 Correct 35 ms 6676 KB Output is correct
28 Correct 45 ms 6804 KB Output is correct
29 Correct 7 ms 4692 KB Output is correct
30 Correct 8 ms 5076 KB Output is correct
31 Correct 6 ms 4820 KB Output is correct
32 Correct 9 ms 5076 KB Output is correct
33 Correct 7 ms 5076 KB Output is correct
34 Correct 7 ms 5132 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 47 ms 5996 KB Output is correct
37 Correct 38 ms 6476 KB Output is correct
38 Correct 51 ms 6572 KB Output is correct
39 Correct 41 ms 6760 KB Output is correct
40 Correct 40 ms 6784 KB Output is correct
41 Correct 5 ms 5076 KB Output is correct
42 Correct 39 ms 6528 KB Output is correct
43 Correct 37 ms 6772 KB Output is correct
44 Correct 37 ms 6760 KB Output is correct
45 Correct 35 ms 6536 KB Output is correct
46 Correct 41 ms 6868 KB Output is correct
47 Correct 53 ms 6808 KB Output is correct