oj.uz

Submission #745608

# Submission time Handle Problem Language Result Execution time Memory
745608 2023-05-20T15:53:31 Z LIF Mutating DNA (IOI21_dna) C++17
100 / 100
 48 ms 9744 KB 
#include "dna.h"
#include<bits/stdc++.h>
#include<string>
using namespace std;
int su[200005][3][3];
int A[200005];
int C[200005];
int T[200005];
int AA[200005];
int CC[200005];
int TT[200005];
void init(std::string a, std::string b) {
	for(int i=0;i<a.length();i++)
	{
		char aa = a[i];
		char bb = b[i];
		int xx = 0;
		if(aa == 'A')
		{
			xx = 1;
			A[i+1] = A[i] + 1;
		}
		else A[i+1] = A[i];
		
		if(aa == 'C')
		{
			xx = 2;
			C[i+1] = C[i] + 1;
		}
		else C[i+1] = C[i];
		
		if(aa == 'T')
		{
			xx = 3;
			T[i+1] = T[i] + 1;
		}
		else T[i+1] = T[i];
		
		int yy = 0;
		if(bb == 'A')
		{
			yy = 1;
			AA[i+1] = AA[i] + 1;
		}
		else AA[i+1] = AA[i];
		
		if(bb == 'C')
		{
			yy = 2;
			CC[i+1] = CC[i] + 1;
		}
		else CC[i+1] = CC[i];
		
		if(bb == 'T')
		{
			yy = 3;
			TT[i+1] = TT[i] + 1;
		}
		else TT[i+1] = TT[i];
		
		for(int j=1;j<=3;j++)
		{
			for(int k=1;k<=3;k++)
			{
				if(j == xx && k == yy)
				{
					su[i+1][j][k] = su[i][j][k] + 1;
				}
				else su[i+1][j][k] = su[i][j][k];
			}
		}
		
	}
}
int get_distance(int x, int y) {
	x += 1;
	y += 1;
	if(A[y] - A[x-1] != AA[y] - AA[x-1])return -1;
	if(C[y] - C[x-1] != CC[y] - CC[x-1])return -1;
	if(T[y] - T[x-1] != TT[y] - TT[x-1])return -1;
	int cnt = 0;
	
	int ans = (y-x+1);
	ans -= (su[y][1][1] - su[x-1][1][1]);
	ans -= (su[y][2][2] - su[x-1][2][2]);
	ans -= (su[y][3][3] - su[x-1][3][3]);
	
	cnt += su[y][1][1] - su[x-1][1][1];
	cnt += su[y][2][2] - su[x-1][2][2];
	cnt += su[y][3][3] - su[x-1][3][3];
	
	int p1 = su[y][1][2] - su[x-1][1][2];
	int p2 = su[y][2][1] - su[x-1][2][1];
	ans -= min(p1,p2);
	cnt += min(p1,p2)*2;
	p1 = su[y][1][3] - su[x-1][1][3];
	p2 = su[y][3][1] - su[x-1][3][1];
	ans -= min(p1,p2);
	cnt += min(p1,p2)*2;
	
	p1 = su[y][2][3] - su[x-1][2][3];
	p2 = su[y][3][2] - su[x-1][3][2];
	ans -= min(p1,p2);
	cnt += min(p1,p2)*2;
	int dd = (y-x+1 - cnt)/3;
	ans -= dd;
	return ans; 
}

Compilation message

dna.cpp: In function 'void init(std::string, std::string)':
dna.cpp:13:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 |  for(int i=0;i<a.length();i++)
      |              ~^~~~~~~~~~~
dna.cpp: In function 'int get_distance(int, int)':
dna.cpp:86:20: warning: array subscript 3 is above array bounds of 'int [3]' [-Warray-bounds]
   86 |  ans -= (su[y][3][3] - su[x-1][3][3]);
      |          ~~~~~~~~~~^
dna.cpp:86:36: warning: array subscript 3 is above array bounds of 'int [3]' [-Warray-bounds]
   86 |  ans -= (su[y][3][3] - su[x-1][3][3]);
      |                        ~~~~~~~~~~~~^
dna.cpp:96:17: warning: array subscript 3 is above array bounds of 'int [3]' [-Warray-bounds]
   96 |  p1 = su[y][1][3] - su[x-1][1][3];
      |       ~~~~~~~~~~^
dna.cpp:96:33: warning: array subscript 3 is above array bounds of 'int [3]' [-Warray-bounds]
   96 |  p1 = su[y][1][3] - su[x-1][1][3];
      |                     ~~~~~~~~~~~~^
dna.cpp:97:14: warning: array subscript 3 is above array bounds of 'int [3][3]' [-Warray-bounds]
   97 |  p2 = su[y][3][1] - su[x-1][3][1];
      |       ~~~~~~~^
dna.cpp:97:30: warning: array subscript 3 is above array bounds of 'int [3][3]' [-Warray-bounds]
   97 |  p2 = su[y][3][1] - su[x-1][3][1];
      |                     ~~~~~~~~~^
