oj.uz

Submission #572030

# Submission time Handle Problem Language Result Execution time Memory
572030 2022-06-03T11:21:14 Z jimmaras132 Mutating DNA (IOI21_dna) C++17
100 / 100
 79 ms 8224 KB 
#include <iostream>
#include <vector>
#include <map>
#ifndef _DEBUG
#include "dna.h"
#endif

#define maxn 100005

inline int encode ( char v ) {
	switch ( v ) {
		case 'A': return 0;
		case 'T': return 1;
		case 'C': return 2;
	}
	return -1;
}

class BinaryIndexTree {
	int bit [ 2 * maxn ];
public:
	void modify ( int index , int val ) {
		index++;
		for ( ; index < maxn; index += index & ( -index ) ) {
			bit [ index ] += val;
		}
	}
	int query ( int index ) {
		index++;
		int ret = 0;
		for ( ; index > 0; index -= index & ( -index ) ) {
			ret += bit [ index ];
		}
		return ret;
	}
} B [ 9 ];

int s [ maxn ] , t [ maxn ];

void init ( std::string a , std::string b ) {
	for ( int i = 0; i < a.length ( ); i++ ) {
		s [ i ] = encode ( a [ i ] );
		t [ i ] = encode ( b [ i ] );
		B [ s [ i ] * 3 + t [ i ] ].modify ( i , 1 );
	}
}

int enc ( const char a [ 2 ] ) {
	return encode ( a [ 0 ] ) + 3 * encode ( a [ 1 ] );
}

int get_distance ( int l , int r ) {
	int type [ 9 ];
	for ( int i = 0; i < 9; i++ ) {
		type [ i ] = B [ i ].query ( r ) - B [ i ].query ( l - 1 );
	}
	if ( type [ 1 ] + type [ 2 ] != type [ 3 ] + type [ 6 ] || type [ 3 ] + type [ 5 ] != type [ 1 ] + type [ 7 ] ) {
		return -1;
	}
	type [ 0 ] = type [ 4 ] = type [ 8 ] = 0;
	int perm [ 3 ][ 2 ] = {
		{ enc ( "TA" ) , enc ( "AT" ) },
		{ enc ( "CA" ) , enc ( "AC" ) },
		{ enc ( "CT" ) , enc ( "TC" ) }
	};
	int ans = 0 , rem = 0;
	for ( int i = 0; i < 3; i++ ) {
		// get the minimum of the two.
		int val = std::min ( type [ perm [ i ][ 0 ] ] , type [ perm [ i ][ 1 ] ] );
		// remove it from both types cause we swap them.
		type [ perm [ i ][ 0 ] ] -= val;
		type [ perm [ i ][ 1 ] ] -= val;
		// we just did val swaps.
		ans += val;
		// we have that many remaining (one of them is zero at this point).
		rem += std::max ( type [ perm [ i ][ 0 ] ] , type [ perm [ i ][ 1 ] ] );
	}
	return ans + ( rem / 3 ) * 2;
}

#ifdef _DEBUG
int main ( void ) {
	init ( "ATACAT" , "ACTATA" );
	printf ( "%d\n" , get_distance ( 0 , 6 ) );
	return 0;
}
#endif

Compilation message

