oj.uz

답안 #483559

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
483559 2021-10-30T17:05:52 Z M_W DNA 돌연변이 (IOI21_dna) C++17
100 / 100
 40 ms 6212 KB 
#include <bits/stdc++.h>
using namespace std;
int qs[100001][6]; // AT, TA, AC, CA, CT, TC
void init(string a, string b){
	int len = a.size();
	for(int i = 1; i <= len; i++){
		for(int j = 0; j < 6; j++) qs[i][j] = qs[i - 1][j];
		if(a[i - 1] == 'A'){
			if(b[i - 1] == 'C') qs[i][2]++;
			else if(b[i - 1] == 'T') qs[i][0]++;
		}
		else if(a[i - 1] == 'T'){
			if(b[i - 1] == 'A') qs[i][1]++;
			else if(b[i - 1] == 'C') qs[i][5]++;
		}
		else{
			if(b[i - 1] == 'A') qs[i][3]++;
			else if(b[i - 1] == 'T') qs[i][4]++; 
		}
	}
}

int get_distance(int a, int b){
	a++; b++;
	int AT = qs[b][0] - qs[a - 1][0];
	int TA = qs[b][1] - qs[a - 1][1];
	int AC = qs[b][2] - qs[a - 1][2];
	int CA = qs[b][3] - qs[a - 1][3];
	int CT = qs[b][4] - qs[a - 1][4];
	int TC = qs[b][5] - qs[a - 1][5];
	
	int A1 = AT + AC, C1 = CA + CT, T1 = TA + TC;
	int A2 = TA + CA, C2 = AC + TC, T2 = AT + CT;
	
	if(A1 != A2 || C1 != C2 || T1 != T2) return -1;
	int ATp = min(AT, TA), ACp = min(AC, CA), TCp = min(TC, CT);
	int ret = ATp + ACp + TCp;
	AT -= ATp; TA -= ATp;
	AC -= ACp; CA -= ACp;
	TC -= TCp; CT -= TCp;
	
	ret += ((AC + CT + TA) / 3) * 2;
	ret += ((CA + AT + TC) / 3) * 2;
	return ret;
}

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 5772 KB Output is correct
2 Correct 33 ms 5816 KB Output is correct
3 Correct 37 ms 5600 KB Output is correct
4 Correct 32 ms 5872 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 304 KB Output is correct
7 Correct 0 ms 204 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 4 ms 3276 KB Output is correct
5 Correct 4 ms 3404 KB Output is correct
6 Correct 4 ms 3404 KB Output is correct
7 Correct 5 ms 3092 KB Output is correct
8 Correct 4 ms 3404 KB Output is correct
9 Correct 3 ms 3404 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 4 ms 3276 KB Output is correct
5 Correct 4 ms 3404 KB Output is correct
6 Correct 4 ms 3404 KB Output is correct
7 Correct 5 ms 3092 KB Output is correct
8 Correct 4 ms 3404 KB Output is correct
9 Correct 3 ms 3404 KB Output is correct
10 Correct 34 ms 5740 KB Output is correct
11 Correct 32 ms 5864 KB Output is correct
12 Correct 40 ms 5980 KB Output is correct
13 Correct 32 ms 6024 KB Output is correct
14 Correct 40 ms 6132 KB Output is correct
15 Correct 30 ms 6152 KB Output is correct
16 Correct 34 ms 5904 KB Output is correct
17 Correct 28 ms 5988 KB Output is correct
18 Correct 29 ms 6124 KB Output is correct
19 Correct 28 ms 5896 KB Output is correct
20 Correct 27 ms 6000 KB Output is correct
21 Correct 29 ms 6132 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 4 ms 3276 KB Output is correct
5 Correct 4 ms 3404 KB Output is correct
6 Correct 4 ms 3404 KB Output is correct
7 Correct 5 ms 3092 KB Output is correct
8 Correct 4 ms 3404 KB Output is correct
9 Correct 3 ms 3404 KB Output is correct
10 Correct 5 ms 3148 KB Output is correct
11 Correct 5 ms 3404 KB Output is correct
12 Correct 4 ms 3148 KB Output is correct
13 Correct 5 ms 3404 KB Output is correct
14 Correct 5 ms 3380 KB Output is correct
15 Correct 4 ms 3352 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 5772 KB Output is correct
2 Correct 33 ms 5816 KB Output is correct
3 Correct 37 ms 5600 KB Output is correct
4 Correct 32 ms 5872 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 304 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 304 KB Output is correct
11 Correct 4 ms 3276 KB Output is correct
12 Correct 4 ms 3404 KB Output is correct
13 Correct 4 ms 3404 KB Output is correct
14 Correct 5 ms 3092 KB Output is correct
15 Correct 4 ms 3404 KB Output is correct
16 Correct 3 ms 3404 KB Output is correct
17 Correct 34 ms 5740 KB Output is correct
18 Correct 32 ms 5864 KB Output is correct
19 Correct 40 ms 5980 KB Output is correct
20 Correct 32 ms 6024 KB Output is correct
21 Correct 40 ms 6132 KB Output is correct
22 Correct 30 ms 6152 KB Output is correct
23 Correct 34 ms 5904 KB Output is correct
24 Correct 28 ms 5988 KB Output is correct
25 Correct 29 ms 6124 KB Output is correct
26 Correct 28 ms 5896 KB Output is correct
27 Correct 27 ms 6000 KB Output is correct
28 Correct 29 ms 6132 KB Output is correct
29 Correct 5 ms 3148 KB Output is correct
30 Correct 5 ms 3404 KB Output is correct
31 Correct 4 ms 3148 KB Output is correct
32 Correct 5 ms 3404 KB Output is correct
33 Correct 5 ms 3380 KB Output is correct
34 Correct 4 ms 3352 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 31 ms 5524 KB Output is correct
37 Correct 33 ms 5772 KB Output is correct
38 Correct 29 ms 6004 KB Output is correct
39 Correct 30 ms 6148 KB Output is correct
40 Correct 31 ms 6212 KB Output is correct
41 Correct 5 ms 3404 KB Output is correct
42 Correct 28 ms 5880 KB Output is correct
43 Correct 28 ms 6144 KB Output is correct
44 Correct 30 ms 6128 KB Output is correct
45 Correct 27 ms 5988 KB Output is correct
46 Correct 29 ms 6144 KB Output is correct
47 Correct 29 ms 6148 KB Output is correct