oj.uz

Submission #448498

# Submission time Handle Problem Language Result Execution time Memory
448498 2021-07-30T09:50:45 Z Vladithur Mutating DNA (IOI21_dna) C++17
100 / 100
 54 ms 7408 KB 
#include "dna.h"
#include <bits/stdc++.h>

using namespace std;

int n, p[100001][3][3];

void init(std::string a, std::string b) {
	n = a.size();
	map<char, int> tm;
	tm['A'] = 0;
	tm['T'] = 1;
	tm['C'] = 2;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < 3; j++) {
			for (int k = 0; k < 3; k++) p[i + 1][j][k] = p[i][j][k];
		}
		int j = tm[a[i]], k = tm[b[i]];
		p[i + 1][j][k]++;
	}
}

int get_distance(int x, int y) {
	y++;
	vector<int> ta(3);
	
	int ans = y - x;
	for (int j = 0; j < 3; j++) {
		for (int k = 0; k < 3; k++) {
			int v = p[y][j][k] - p[x][j][k];
			ta[j] += v;
			ta[k] -= v;
			if (j == k) ans -= v;
		}
	}
	
	for (int tx: ta) {
		if (tx != 0) {
			return -1;
		}
	}
	
	int ttx = n;
	for (int j = 0; j < 3; j++) {
		for (int k = j + 1; k < 3; k++) {
			int tx = p[y][j][k] - p[x][j][k], ty = p[y][k][j] - p[x][k][j];
			ans -= min(tx, ty);
			ttx = min(ttx, max(tx, ty) - min(tx, ty));
		}
	}
	
	return ans - ttx;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 6988 KB Output is correct
2 Correct 50 ms 7012 KB Output is correct
3 Correct 54 ms 6616 KB Output is correct
4 Correct 47 ms 7040 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 5 ms 4428 KB Output is correct
5 Correct 6 ms 4592 KB Output is correct
6 Correct 5 ms 4476 KB Output is correct
7 Correct 6 ms 4296 KB Output is correct
8 Correct 5 ms 4556 KB Output is correct
9 Correct 4 ms 4556 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 5 ms 4428 KB Output is correct
5 Correct 6 ms 4592 KB Output is correct
6 Correct 5 ms 4476 KB Output is correct
7 Correct 6 ms 4296 KB Output is correct
8 Correct 5 ms 4556 KB Output is correct
9 Correct 4 ms 4556 KB Output is correct
10 Correct 46 ms 6892 KB Output is correct
11 Correct 52 ms 6968 KB Output is correct
12 Correct 44 ms 7020 KB Output is correct
13 Correct 46 ms 7100 KB Output is correct
14 Correct 47 ms 7296 KB Output is correct
15 Correct 51 ms 7404 KB Output is correct
16 Correct 43 ms 6972 KB Output is correct
17 Correct 49 ms 7092 KB Output is correct
18 Correct 43 ms 7272 KB Output is correct
19 Correct 40 ms 7004 KB Output is correct
20 Correct 40 ms 7052 KB Output is correct
21 Correct 42 ms 7296 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 5 ms 4428 KB Output is correct
5 Correct 6 ms 4592 KB Output is correct
6 Correct 5 ms 4476 KB Output is correct
7 Correct 6 ms 4296 KB Output is correct
8 Correct 5 ms 4556 KB Output is correct
9 Correct 4 ms 4556 KB Output is correct
10 Correct 7 ms 4172 KB Output is correct
11 Correct 6 ms 4548 KB Output is correct
12 Correct 6 ms 4280 KB Output is correct
13 Correct 6 ms 4556 KB Output is correct
14 Correct 8 ms 4556 KB Output is correct
15 Correct 5 ms 4556 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 6988 KB Output is correct
2 Correct 50 ms 7012 KB Output is correct
3 Correct 54 ms 6616 KB Output is correct
4 Correct 47 ms 7040 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 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 5 ms 4428 KB Output is correct
12 Correct 6 ms 4592 KB Output is correct
13 Correct 5 ms 4476 KB Output is correct
14 Correct 6 ms 4296 KB Output is correct
15 Correct 5 ms 4556 KB Output is correct
16 Correct 4 ms 4556 KB Output is correct
17 Correct 46 ms 6892 KB Output is correct
18 Correct 52 ms 6968 KB Output is correct
19 Correct 44 ms 7020 KB Output is correct
20 Correct 46 ms 7100 KB Output is correct
21 Correct 47 ms 7296 KB Output is correct
22 Correct 51 ms 7404 KB Output is correct
23 Correct 43 ms 6972 KB Output is correct
24 Correct 49 ms 7092 KB Output is correct
25 Correct 43 ms 7272 KB Output is correct
26 Correct 40 ms 7004 KB Output is correct
27 Correct 40 ms 7052 KB Output is correct
28 Correct 42 ms 7296 KB Output is correct
29 Correct 7 ms 4172 KB Output is correct
30 Correct 6 ms 4548 KB Output is correct
31 Correct 6 ms 4280 KB Output is correct
32 Correct 6 ms 4556 KB Output is correct
33 Correct 8 ms 4556 KB Output is correct
34 Correct 5 ms 4556 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 48 ms 6616 KB Output is correct
37 Correct 47 ms 6980 KB Output is correct
38 Correct 46 ms 7096 KB Output is correct
39 Correct 47 ms 7312 KB Output is correct
40 Correct 46 ms 7408 KB Output is correct
41 Correct 4 ms 4556 KB Output is correct
42 Correct 45 ms 7052 KB Output is correct
43 Correct 44 ms 7296 KB Output is correct
44 Correct 47 ms 7280 KB Output is correct
45 Correct 42 ms 7096 KB Output is correct
46 Correct 43 ms 7276 KB Output is correct
47 Correct 41 ms 7324 KB Output is correct