oj.uz

답안 #829258

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
829258 2023-08-18T07:48:58 Z fatemetmhr DNA 돌연변이 (IOI21_dna) C++17
100 / 100
 37 ms 6100 KB 
// Be Name Khoda //


#include "dna.h"
#include <bits/stdc++.h>

using namespace std;

#define MAX(x, y)  ((x) > (y) ? (x) : (y))
#define MIN(x, y)  ((x) < (y) ? (x) : (y))
#define debug(x)   cerr << "(" << (#x) << "): " << (x) << endl;
#define all(x)     (x).begin(), (x).end()
#define fi         first
#define se         second
#define mp         make_pair

typedef long long ll;

const int maxn5 = 1e5 + 10;

int n, ps[maxn5][3][3], cnt[3][3];

int get_ps(int l, int r, int i, int j){
	return ps[r][i][j] - (l ? ps[l - 1][i][j] : 0);
}

int get_num(int ty, int l, int r, int x){
	if(ty)
		return get_ps(l, r, 0, x) + get_ps(l, r, 1, x) + get_ps(l, r, 2, x);
	return get_ps(l, r, x, 0) + get_ps(l, r, x, 1) + get_ps(l, r, x, 2);
}



void init(std::string a, std::string b) {
	n = a.size();
	for(int i = 0; i < n; i++){
		int x = a[i] == 'A' ? 0 : (a[i] == 'C' ? 1 : 2);
		int y = b[i] == 'A' ? 0 : (b[i] == 'C' ? 1 : 2);
		if(i){
			for(int j = 0; j < 3; j++) for(int k = 0; k < 3; k++)
				ps[i][j][k] = ps[i - 1][j][k];
		}
		ps[i][x][y]++;
	}
}

int get_distance(int x, int y) {
	for(int i = 0; i < 3; i++){
		int num1 = get_num(0, x, y, i);
		int num2 = get_num(1, x, y, i);
		if(num1 != num2)
			return -1;
	}
	memset(cnt, 0, sizeof cnt);
	for(int i = 0; i < 3; i++) for(int j = 0; j < 3; j++)
		cnt[i][j] = get_ps(x, y, i, j);
	int eq = cnt[0][0] + cnt[1][1] + cnt[2][2];
	int pr = 0;
	for(int i = 0; i < 3; i++) for(int j = i + 1; j < 3; j++)
		pr += min(cnt[i][j], cnt[j][i]);
	return pr + (y - x + 1 - eq - pr * 2) / 3 * 2;
}

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 5652 KB Output is correct
2 Correct 27 ms 5712 KB Output is correct
3 Correct 36 ms 5340 KB Output is correct
4 Correct 27 ms 5656 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct

Subtask #2
22.0 / 22.0

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

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 3 ms 4308 KB Output is correct
5 Correct 3 ms 4308 KB Output is correct
6 Correct 3 ms 4308 KB Output is correct
7 Correct 3 ms 4052 KB Output is correct
8 Correct 3 ms 4308 KB Output is correct
9 Correct 3 ms 4308 KB Output is correct
10 Correct 27 ms 5652 KB Output is correct
11 Correct 27 ms 5648 KB Output is correct
12 Correct 29 ms 5748 KB Output is correct
13 Correct 36 ms 5884 KB Output is correct
14 Correct 28 ms 5980 KB Output is correct
15 Correct 28 ms 5976 KB Output is correct
16 Correct 28 ms 5764 KB Output is correct
17 Correct 28 ms 5860 KB Output is correct
18 Correct 35 ms 5976 KB Output is correct
19 Correct 26 ms 5788 KB Output is correct
20 Correct 31 ms 5912 KB Output is correct
21 Correct 26 ms 6036 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 3 ms 4308 KB Output is correct
5 Correct 3 ms 4308 KB Output is correct
6 Correct 3 ms 4308 KB Output is correct
7 Correct 3 ms 4052 KB Output is correct
8 Correct 3 ms 4308 KB Output is correct
9 Correct 3 ms 4308 KB Output is correct
10 Correct 3 ms 4004 KB Output is correct
11 Correct 3 ms 4308 KB Output is correct
12 Correct 3 ms 4052 KB Output is correct
13 Correct 3 ms 4308 KB Output is correct
14 Correct 3 ms 4308 KB Output is correct
15 Correct 3 ms 4308 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 5652 KB Output is correct
2 Correct 27 ms 5712 KB Output is correct
3 Correct 36 ms 5340 KB Output is correct
4 Correct 27 ms 5656 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 3 ms 4308 KB Output is correct
12 Correct 3 ms 4308 KB Output is correct
13 Correct 3 ms 4308 KB Output is correct
14 Correct 3 ms 4052 KB Output is correct
15 Correct 3 ms 4308 KB Output is correct
16 Correct 3 ms 4308 KB Output is correct
17 Correct 27 ms 5652 KB Output is correct
18 Correct 27 ms 5648 KB Output is correct
19 Correct 29 ms 5748 KB Output is correct
20 Correct 36 ms 5884 KB Output is correct
21 Correct 28 ms 5980 KB Output is correct
22 Correct 28 ms 5976 KB Output is correct
23 Correct 28 ms 5764 KB Output is correct
24 Correct 28 ms 5860 KB Output is correct
25 Correct 35 ms 5976 KB Output is correct
26 Correct 26 ms 5788 KB Output is correct
27 Correct 31 ms 5912 KB Output is correct
28 Correct 26 ms 6036 KB Output is correct
29 Correct 3 ms 4004 KB Output is correct
30 Correct 3 ms 4308 KB Output is correct
31 Correct 3 ms 4052 KB Output is correct
32 Correct 3 ms 4308 KB Output is correct
33 Correct 3 ms 4308 KB Output is correct
34 Correct 3 ms 4308 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 29 ms 5260 KB Output is correct
37 Correct 26 ms 5708 KB Output is correct
38 Correct 37 ms 5784 KB Output is correct
39 Correct 28 ms 6024 KB Output is correct
40 Correct 29 ms 6032 KB Output is correct
41 Correct 3 ms 4308 KB Output is correct
42 Correct 27 ms 5788 KB Output is correct
43 Correct 27 ms 6032 KB Output is correct
44 Correct 30 ms 6032 KB Output is correct
45 Correct 26 ms 5892 KB Output is correct
46 Correct 27 ms 6100 KB Output is correct
47 Correct 26 ms 6048 KB Output is correct