oj.uz

Submission #978243

# Submission time Handle Problem Language Result Execution time Memory
978243 2024-05-09T04:38:32 Z Amaarsaa Mutating DNA (IOI21_dna) C++17
56 / 100
 35 ms 6992 KB 
#include "dna.h"
#include<bits/stdc++.h>

using namespace std;
int a[100004][3][3];
void init(string A, string B) {
	int n = A.size();
	for (int i = 0; i < n; i ++) {
		if ( A[i] == 'T') A[i] = 'B';
		if ( B[i] == 'T') B[i] = 'B';
		A[i] += 32;
		B[i] += 32;
		for (int j = 0; j <= 2; j ++) {
			for (int r = 0; r <= 2; r ++) {
				if ( i == 0) a[i][j][r] = 0;
				else a[i][j][r] = a[i - 1][j][r];		
			}
		}
		int x = A[i] - 'a';
		int y = B[i] - 'a';
		a[i][x][y] ++;
	}
}
int cnt(int l, int r, int x, int y){
	int s= a[r][x][y];
	if ( l == 0) return s;
	s -= (a[l - 1][x][y]);
	return s;
}
int get_distance(int x, int y) {
	int ans = 0;
	int ab = cnt(x, y, 0, 1), ba = cnt(x, y, 1, 0), ac = cnt(x, y, 0, 2), ca = cnt(x, y, 2, 0), bc = cnt(x, y, 1, 2), cb = cnt(x, y, 2, 1);
	x = min(ab, ba);
	ans += x;
	ab -= x;
	ba -= x;
	x = min(ac, ca);
	ans += x;
	ac -= x;
	ca -= x;
	x = min(bc, cb);
	ans += x;
	bc -= x;
	cb -= x;
	if ( ab == 0 && ba == 0 && ca == 0 && ac == 0 && bc == 0 && cb == 0) return ans;
	if ( (ab == 0 || bc == 0 || ca == 0) && (ba == 0 || ac == 0 || cb == 0)) return -1;
	ab += ba;
	bc += cb;
	ac += ca;
	int s = ab + bc + ac;
	return ans + s - max(ab, max(bc, ac));
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 5656 KB Output is correct
2 Correct 25 ms 6484 KB Output is correct
3 Correct 25 ms 5996 KB Output is correct
4 Correct 25 ms 6384 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 3 ms 4444 KB Output is correct
5 Correct 3 ms 4604 KB Output is correct
6 Correct 4 ms 4444 KB Output is correct
7 Correct 3 ms 4188 KB Output is correct
8 Correct 4 ms 4444 KB Output is correct
9 Correct 4 ms 4444 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 3 ms 4444 KB Output is correct
5 Correct 3 ms 4604 KB Output is correct
6 Correct 4 ms 4444 KB Output is correct
7 Correct 3 ms 4188 KB Output is correct
8 Correct 4 ms 4444 KB Output is correct
9 Correct 4 ms 4444 KB Output is correct
10 Correct 29 ms 6484 KB Output is correct
11 Correct 25 ms 6492 KB Output is correct
12 Correct 27 ms 6684 KB Output is correct
13 Correct 27 ms 6612 KB Output is correct
14 Correct 27 ms 6928 KB Output is correct
15 Correct 25 ms 6216 KB Output is correct
16 Correct 28 ms 6696 KB Output is correct
17 Correct 26 ms 6436 KB Output is correct
18 Correct 26 ms 6980 KB Output is correct
19 Correct 24 ms 6992 KB Output is correct
20 Correct 35 ms 6520 KB Output is correct
21 Correct 25 ms 6924 KB Output is correct

Subtask #4
0.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 3 ms 4444 KB Output is correct
5 Correct 3 ms 4604 KB Output is correct
6 Correct 4 ms 4444 KB Output is correct
7 Correct 3 ms 4188 KB Output is correct
8 Correct 4 ms 4444 KB Output is correct
9 Correct 4 ms 4444 KB Output is correct
10 Correct 3 ms 4184 KB Output is correct
11 Correct 3 ms 4440 KB Output is correct
12 Correct 3 ms 4188 KB Output is correct
13 Incorrect 5 ms 4420 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #5
0.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 5656 KB Output is correct
2 Correct 25 ms 6484 KB Output is correct
3 Correct 25 ms 5996 KB Output is correct
4 Correct 25 ms 6384 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 3 ms 4444 KB Output is correct
12 Correct 3 ms 4604 KB Output is correct
13 Correct 4 ms 4444 KB Output is correct
14 Correct 3 ms 4188 KB Output is correct
15 Correct 4 ms 4444 KB Output is correct
16 Correct 4 ms 4444 KB Output is correct
17 Correct 29 ms 6484 KB Output is correct
18 Correct 25 ms 6492 KB Output is correct
19 Correct 27 ms 6684 KB Output is correct
20 Correct 27 ms 6612 KB Output is correct
21 Correct 27 ms 6928 KB Output is correct
22 Correct 25 ms 6216 KB Output is correct
23 Correct 28 ms 6696 KB Output is correct
24 Correct 26 ms 6436 KB Output is correct
25 Correct 26 ms 6980 KB Output is correct
26 Correct 24 ms 6992 KB Output is correct
27 Correct 35 ms 6520 KB Output is correct
28 Correct 25 ms 6924 KB Output is correct
29 Correct 3 ms 4184 KB Output is correct
30 Correct 3 ms 4440 KB Output is correct
31 Correct 3 ms 4188 KB Output is correct
32 Incorrect 5 ms 4420 KB Output isn't correct
33 Halted 0 ms 0 KB -