oj.uz

Submission #806014

# Submission time Handle Problem Language Result Execution time Memory
806014 2023-08-04T04:21:26 Z pavement Mutating DNA (IOI21_dna) C++17
100 / 100
 34 ms 6256 KB 
#include "dna.h"
#include <bits/stdc++.h>
using namespace std;

int pf[6][100005], cur[6];
char p[] = {'A', 'A', 'C', 'C', 'T', 'T'};
char q[] = {'C', 'T', 'A', 'T', 'A', 'C'};

void init(string a, string b) {
	for (int k = 0; k < 6; k++) {
		for (int i = 0; i < (int)a.size(); i++) {
			pf[k][i] = i ? pf[k][i - 1] : 0;
			if (a[i] == p[k] && b[i] == q[k]) {
				pf[k][i]++;
			}
		}
	}
}

int reduce(int &x, int &y) {
	int z = min(x, y);
	x -= z;
	y -= z;
	return z;
}

int get_distance(int x, int y) {
	for (int k = 0; k < 6; k++) {
		cur[k] = pf[k][y] - (x ? pf[k][x - 1] : 0);
	}
	int ans = 0;
	ans += reduce(cur[0], cur[2]);
	ans += reduce(cur[1], cur[4]);
	ans += reduce(cur[3], cur[5]);
	if (cur[1] != cur[5] || cur[5] != cur[2]) return -1;
	if (cur[0] != cur[3] || cur[3] != cur[4]) return -1;
	ans += cur[1] * 2;
	ans += cur[0] * 2;
	return ans;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 5772 KB Output is correct
2 Correct 27 ms 5820 KB Output is correct
3 Correct 34 ms 5608 KB Output is correct
4 Correct 28 ms 5888 KB Output is correct
5 Correct 1 ms 312 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 212 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 5 ms 3412 KB Output is correct
5 Correct 4 ms 3328 KB Output is correct
6 Correct 4 ms 3412 KB Output is correct
7 Correct 6 ms 3132 KB Output is correct
8 Correct 5 ms 3388 KB Output is correct
9 Correct 4 ms 3412 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 5 ms 3412 KB Output is correct
5 Correct 4 ms 3328 KB Output is correct
6 Correct 4 ms 3412 KB Output is correct
7 Correct 6 ms 3132 KB Output is correct
8 Correct 5 ms 3388 KB Output is correct
9 Correct 4 ms 3412 KB Output is correct
10 Correct 27 ms 5748 KB Output is correct
11 Correct 28 ms 5836 KB Output is correct
12 Correct 31 ms 5916 KB Output is correct
13 Correct 28 ms 6256 KB Output is correct
14 Correct 30 ms 6188 KB Output is correct
15 Correct 33 ms 6092 KB Output is correct
16 Correct 27 ms 5848 KB Output is correct
17 Correct 27 ms 6036 KB Output is correct
18 Correct 29 ms 6132 KB Output is correct
19 Correct 26 ms 5864 KB Output is correct
20 Correct 29 ms 6028 KB Output is correct
21 Correct 27 ms 6152 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 5 ms 3412 KB Output is correct
5 Correct 4 ms 3328 KB Output is correct
6 Correct 4 ms 3412 KB Output is correct
7 Correct 6 ms 3132 KB Output is correct
8 Correct 5 ms 3388 KB Output is correct
9 Correct 4 ms 3412 KB Output is correct
10 Correct 5 ms 3096 KB Output is correct
11 Correct 6 ms 3384 KB Output is correct
12 Correct 4 ms 3156 KB Output is correct
13 Correct 5 ms 3412 KB Output is correct
14 Correct 5 ms 3412 KB Output is correct
15 Correct 4 ms 3392 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 5772 KB Output is correct
2 Correct 27 ms 5820 KB Output is correct
3 Correct 34 ms 5608 KB Output is correct
4 Correct 28 ms 5888 KB Output is correct
5 Correct 1 ms 312 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 304 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 5 ms 3412 KB Output is correct
12 Correct 4 ms 3328 KB Output is correct
13 Correct 4 ms 3412 KB Output is correct
14 Correct 6 ms 3132 KB Output is correct
15 Correct 5 ms 3388 KB Output is correct
16 Correct 4 ms 3412 KB Output is correct
17 Correct 27 ms 5748 KB Output is correct
18 Correct 28 ms 5836 KB Output is correct
19 Correct 31 ms 5916 KB Output is correct
20 Correct 28 ms 6256 KB Output is correct
21 Correct 30 ms 6188 KB Output is correct
22 Correct 33 ms 6092 KB Output is correct
23 Correct 27 ms 5848 KB Output is correct
24 Correct 27 ms 6036 KB Output is correct
25 Correct 29 ms 6132 KB Output is correct
26 Correct 26 ms 5864 KB Output is correct
27 Correct 29 ms 6028 KB Output is correct
28 Correct 27 ms 6152 KB Output is correct
29 Correct 5 ms 3096 KB Output is correct
30 Correct 6 ms 3384 KB Output is correct
31 Correct 4 ms 3156 KB Output is correct
32 Correct 5 ms 3412 KB Output is correct
33 Correct 5 ms 3412 KB Output is correct
34 Correct 4 ms 3392 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 28 ms 5508 KB Output is correct
37 Correct 28 ms 5872 KB Output is correct
38 Correct 30 ms 5992 KB Output is correct
39 Correct 29 ms 6200 KB Output is correct
40 Correct 29 ms 6136 KB Output is correct
41 Correct 4 ms 3412 KB Output is correct
42 Correct 29 ms 5972 KB Output is correct
43 Correct 32 ms 6152 KB Output is correct
44 Correct 28 ms 6160 KB Output is correct
45 Correct 26 ms 5992 KB Output is correct
46 Correct 27 ms 6088 KB Output is correct
47 Correct 27 ms 6100 KB Output is correct