oj.uz

Submission #784846

# Submission time Handle Problem Language Result Execution time Memory
784846 2023-07-16T15:23:32 Z mindiyak Mutating DNA (IOI21_dna) C++17
100 / 100
 62 ms 9736 KB 
#include "dna.h"
#include <vector>
#include <algorithm>
#include <set>
#include <bits/stdc++.h>
#define pb push_back
const int MAXN = 1e5 + 5;

using namespace std;

int chartoint(char a){
	if(a == 'A'){
		return 0;
	}else if(a == 'C'){
		return 1;
	}
	return 2;
}

int makeset(int a,int b){
	unordered_map<int,int> tointmap = {{0,0},{1,1},{2,2},{10,3},{11,4},{12,5},{20,6},{21,7},{22,8}}; 
	return tointmap[(a*10 + b)];
}

int Counter[9][MAXN];
int A_counter[3][MAXN],B_counter[3][MAXN];
int N;
// vector<int> A;
// vector<int> B;
// vector<int> A_B;

void init(string a, string b) {
	N = a.size();

	int _cont[9] = {0,0,0,0,0,0,0,0,0};
	int _a_cont[3] = {0,0,0};
	int _b_cont[3] = {0,0,0};

	for(int i=0;i<N;i++){
		int charval_a = chartoint(a[i]);
		int charval_b = chartoint(b[i]);
		int charval_set = makeset(charval_a,charval_b);
		// A.pb(charval_a);
		// B.pb(charval_b);
		_cont[charval_set]++;
		_a_cont[charval_a]++;
		_b_cont[charval_b]++;
 
		for(int j=0;j<3;j++){
			A_counter[j][i] = _a_cont[j];
			B_counter[j][i] = _b_cont[j];
		}
		for(int j=0;j<9;j++){
			Counter[j][i] = _cont[j];
		}
	}

	// cout << "A " << endl;
	// for(int i=0;i<N;i++){
	// 	cout << i << " -> ";
	// 	for(int j=0;j<3;j++){
	// 		cout << A_counter[j][i] << " ";
	// 	}cout << endl;
	// }

	// cout << "B " << endl;
	// for(int i=0;i<N;i++){
	// 	cout << i << " -> ";
	// 	for(int j=0;j<3;j++){
	// 		cout << B_counter[j][i] << " ";
	// 	}cout << endl;
	// }
	// cout << endl;
}

int get_count(int arr[9][MAXN],int x,int y,int pos){
	return (arr[pos][y]-arr[pos][x-1]);
}

