oj.uz

Submission #936115

# Submission time Handle Problem Language Result Execution time Memory
936115 2024-03-01T07:08:30 Z AtabayRajabli Mutating DNA (IOI21_dna) C++17
100 / 100
 37 ms 8372 KB 
#include <bits/stdc++.h>
#include "dna.h"

using namespace std;

int n;
int p[7][1000005];
int af[4][100005], bf[4][100005];
string ax = " ACATCT";
string bx = " CATATC";
string f = " ACT";

void init(string a, string b) 
{
	n = a.size();
	a = ' ' + a;
	b = ' ' + b;
	
	for(int i = 1; i <= n; i++)
	{
		for(int j = 1; j <= 6; j++)
		{
			if(a[i] == ax[j] && b[i] == bx[j])p[j][i]++;
			p[j][i] += p[j][i - 1];
		}
		for(int j = 1; j <= 3; j++)
		{
			af[j][i] = af[j][i - 1] + (f[j] == a[i]);
			bf[j][i] = bf[j][i - 1] + (f[j] == b[i]);
		}
	}
}

int get_distance(int x, int y)
{
	++x, ++y;
	for(int i = 1; i <= 3; i++)
	{
		if(af[i][y] - af[i][x - 1] != bf[i][y] - bf[i][x - 1])return -1;
	}
	int s[7] = {0};
	for(int i = 1; i <= 6; i++)
	{
		s[i] = p[i][y] - p[i][x - 1];
	}

	int ans = 0;
	int sx[4] = {0}, j = 1;
	for(int i = 1; i < 6; i += 2, j++)
	{
		ans += min(s[i], s[i + 1]);
		sx[j] += max(s[i], s[i + 1]) - min(s[i], s[i + 1]);
	}
	sort(sx + 1, sx + 1 + 3);

	return ans + sx[1] + sx[3];
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 7244 KB Output is correct
2 Correct 29 ms 7708 KB Output is correct
3 Correct 29 ms 7128 KB Output is correct
4 Correct 30 ms 7604 KB Output is correct
5 Correct 1 ms 352 KB Output is correct
6 Correct 0 ms 444 KB Output is correct
7 Correct 0 ms 352 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 352 KB Output is correct
4 Correct 5 ms 5724 KB Output is correct
5 Correct 5 ms 5764 KB Output is correct
6 Correct 5 ms 5724 KB Output is correct
7 Correct 5 ms 5476 KB Output is correct
8 Correct 5 ms 5980 KB Output is correct
9 Correct 4 ms 5976 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 352 KB Output is correct
4 Correct 5 ms 5724 KB Output is correct
5 Correct 5 ms 5764 KB Output is correct
6 Correct 5 ms 5724 KB Output is correct
7 Correct 5 ms 5476 KB Output is correct
8 Correct 5 ms 5980 KB Output is correct
9 Correct 4 ms 5976 KB Output is correct
10 Correct 29 ms 7716 KB Output is correct
11 Correct 32 ms 7868 KB Output is correct
12 Correct 31 ms 7880 KB Output is correct
13 Correct 31 ms 7820 KB Output is correct
14 Correct 31 ms 8152 KB Output is correct
15 Correct 30 ms 7596 KB Output is correct
16 Correct 29 ms 7872 KB Output is correct
17 Correct 30 ms 7808 KB Output is correct
18 Correct 30 ms 8224 KB Output is correct
19 Correct 28 ms 8132 KB Output is correct
20 Correct 33 ms 7876 KB Output is correct
21 Correct 28 ms 8120 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 352 KB Output is correct
4 Correct 5 ms 5724 KB Output is correct
5 Correct 5 ms 5764 KB Output is correct
6 Correct 5 ms 5724 KB Output is correct
7 Correct 5 ms 5476 KB Output is correct
8 Correct 5 ms 5980 KB Output is correct
9 Correct 4 ms 5976 KB Output is correct
10 Correct 5 ms 5468 KB Output is correct
11 Correct 5 ms 5980 KB Output is correct
12 Correct 5 ms 5468 KB Output is correct
13 Correct 5 ms 5980 KB Output is correct
14 Correct 6 ms 5724 KB Output is correct
15 Correct 5 ms 5980 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 7244 KB Output is correct
2 Correct 29 ms 7708 KB Output is correct
3 Correct 29 ms 7128 KB Output is correct
4 Correct 30 ms 7604 KB Output is correct
5 Correct 1 ms 352 KB Output is correct
6 Correct 0 ms 444 KB Output is correct
7 Correct 0 ms 352 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 352 KB Output is correct
11 Correct 5 ms 5724 KB Output is correct
12 Correct 5 ms 5764 KB Output is correct
13 Correct 5 ms 5724 KB Output is correct
14 Correct 5 ms 5476 KB Output is correct
15 Correct 5 ms 5980 KB Output is correct
16 Correct 4 ms 5976 KB Output is correct
17 Correct 29 ms 7716 KB Output is correct
18 Correct 32 ms 7868 KB Output is correct
19 Correct 31 ms 7880 KB Output is correct
20 Correct 31 ms 7820 KB Output is correct
21 Correct 31 ms 8152 KB Output is correct
22 Correct 30 ms 7596 KB Output is correct
23 Correct 29 ms 7872 KB Output is correct
24 Correct 30 ms 7808 KB Output is correct
25 Correct 30 ms 8224 KB Output is correct
26 Correct 28 ms 8132 KB Output is correct
27 Correct 33 ms 7876 KB Output is correct
28 Correct 28 ms 8120 KB Output is correct
29 Correct 5 ms 5468 KB Output is correct
30 Correct 5 ms 5980 KB Output is correct
31 Correct 5 ms 5468 KB Output is correct
32 Correct 5 ms 5980 KB Output is correct
33 Correct 6 ms 5724 KB Output is correct
34 Correct 5 ms 5980 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 29 ms 7628 KB Output is correct
37 Correct 32 ms 8112 KB Output is correct
38 Correct 32 ms 7936 KB Output is correct
39 Correct 37 ms 7916 KB Output is correct
40 Correct 31 ms 8364 KB Output is correct
41 Correct 4 ms 5980 KB Output is correct
42 Correct 30 ms 7884 KB Output is correct
43 Correct 30 ms 8108 KB Output is correct
44 Correct 30 ms 8224 KB Output is correct
45 Correct 32 ms 7876 KB Output is correct
46 Correct 32 ms 8372 KB Output is correct
47 Correct 29 ms 8116 KB Output is correct