Submission #444337

# Submission time Handle Problem Language Result Execution time Memory
444337 2021-07-13T16:35:55 Z computerbox Mutating DNA (IOI21_dna) C++17
100 / 100
64 ms 7412 KB
#include "dna.h"
#include <bits/stdc++.h>

using namespace std;

int preff[100010][3][3];
int num[27];


void init(string a, string b) {
  num['A'-'A']=0;
  num['T'-'A']=1;
  num['C'-'A']=2;
  for(int i = 0; i < (int)a.size(); i++)
  {
    int x = num[a[i] - 'A'];	
    int y = num[b[i] - 'A'];
    preff[i][x][y]++;   
    if(i != 0)
    {
	  for(int x = 0; x < 3; x++)
	  {
		for(int y = 0; y < 3; y++)
		{
		  preff[i][x][y] += preff[i - 1][x][y];	
	    }  
	  }	
    }
  } 	
}

int get_distance(int x, int y) {
	int cnt[3][3];
	memset(cnt,0,sizeof(cnt));
	if(x == 0)
	{
	  for(int i = 0; i < 3; i++)
	  {
		for(int j = 0; j < 3; j++)
		{
		  cnt[i][j]+=preff[y][i][j];	
	    }  
	  } 	
    }
    else
    {
	  for(int i = 0; i < 3; i++)
	  {
		for(int j = 0; j < 3; j++)
		{
		  cnt[i][j]+=(preff[y][i][j]-preff[x-1][i][j]);	
	    }  
	  } 	
    }
    
    int ans=0;
    for(int i = 0; i < 3; i++)
    {
	  for(int j = 0; j < 3; j++)
	  {
		if(i == j)continue;
		int cycle_2 = min(cnt[i][j],cnt[j][i]); 
		ans += cycle_2;
		cnt[i][j] -= cycle_2;
		cnt[j][i] -= cycle_2; 
	  }	
    }
    
    for(int i = 0; i < 3; i++)
    {
	  for(int j = 0; j < 3; j++)
	  {
		for(int k = 0; k < 3; k++)
		{
		  if(i == j || j == k || k == i)continue;
		  int cycle_3 = min(cnt[i][j],min(cnt[j][k],cnt[k][i]));
		  ans += cycle_3 * 2;	
		  cnt[i][j] -= cycle_3;
		  cnt[j][k] -= cycle_3;
		  cnt[k][i] -= cycle_3;
	    }  
	  }	
    }
    for(int i = 0; i < 3;i++)
    {
	  for(int j = 0; j < 3;j++)
	  {
		if(i == j)continue;
		if(cnt[i][j] > 0)return -1;  
	  } 	
    }   
	return ans;
}
# Verdict Execution time Memory Grader output
1 Correct 46 ms 5632 KB Output is correct
2 Correct 47 ms 7024 KB Output is correct
3 Correct 46 ms 6604 KB Output is correct
4 Correct 64 ms 6976 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
# 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 0 ms 204 KB Output is correct
4 Correct 4 ms 4556 KB Output is correct
5 Correct 5 ms 4556 KB Output is correct
6 Correct 4 ms 4556 KB Output is correct
7 Correct 4 ms 4304 KB Output is correct
8 Correct 4 ms 4556 KB Output is correct
9 Correct 4 ms 4556 KB Output is correct
# 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 0 ms 204 KB Output is correct
4 Correct 4 ms 4556 KB Output is correct
5 Correct 5 ms 4556 KB Output is correct
6 Correct 4 ms 4556 KB Output is correct
7 Correct 4 ms 4304 KB Output is correct
8 Correct 4 ms 4556 KB Output is correct
9 Correct 4 ms 4556 KB Output is correct
10 Correct 48 ms 7004 KB Output is correct
11 Correct 48 ms 7020 KB Output is correct
12 Correct 47 ms 7012 KB Output is correct
13 Correct 50 ms 7180 KB Output is correct
14 Correct 48 ms 7396 KB Output is correct
15 Correct 48 ms 7236 KB Output is correct
16 Correct 47 ms 6932 KB Output is correct
17 Correct 45 ms 7060 KB Output is correct
18 Correct 47 ms 7228 KB Output is correct
19 Correct 43 ms 6932 KB Output is correct
20 Correct 44 ms 7084 KB Output is correct
21 Correct 44 ms 7260 KB Output is correct
# 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 0 ms 204 KB Output is correct
4 Correct 4 ms 4556 KB Output is correct
5 Correct 5 ms 4556 KB Output is correct
6 Correct 4 ms 4556 KB Output is correct
7 Correct 4 ms 4304 KB Output is correct
8 Correct 4 ms 4556 KB Output is correct
9 Correct 4 ms 4556 KB Output is correct
10 Correct 5 ms 4156 KB Output is correct
11 Correct 4 ms 4556 KB Output is correct
12 Correct 5 ms 4276 KB Output is correct
13 Correct 4 ms 4556 KB Output is correct
14 Correct 4 ms 4556 KB Output is correct
15 Correct 5 ms 4556 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 46 ms 5632 KB Output is correct
2 Correct 47 ms 7024 KB Output is correct
3 Correct 46 ms 6604 KB Output is correct
4 Correct 64 ms 6976 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 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 0 ms 204 KB Output is correct
11 Correct 4 ms 4556 KB Output is correct
12 Correct 5 ms 4556 KB Output is correct
13 Correct 4 ms 4556 KB Output is correct
14 Correct 4 ms 4304 KB Output is correct
15 Correct 4 ms 4556 KB Output is correct
16 Correct 4 ms 4556 KB Output is correct
17 Correct 48 ms 7004 KB Output is correct
18 Correct 48 ms 7020 KB Output is correct
19 Correct 47 ms 7012 KB Output is correct
20 Correct 50 ms 7180 KB Output is correct
21 Correct 48 ms 7396 KB Output is correct
22 Correct 48 ms 7236 KB Output is correct
23 Correct 47 ms 6932 KB Output is correct
24 Correct 45 ms 7060 KB Output is correct
25 Correct 47 ms 7228 KB Output is correct
26 Correct 43 ms 6932 KB Output is correct
27 Correct 44 ms 7084 KB Output is correct
28 Correct 44 ms 7260 KB Output is correct
29 Correct 5 ms 4156 KB Output is correct
30 Correct 4 ms 4556 KB Output is correct
31 Correct 5 ms 4276 KB Output is correct
32 Correct 4 ms 4556 KB Output is correct
33 Correct 4 ms 4556 KB Output is correct
34 Correct 5 ms 4556 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 46 ms 6652 KB Output is correct
37 Correct 47 ms 7024 KB Output is correct
38 Correct 56 ms 7064 KB Output is correct
39 Correct 48 ms 7368 KB Output is correct
40 Correct 52 ms 7412 KB Output is correct
41 Correct 4 ms 4556 KB Output is correct
42 Correct 45 ms 7056 KB Output is correct
43 Correct 49 ms 7284 KB Output is correct
44 Correct 46 ms 7276 KB Output is correct
45 Correct 44 ms 7012 KB Output is correct
46 Correct 46 ms 7296 KB Output is correct
47 Correct 44 ms 7280 KB Output is correct