oj.uz

Submission #438685

# Submission time Handle Problem Language Result Execution time Memory
438685 2021-06-28T13:01:25 Z ivan_tudor Mutating DNA (IOI21_dna) C++17
100 / 100
 65 ms 6096 KB 
#include "dna.h"
#include<bits/stdc++.h>
using namespace std;
const int N = 100005;
int comb[N][3][3];
int getcode(char c){
	if(c == 'A')
		return 0;
	if(c == 'C')
		return 1;
	return 2;
}
void init(std::string a, std::string b) {
	int n = a.size();
	for(int i = 0; i <n; i++){
		comb[i][getcode(a[i])][getcode(b[i])] = 1;
		if(i != 0){
			for(int j = 0; j < 3; j++){
				for(int k = 0; k < 3; k++)
					comb[i][j][k] += comb[i-1][j][k];
			}
		}
	}
}

int get_distance(int x, int y) {
	int ans[3][3];
	for(int i = 0; i < 3; i++){
		for(int j = 0; j < 3; j++){
			ans[i][j] = comb[y][i][j];
		}
	}
	x--;
	if(x>=0){
		for(int i = 0; i < 3; i++){
			for(int j = 0; j < 3; j++){
				ans[i][j] -= comb[x][i][j];
			}
		}
	}
	int alet[3] = {0, 0, 0};
	int blet[3] = {0, 0, 0};
	for(int i = 0; i <3; i++){
		for(int j = 0; j < 3; j++){
			alet[i] += ans[i][j];
			blet[j] += ans[i][j];
		}
	}
	for(int i = 0; i < 3; i++)
		if(alet[i] != blet[i])
			return -1;
	int rsp = 0;
	for(int i = 0; i < 3; i++){
		for(int j = i +1; j < 3; j++){
			int x = min(ans[i][j], ans[j][i]);
			rsp += x;
			ans[i][j] -= x;
			ans[j][i] -= x;
		}
	}
	int val = 0;
	for(int i = 0; i < 3; i++){
		for(int j = 0; j < 3; j++){
			if(i != j){
				if(ans[i][j] != 0)
					val = ans[i][j];
			}
		}
	}
	rsp += 2 * val;
	return rsp;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 5636 KB Output is correct
2 Correct 54 ms 5628 KB Output is correct
3 Correct 61 ms 5272 KB Output is correct
4 Correct 65 ms 5672 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 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 8 ms 4300 KB Output is correct
5 Correct 7 ms 4300 KB Output is correct
6 Correct 9 ms 4300 KB Output is correct
7 Correct 8 ms 4044 KB Output is correct
8 Correct 6 ms 4300 KB Output is correct
9 Correct 5 ms 4300 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 8 ms 4300 KB Output is correct
5 Correct 7 ms 4300 KB Output is correct
6 Correct 9 ms 4300 KB Output is correct
7 Correct 8 ms 4044 KB Output is correct
8 Correct 6 ms 4300 KB Output is correct
9 Correct 5 ms 4300 KB Output is correct
10 Correct 43 ms 5632 KB Output is correct
11 Correct 45 ms 5632 KB Output is correct
12 Correct 46 ms 5648 KB Output is correct
13 Correct 64 ms 5848 KB Output is correct
14 Correct 43 ms 6016 KB Output is correct
15 Correct 51 ms 5924 KB Output is correct
16 Correct 51 ms 5740 KB Output is correct
17 Correct 55 ms 5768 KB Output is correct
18 Correct 58 ms 6000 KB Output is correct
19 Correct 47 ms 5788 KB Output is correct
20 Correct 48 ms 5884 KB Output is correct
21 Correct 54 ms 5996 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 8 ms 4300 KB Output is correct
5 Correct 7 ms 4300 KB Output is correct
6 Correct 9 ms 4300 KB Output is correct
7 Correct 8 ms 4044 KB Output is correct
8 Correct 6 ms 4300 KB Output is correct
9 Correct 5 ms 4300 KB Output is correct
10 Correct 6 ms 3996 KB Output is correct
11 Correct 7 ms 4324 KB Output is correct
12 Correct 6 ms 4052 KB Output is correct
13 Correct 6 ms 4300 KB Output is correct
14 Correct 5 ms 4300 KB Output is correct
15 Correct 4 ms 4300 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 5636 KB Output is correct
2 Correct 54 ms 5628 KB Output is correct
3 Correct 61 ms 5272 KB Output is correct
4 Correct 65 ms 5672 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 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 8 ms 4300 KB Output is correct
12 Correct 7 ms 4300 KB Output is correct
13 Correct 9 ms 4300 KB Output is correct
14 Correct 8 ms 4044 KB Output is correct
15 Correct 6 ms 4300 KB Output is correct
16 Correct 5 ms 4300 KB Output is correct
17 Correct 43 ms 5632 KB Output is correct
18 Correct 45 ms 5632 KB Output is correct
19 Correct 46 ms 5648 KB Output is correct
20 Correct 64 ms 5848 KB Output is correct
21 Correct 43 ms 6016 KB Output is correct
22 Correct 51 ms 5924 KB Output is correct
23 Correct 51 ms 5740 KB Output is correct
24 Correct 55 ms 5768 KB Output is correct
25 Correct 58 ms 6000 KB Output is correct
26 Correct 47 ms 5788 KB Output is correct
27 Correct 48 ms 5884 KB Output is correct
28 Correct 54 ms 5996 KB Output is correct
29 Correct 6 ms 3996 KB Output is correct
30 Correct 7 ms 4324 KB Output is correct
31 Correct 6 ms 4052 KB Output is correct
32 Correct 6 ms 4300 KB Output is correct
33 Correct 5 ms 4300 KB Output is correct
34 Correct 4 ms 4300 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 56 ms 5344 KB Output is correct
37 Correct 51 ms 5668 KB Output is correct
38 Correct 52 ms 5704 KB Output is correct
39 Correct 44 ms 6012 KB Output is correct
40 Correct 44 ms 6016 KB Output is correct
41 Correct 4 ms 4300 KB Output is correct
42 Correct 45 ms 5780 KB Output is correct
43 Correct 42 ms 6004 KB Output is correct
44 Correct 49 ms 6032 KB Output is correct
45 Correct 52 ms 5772 KB Output is correct
46 Correct 43 ms 6096 KB Output is correct
47 Correct 41 ms 6048 KB Output is correct