dna.cpp:101:17: warning: array subscript 3 is above array bounds of 'int [3]' [-Warray-bounds]
  101 |  p1 = su[y][2][3] - su[x-1][2][3];
      |       ~~~~~~~~~~^
dna.cpp:101:33: warning: array subscript 3 is above array bounds of 'int [3]' [-Warray-bounds]
  101 |  p1 = su[y][2][3] - su[x-1][2][3];
      |                     ~~~~~~~~~~~~^
dna.cpp:102:14: warning: array subscript 3 is above array bounds of 'int [3][3]' [-Warray-bounds]
  102 |  p2 = su[y][3][2] - su[x-1][3][2];
      |       ~~~~~~~^
dna.cpp:102:30: warning: array subscript 3 is above array bounds of 'int [3][3]' [-Warray-bounds]
  102 |  p2 = su[y][3][2] - su[x-1][3][2];
      |                     ~~~~~~~~~^

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 8072 KB Output is correct
2 Correct 41 ms 8324 KB Output is correct
3 Correct 46 ms 7724 KB Output is correct
4 Correct 38 ms 8332 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 384 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 8 ms 6868 KB Output is correct
5 Correct 8 ms 6996 KB Output is correct
6 Correct 8 ms 6936 KB Output is correct
7 Correct 7 ms 6484 KB Output is correct
8 Correct 8 ms 6976 KB Output is correct
9 Correct 7 ms 6976 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 8 ms 6868 KB Output is correct
5 Correct 8 ms 6996 KB Output is correct
6 Correct 8 ms 6936 KB Output is correct
7 Correct 7 ms 6484 KB Output is correct
8 Correct 8 ms 6976 KB Output is correct
9 Correct 7 ms 6976 KB Output is correct
10 Correct 44 ms 9280 KB Output is correct
11 Correct 43 ms 9416 KB Output is correct
12 Correct 42 ms 9240 KB Output is correct
13 Correct 48 ms 9440 KB Output is correct
14 Correct 42 ms 9720 KB Output is correct
15 Correct 39 ms 9716 KB Output is correct
16 Correct 37 ms 9224 KB Output is correct
17 Correct 38 ms 9372 KB Output is correct
18 Correct 45 ms 9664 KB Output is correct
19 Correct 31 ms 9192 KB Output is correct
20 Correct 34 ms 9336 KB Output is correct
21 Correct 37 ms 9648 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 8 ms 6868 KB Output is correct
5 Correct 8 ms 6996 KB Output is correct
6 Correct 8 ms 6936 KB Output is correct
7 Correct 7 ms 6484 KB Output is correct
8 Correct 8 ms 6976 KB Output is correct
9 Correct 7 ms 6976 KB Output is correct
10 Correct 8 ms 6332 KB Output is correct
11 Correct 7 ms 6996 KB Output is correct
12 Correct 8 ms 6484 KB Output is correct
13 Correct 8 ms 6868 KB Output is correct
14 Correct 8 ms 6996 KB Output is correct
15 Correct 7 ms 6976 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 8072 KB Output is correct
2 Correct 41 ms 8324 KB Output is correct
3 Correct 46 ms 7724 KB Output is correct
4 Correct 38 ms 8332 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 304 KB Output is correct
11 Correct 8 ms 6868 KB Output is correct
12 Correct 8 ms 6996 KB Output is correct
13 Correct 8 ms 6936 KB Output is correct
14 Correct 7 ms 6484 KB Output is correct
15 Correct 8 ms 6976 KB Output is correct
16 Correct 7 ms 6976 KB Output is correct
17 Correct 44 ms 9280 KB Output is correct
18 Correct 43 ms 9416 KB Output is correct
19 Correct 42 ms 9240 KB Output is correct
20 Correct 48 ms 9440 KB Output is correct
21 Correct 42 ms 9720 KB Output is correct
22 Correct 39 ms 9716 KB Output is correct
23 Correct 37 ms 9224 KB Output is correct
24 Correct 38 ms 9372 KB Output is correct
25 Correct 45 ms 9664 KB Output is correct
26 Correct 31 ms 9192 KB Output is correct
27 Correct 34 ms 9336 KB Output is correct
28 Correct 37 ms 9648 KB Output is correct
29 Correct 8 ms 6332 KB Output is correct
30 Correct 7 ms 6996 KB Output is correct
31 Correct 8 ms 6484 KB Output is correct
32 Correct 8 ms 6868 KB Output is correct
33 Correct 8 ms 6996 KB Output is correct
34 Correct 7 ms 6976 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 37 ms 8784 KB Output is correct
37 Correct 40 ms 9324 KB Output is correct
38 Correct 38 ms 9364 KB Output is correct
39 Correct 40 ms 9736 KB Output is correct
40 Correct 39 ms 9744 KB Output is correct
41 Correct 6 ms 6928 KB Output is correct
42 Correct 35 ms 9252 KB Output is correct
43 Correct 37 ms 9664 KB Output is correct
44 Correct 37 ms 9708 KB Output is correct
45 Correct 45 ms 9264 KB Output is correct
46 Correct 35 ms 9712 KB Output is correct
47 Correct 33 ms 9720 KB Output is correct