dna.cpp: In function 'void init(std::string, std::string)':
dna.cpp:41:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |  for ( int i = 0; i < a.length ( ); i++ ) {
      |                   ~~^~~~~~~~~~~~~~

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 5900 KB Output is correct
2 Correct 53 ms 5832 KB Output is correct
3 Correct 53 ms 7468 KB Output is correct
4 Correct 55 ms 7808 KB Output is correct
5 Correct 1 ms 304 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 304 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 6 ms 3428 KB Output is correct
5 Correct 5 ms 3412 KB Output is correct
6 Correct 5 ms 3424 KB Output is correct
7 Correct 5 ms 3228 KB Output is correct
8 Correct 5 ms 3412 KB Output is correct
9 Correct 4 ms 3392 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 6 ms 3428 KB Output is correct
5 Correct 5 ms 3412 KB Output is correct
6 Correct 5 ms 3424 KB Output is correct
7 Correct 5 ms 3228 KB Output is correct
8 Correct 5 ms 3412 KB Output is correct
9 Correct 4 ms 3392 KB Output is correct
10 Correct 53 ms 5816 KB Output is correct
11 Correct 51 ms 5864 KB Output is correct
12 Correct 50 ms 5956 KB Output is correct
13 Correct 50 ms 6128 KB Output is correct
14 Correct 53 ms 6140 KB Output is correct
15 Correct 49 ms 6132 KB Output is correct
16 Correct 53 ms 5952 KB Output is correct
17 Correct 61 ms 6084 KB Output is correct
18 Correct 47 ms 6136 KB Output is correct
19 Correct 44 ms 5256 KB Output is correct
20 Correct 45 ms 5252 KB Output is correct
21 Correct 64 ms 5364 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 6 ms 3428 KB Output is correct
5 Correct 5 ms 3412 KB Output is correct
6 Correct 5 ms 3424 KB Output is correct
7 Correct 5 ms 3228 KB Output is correct
8 Correct 5 ms 3412 KB Output is correct
9 Correct 4 ms 3392 KB Output is correct
10 Correct 5 ms 5052 KB Output is correct
11 Correct 5 ms 5308 KB Output is correct
12 Correct 5 ms 5076 KB Output is correct
13 Correct 5 ms 5344 KB Output is correct
14 Correct 5 ms 5304 KB Output is correct
15 Correct 5 ms 5348 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 5900 KB Output is correct
2 Correct 53 ms 5832 KB Output is correct
3 Correct 53 ms 7468 KB Output is correct
4 Correct 55 ms 7808 KB Output is correct
5 Correct 1 ms 304 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 304 KB Output is correct
8 Correct 1 ms 308 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 308 KB Output is correct
11 Correct 6 ms 3428 KB Output is correct
12 Correct 5 ms 3412 KB Output is correct
13 Correct 5 ms 3424 KB Output is correct
14 Correct 5 ms 3228 KB Output is correct
15 Correct 5 ms 3412 KB Output is correct
16 Correct 4 ms 3392 KB Output is correct
17 Correct 53 ms 5816 KB Output is correct
18 Correct 51 ms 5864 KB Output is correct
19 Correct 50 ms 5956 KB Output is correct
20 Correct 50 ms 6128 KB Output is correct
21 Correct 53 ms 6140 KB Output is correct
22 Correct 49 ms 6132 KB Output is correct
23 Correct 53 ms 5952 KB Output is correct
24 Correct 61 ms 6084 KB Output is correct
25 Correct 47 ms 6136 KB Output is correct
26 Correct 44 ms 5256 KB Output is correct
27 Correct 45 ms 5252 KB Output is correct
28 Correct 64 ms 5364 KB Output is correct
29 Correct 5 ms 5052 KB Output is correct
30 Correct 5 ms 5308 KB Output is correct
31 Correct 5 ms 5076 KB Output is correct
32 Correct 5 ms 5344 KB Output is correct
33 Correct 5 ms 5304 KB Output is correct
34 Correct 5 ms 5348 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 55 ms 7516 KB Output is correct
37 Correct 53 ms 7796 KB Output is correct
38 Correct 79 ms 7912 KB Output is correct
39 Correct 52 ms 8200 KB Output is correct
40 Correct 53 ms 8180 KB Output is correct
41 Correct 6 ms 5332 KB Output is correct
42 Correct 59 ms 7896 KB Output is correct
43 Correct 51 ms 8224 KB Output is correct
44 Correct 49 ms 8076 KB Output is correct
45 Correct 44 ms 5572 KB Output is correct
46 Correct 46 ms 5776 KB Output is correct
47 Correct 48 ms 5716 KB Output is correct