oj.uz

답안 #982486

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
982486 2024-05-14T09:54:25 Z faqinyeager DNA 돌연변이 (IOI21_dna) C++17
100 / 100
 38 ms 9680 KB 
#include "dna.h"
#include <bits/stdc++.h>
using namespace std;

int n;
int asum[100050][3], bsum[100050][3];
int cnt[100050][3][3];

void init(std::string a, std::string b){
	n = (int)a.size();
	for(int i = 0; i < n; i ++){
		if(a[i] == 'A') asum[i + 1][0] ++;
		else if(a[i] == 'C') asum[i + 1][1] ++;
		else asum[i + 1][2] ++;
		
		if(b[i] == 'A') bsum[i + 1][0] ++;
		else if(b[i] == 'C') bsum[i + 1][1] ++;
		else bsum[i + 1][2] ++;

		int ai = 2, bi = 2;

		if(a[i] == 'A') ai = 0;
		else if(a[i] == 'C') ai = 1;
		if(b[i] == 'A') bi = 0;
		else if(b[i] == 'C') bi = 1;

		cnt[i + 1][ai][bi] = 1;
	}
	for(int i = 2; i <= n; i ++){
		for(int j = 0; j < 3; j ++){
			asum[i][j] += asum[i - 1][j];
			bsum[i][j] += bsum[i - 1][j];
		}

		for(int j = 0; j < 3; j ++){
			for(int jj = 0; jj < 3; jj ++){
				cnt[i][j][jj] += cnt[i - 1][j][jj];
			}
		}
	}
}

int get_distance(int x, int y){
	x++, y++;
	for(int j = 0; j < 3; j ++){
		if(asum[y][j] - asum[x - 1][j] != bsum[y][j] - bsum[x - 1][j]){
			return -1;
		}
	}
	int c[3][3] = {{0}};
	for(int j = 0; j < 3; j ++){
		for(int jj = 0; jj < 3; jj ++){
			c[j][jj] = cnt[y][j][jj] - cnt[x - 1][j][jj];
		}
	}
	int tmp = min(c[0][1], c[1][0]), ans = 0;
	c[0][1] -= tmp, c[1][0] -= tmp, ans += tmp;
	tmp = min(c[0][2], c[2][0]);
	c[0][2] -= tmp, c[2][0] -= tmp, ans += tmp;
	tmp = min(c[1][2], c[2][1]);
	c[1][2] -= tmp, c[2][1] -= tmp, ans += tmp;

	ans += 2 * (c[0][1] + c[1][0]);
	return ans;
}
// aaaacccctt
// ccccaattaa

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 8028 KB Output is correct
2 Correct 27 ms 8192 KB Output is correct
3 Correct 26 ms 7772 KB Output is correct
4 Correct 27 ms 8168 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2500 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 4 ms 6748 KB Output is correct
5 Correct 4 ms 6828 KB Output is correct
6 Correct 4 ms 6748 KB Output is correct
7 Correct 4 ms 6748 KB Output is correct
8 Correct 4 ms 6900 KB Output is correct
9 Correct 3 ms 6748 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 4 ms 6748 KB Output is correct
5 Correct 4 ms 6828 KB Output is correct
6 Correct 4 ms 6748 KB Output is correct
7 Correct 4 ms 6748 KB Output is correct
8 Correct 4 ms 6900 KB Output is correct
9 Correct 3 ms 6748 KB Output is correct
10 Correct 38 ms 8760 KB Output is correct
11 Correct 27 ms 8908 KB Output is correct
12 Correct 30 ms 9120 KB Output is correct
13 Correct 30 ms 9152 KB Output is correct
14 Correct 27 ms 9396 KB Output is correct
15 Correct 26 ms 8560 KB Output is correct
16 Correct 26 ms 9256 KB Output is correct
17 Correct 28 ms 8640 KB Output is correct
18 Correct 34 ms 9164 KB Output is correct
19 Correct 25 ms 9508 KB Output is correct
20 Correct 27 ms 8896 KB Output is correct
21 Correct 26 ms 9228 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 4 ms 6748 KB Output is correct
5 Correct 4 ms 6828 KB Output is correct
6 Correct 4 ms 6748 KB Output is correct
7 Correct 4 ms 6748 KB Output is correct
8 Correct 4 ms 6900 KB Output is correct
9 Correct 3 ms 6748 KB Output is correct
10 Correct 4 ms 6748 KB Output is correct
11 Correct 4 ms 6896 KB Output is correct
12 Correct 4 ms 6812 KB Output is correct
13 Correct 4 ms 7004 KB Output is correct
14 Correct 6 ms 6748 KB Output is correct
15 Correct 4 ms 7004 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 8028 KB Output is correct
2 Correct 27 ms 8192 KB Output is correct
3 Correct 26 ms 7772 KB Output is correct
4 Correct 27 ms 8168 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2500 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 4 ms 6748 KB Output is correct
12 Correct 4 ms 6828 KB Output is correct
13 Correct 4 ms 6748 KB Output is correct
14 Correct 4 ms 6748 KB Output is correct
15 Correct 4 ms 6900 KB Output is correct
16 Correct 3 ms 6748 KB Output is correct
17 Correct 38 ms 8760 KB Output is correct
18 Correct 27 ms 8908 KB Output is correct
19 Correct 30 ms 9120 KB Output is correct
20 Correct 30 ms 9152 KB Output is correct
21 Correct 27 ms 9396 KB Output is correct
22 Correct 26 ms 8560 KB Output is correct
23 Correct 26 ms 9256 KB Output is correct
24 Correct 28 ms 8640 KB Output is correct
25 Correct 34 ms 9164 KB Output is correct
26 Correct 25 ms 9508 KB Output is correct
27 Correct 27 ms 8896 KB Output is correct
28 Correct 26 ms 9228 KB Output is correct
29 Correct 4 ms 6748 KB Output is correct
30 Correct 4 ms 6896 KB Output is correct
31 Correct 4 ms 6812 KB Output is correct
32 Correct 4 ms 7004 KB Output is correct
33 Correct 6 ms 6748 KB Output is correct
34 Correct 4 ms 7004 KB Output is correct
35 Correct 1 ms 2392 KB Output is correct
36 Correct 27 ms 8796 KB Output is correct
37 Correct 30 ms 9076 KB Output is correct
38 Correct 30 ms 9152 KB Output is correct
39 Correct 28 ms 9044 KB Output is correct
40 Correct 31 ms 9488 KB Output is correct
41 Correct 3 ms 7004 KB Output is correct
42 Correct 28 ms 9140 KB Output is correct
43 Correct 37 ms 9232 KB Output is correct
44 Correct 27 ms 9500 KB Output is correct
45 Correct 26 ms 9248 KB Output is correct
46 Correct 26 ms 9680 KB Output is correct
47 Correct 26 ms 9240 KB Output is correct