oj.uz

Submission #591386

# Submission time Handle Problem Language Result Execution time Memory
591386 2022-07-07T11:07:52 Z SuhaibSawalha1 Mutating DNA (IOI21_dna) C++17
100 / 100
 46 ms 7420 KB 
#include "dna.h"
#include <bits/stdc++.h>
using namespace std;

const int N = 1e5 + 1;
int n, P[N][3][3];

int get (char c) {
	switch(c) {
		case 'A': return 0;
		case 'C': return 1;
		default: return 2;
	}
}

void init(string a, string b) {
	n = a.size();
	for (int i = 1; i <= n; ++i) {
		++P[i][get(a[i - 1])][get(b[i - 1])];
		for (int j = 0; j < 3; ++j) {
			for (int k = 0; k < 3; ++k) {
				P[i][j][k] += P[i - 1][j][k];
			}
		}
	}
}

int get_distance(int x, int y) {
	++y;
	int ans = 0;
	int a[3][3];
	for (int i = 0; i < 3; ++i) {
		for (int j = 0; j < 3; ++j) {
			a[i][j] = P[y][i][j] - P[x][i][j];
			// cout << i << " " << j << " " << a[i][j] << endl;
		}
	}
	// cout << "GOOOD" << endl;;
	for (int i = 0; i < 3; ++i) {
		for (int j = 0; j < 3; ++j) {
			if (i == j) {
				continue;
			}
			int k = 3 - i - j;
			int t = min(a[i][j], a[j][i]);
			a[i][j] -= t;
			a[j][i] -= t;
			ans += t;
			t = min(a[i][j], a[k][i]);
			a[i][j] -= t;
			a[k][i] -= t;
			a[k][j] += t;
			ans += t;
			if (a[i][j]) {
				return -1;
			}
		}
	}
	return ans;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 7076 KB Output is correct
2 Correct 46 ms 7004 KB Output is correct
3 Correct 39 ms 6628 KB Output is correct
4 Correct 38 ms 7032 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 312 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 4 ms 4452 KB Output is correct
5 Correct 4 ms 4540 KB Output is correct
6 Correct 6 ms 4564 KB Output is correct
7 Correct 5 ms 4308 KB Output is correct
8 Correct 4 ms 4548 KB Output is correct
9 Correct 4 ms 4548 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 312 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 4 ms 4452 KB Output is correct
5 Correct 4 ms 4540 KB Output is correct
6 Correct 6 ms 4564 KB Output is correct
7 Correct 5 ms 4308 KB Output is correct
8 Correct 4 ms 4548 KB Output is correct
9 Correct 4 ms 4548 KB Output is correct
10 Correct 37 ms 6988 KB Output is correct
11 Correct 35 ms 7004 KB Output is correct
12 Correct 35 ms 7084 KB Output is correct
13 Correct 45 ms 7188 KB Output is correct
14 Correct 34 ms 7292 KB Output is correct
15 Correct 34 ms 7292 KB Output is correct
16 Correct 36 ms 7020 KB Output is correct
17 Correct 34 ms 7060 KB Output is correct
18 Correct 33 ms 7288 KB Output is correct
19 Correct 32 ms 6956 KB Output is correct
20 Correct 31 ms 7164 KB Output is correct
21 Correct 36 ms 7308 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 312 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 4 ms 4452 KB Output is correct
5 Correct 4 ms 4540 KB Output is correct
6 Correct 6 ms 4564 KB Output is correct
7 Correct 5 ms 4308 KB Output is correct
8 Correct 4 ms 4548 KB Output is correct
9 Correct 4 ms 4548 KB Output is correct
10 Correct 4 ms 4180 KB Output is correct
11 Correct 4 ms 4544 KB Output is correct
12 Correct 4 ms 4308 KB Output is correct
13 Correct 4 ms 4564 KB Output is correct
14 Correct 4 ms 4564 KB Output is correct
15 Correct 4 ms 4564 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 7076 KB Output is correct
2 Correct 46 ms 7004 KB Output is correct
3 Correct 39 ms 6628 KB Output is correct
4 Correct 38 ms 7032 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 312 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 308 KB Output is correct
11 Correct 4 ms 4452 KB Output is correct
12 Correct 4 ms 4540 KB Output is correct
13 Correct 6 ms 4564 KB Output is correct
14 Correct 5 ms 4308 KB Output is correct
15 Correct 4 ms 4548 KB Output is correct
16 Correct 4 ms 4548 KB Output is correct
17 Correct 37 ms 6988 KB Output is correct
18 Correct 35 ms 7004 KB Output is correct
19 Correct 35 ms 7084 KB Output is correct
20 Correct 45 ms 7188 KB Output is correct
21 Correct 34 ms 7292 KB Output is correct
22 Correct 34 ms 7292 KB Output is correct
23 Correct 36 ms 7020 KB Output is correct
24 Correct 34 ms 7060 KB Output is correct
25 Correct 33 ms 7288 KB Output is correct
26 Correct 32 ms 6956 KB Output is correct
27 Correct 31 ms 7164 KB Output is correct
28 Correct 36 ms 7308 KB Output is correct
29 Correct 4 ms 4180 KB Output is correct
30 Correct 4 ms 4544 KB Output is correct
31 Correct 4 ms 4308 KB Output is correct
32 Correct 4 ms 4564 KB Output is correct
33 Correct 4 ms 4564 KB Output is correct
34 Correct 4 ms 4564 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 39 ms 6680 KB Output is correct
37 Correct 34 ms 7040 KB Output is correct
38 Correct 34 ms 7148 KB Output is correct
39 Correct 35 ms 7420 KB Output is correct
40 Correct 36 ms 7408 KB Output is correct
41 Correct 5 ms 4564 KB Output is correct
42 Correct 33 ms 7044 KB Output is correct
43 Correct 35 ms 7276 KB Output is correct
44 Correct 34 ms 7224 KB Output is correct
45 Correct 32 ms 7060 KB Output is correct
46 Correct 32 ms 7268 KB Output is correct
47 Correct 32 ms 7320 KB Output is correct