int get_distance(int x, int y) {
	for(int j=0;j<3;j++){
		// cout << j << " " << (A_counter[j][y]-A_counter[j][x-1]) << " " << (B_counter[j][y]-B_counter[j][x-1]) << endl;
		if(get_count(A_counter,x,y,j) != get_count(B_counter,x,y,j)){
			return -1;
		}
	}

	int ans = 0;
	int setCounter[9];
	int sum = 0;

	for(int j=0;j<9;j++){
		setCounter[j] = get_count(Counter,x,y,j);
	}

	// setCounter[0] = 0;
	// setCounter[4] = 0;
	// setCounter[8] = 0;

	int _set = min(setCounter[1],setCounter[3]);//01,10
	ans += _set;
	sum += abs(setCounter[1]-setCounter[3]);

	_set = min(setCounter[2],setCounter[6]);//02,20
	ans += _set;
	setCounter[2] -= _set;
	setCounter[6] -= _set;
	sum += abs(setCounter[2]-setCounter[6]);

	_set = min(setCounter[5],setCounter[7]);//12,21
	ans += _set;
	setCounter[5] -= _set;
	setCounter[7] -= _set;
	sum += abs(setCounter[5]-setCounter[7]);

	sum /= 3;
	sum *= 2;
	ans += sum;

	return ans;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 7948 KB Output is correct
2 Correct 50 ms 7944 KB Output is correct
3 Correct 53 ms 7612 KB Output is correct
4 Correct 50 ms 7944 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 24 ms 6616 KB Output is correct
5 Correct 25 ms 6720 KB Output is correct
6 Correct 25 ms 6640 KB Output is correct
7 Correct 23 ms 6356 KB Output is correct
8 Correct 25 ms 6736 KB Output is correct
9 Correct 25 ms 6668 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 24 ms 6616 KB Output is correct
5 Correct 25 ms 6720 KB Output is correct
6 Correct 25 ms 6640 KB Output is correct
7 Correct 23 ms 6356 KB Output is correct
8 Correct 25 ms 6736 KB Output is correct
9 Correct 25 ms 6668 KB Output is correct
10 Correct 52 ms 7924 KB Output is correct
11 Correct 51 ms 7944 KB Output is correct
12 Correct 49 ms 7968 KB Output is correct
13 Correct 50 ms 9428 KB Output is correct
14 Correct 53 ms 9732 KB Output is correct
15 Correct 53 ms 9624 KB Output is correct
16 Correct 62 ms 9200 KB Output is correct
17 Correct 49 ms 9376 KB Output is correct
18 Correct 50 ms 9648 KB Output is correct
19 Correct 47 ms 9172 KB Output is correct
20 Correct 47 ms 9364 KB Output is correct
21 Correct 49 ms 9672 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 24 ms 6616 KB Output is correct
5 Correct 25 ms 6720 KB Output is correct
6 Correct 25 ms 6640 KB Output is correct
7 Correct 23 ms 6356 KB Output is correct
8 Correct 25 ms 6736 KB Output is correct
9 Correct 25 ms 6668 KB Output is correct
10 Correct 23 ms 6228 KB Output is correct
11 Correct 26 ms 6632 KB Output is correct
12 Correct 23 ms 6340 KB Output is correct
13 Correct 26 ms 6916 KB Output is correct
14 Correct 25 ms 6864 KB Output is correct
15 Correct 25 ms 6848 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 7948 KB Output is correct
2 Correct 50 ms 7944 KB Output is correct
3 Correct 53 ms 7612 KB Output is correct
4 Correct 50 ms 7944 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 24 ms 6616 KB Output is correct
12 Correct 25 ms 6720 KB Output is correct
13 Correct 25 ms 6640 KB Output is correct
14 Correct 23 ms 6356 KB Output is correct
15 Correct 25 ms 6736 KB Output is correct
16 Correct 25 ms 6668 KB Output is correct
17 Correct 52 ms 7924 KB Output is correct
18 Correct 51 ms 7944 KB Output is correct
19 Correct 49 ms 7968 KB Output is correct
20 Correct 50 ms 9428 KB Output is correct
21 Correct 53 ms 9732 KB Output is correct
22 Correct 53 ms 9624 KB Output is correct
23 Correct 62 ms 9200 KB Output is correct
24 Correct 49 ms 9376 KB Output is correct
25 Correct 50 ms 9648 KB Output is correct
26 Correct 47 ms 9172 KB Output is correct
27 Correct 47 ms 9364 KB Output is correct
28 Correct 49 ms 9672 KB Output is correct
29 Correct 23 ms 6228 KB Output is correct
30 Correct 26 ms 6632 KB Output is correct
31 Correct 23 ms 6340 KB Output is correct
32 Correct 26 ms 6916 KB Output is correct
33 Correct 25 ms 6864 KB Output is correct
34 Correct 25 ms 6848 KB Output is correct
35 Correct 1 ms 308 KB Output is correct
36 Correct 47 ms 8868 KB Output is correct
37 Correct 54 ms 9368 KB Output is correct
38 Correct 50 ms 9360 KB Output is correct
39 Correct 51 ms 9736 KB Output is correct
40 Correct 54 ms 9716 KB Output is correct
41 Correct 28 ms 6920 KB Output is correct
42 Correct 50 ms 9252 KB Output is correct
43 Correct 52 ms 9584 KB Output is correct
44 Correct 51 ms 9608 KB Output is correct
45 Correct 50 ms 9332 KB Output is correct
46 Correct 51 ms 9632 KB Output is correct
47 Correct 52 ms 9592 KB Output is correct