oj.uz

답안 #739926

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
739926 2023-05-11T16:12:01 Z Desh03 DNA 돌연변이 (IOI21_dna) C++17
100 / 100
 36 ms 6252 KB 
#include "dna.h"
#include<bits/stdc++.h>
using namespace std;

vector<int> AC, AT, CA, CT, TA, TC;

void init(string a,string b){
    int n = a.size();
	AC = AT = CA = CT = TA = TC = vector<int> (n + 1);
	for(int i = 1; i <= n; i++) {
        AC[i] = AC[i - 1] + (a[i - 1] == 'A' && b[i - 1] == 'C');
        AT[i] = AT[i - 1] + (a[i - 1] == 'A' && b[i - 1] == 'T');
        CA[i] = CA[i - 1] + (a[i - 1] == 'C' && b[i - 1] == 'A');
        CT[i] = CT[i - 1] + (a[i - 1] == 'C' && b[i - 1] == 'T');
        TA[i] = TA[i - 1] + (a[i - 1] == 'T' && b[i - 1] == 'A');
        TC[i] = TC[i - 1] + (a[i - 1] == 'T' && b[i - 1] == 'C');
	}
}

int get_distance(int l, int r) {
    l++, r++;
    int ac = AC[r] - AC[l - 1], at = AT[r] - AT[l - 1], ca = CA[r] - CA[l - 1], ct = CT[r] - CT[l - 1], ta = TA[r] - TA[l - 1], tc = TC[r] - TC[l - 1];
	int x = min(ac, ca), y = min(at, ta), z = min(ct, tc);
	ac -= x, ca -= x, at -= y, ta -= y, ct -= z, tc -= z;
	if (ac == ta && ac == ct && at == tc && ca == tc) return x + y + z + ac + ca + at + ta;
	return -1;
}

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 4500 KB Output is correct
2 Correct 33 ms 5876 KB Output is correct
3 Correct 35 ms 5548 KB Output is correct
4 Correct 36 ms 5860 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 300 KB Output is correct

Subtask #2
22.0 / 22.0

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

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 4 ms 3412 KB Output is correct
5 Correct 4 ms 3412 KB Output is correct
6 Correct 4 ms 3388 KB Output is correct
7 Correct 4 ms 3156 KB Output is correct
8 Correct 4 ms 3412 KB Output is correct
9 Correct 4 ms 3412 KB Output is correct
10 Correct 32 ms 5868 KB Output is correct
11 Correct 33 ms 5872 KB Output is correct
12 Correct 32 ms 5984 KB Output is correct
13 Correct 32 ms 6036 KB Output is correct
14 Correct 33 ms 6152 KB Output is correct
15 Correct 32 ms 6136 KB Output is correct
16 Correct 29 ms 5912 KB Output is correct
17 Correct 30 ms 5996 KB Output is correct
18 Correct 31 ms 6116 KB Output is correct
19 Correct 32 ms 5976 KB Output is correct
20 Correct 29 ms 5960 KB Output is correct
21 Correct 29 ms 6152 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 4 ms 3412 KB Output is correct
5 Correct 4 ms 3412 KB Output is correct
6 Correct 4 ms 3388 KB Output is correct
7 Correct 4 ms 3156 KB Output is correct
8 Correct 4 ms 3412 KB Output is correct
9 Correct 4 ms 3412 KB Output is correct
10 Correct 4 ms 3156 KB Output is correct
11 Correct 4 ms 3412 KB Output is correct
12 Correct 3 ms 3256 KB Output is correct
13 Correct 4 ms 3376 KB Output is correct
14 Correct 4 ms 3412 KB Output is correct
15 Correct 4 ms 3384 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 4500 KB Output is correct
2 Correct 33 ms 5876 KB Output is correct
3 Correct 35 ms 5548 KB Output is correct
4 Correct 36 ms 5860 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 4 ms 3412 KB Output is correct
12 Correct 4 ms 3412 KB Output is correct
13 Correct 4 ms 3388 KB Output is correct
14 Correct 4 ms 3156 KB Output is correct
15 Correct 4 ms 3412 KB Output is correct
16 Correct 4 ms 3412 KB Output is correct
17 Correct 32 ms 5868 KB Output is correct
18 Correct 33 ms 5872 KB Output is correct
19 Correct 32 ms 5984 KB Output is correct
20 Correct 32 ms 6036 KB Output is correct
21 Correct 33 ms 6152 KB Output is correct
22 Correct 32 ms 6136 KB Output is correct
23 Correct 29 ms 5912 KB Output is correct
24 Correct 30 ms 5996 KB Output is correct
25 Correct 31 ms 6116 KB Output is correct
26 Correct 32 ms 5976 KB Output is correct
27 Correct 29 ms 5960 KB Output is correct
28 Correct 29 ms 6152 KB Output is correct
29 Correct 4 ms 3156 KB Output is correct
30 Correct 4 ms 3412 KB Output is correct
31 Correct 3 ms 3256 KB Output is correct
32 Correct 4 ms 3376 KB Output is correct
33 Correct 4 ms 3412 KB Output is correct
34 Correct 4 ms 3384 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 33 ms 5596 KB Output is correct
37 Correct 36 ms 5872 KB Output is correct
38 Correct 32 ms 6036 KB Output is correct
39 Correct 33 ms 6152 KB Output is correct
40 Correct 32 ms 6252 KB Output is correct
41 Correct 3 ms 3384 KB Output is correct
42 Correct 33 ms 5976 KB Output is correct
43 Correct 32 ms 6116 KB Output is correct
44 Correct 31 ms 6124 KB Output is correct
45 Correct 30 ms 5936 KB Output is correct
46 Correct 29 ms 6136 KB Output is correct
47 Correct 31 ms 6108 KB Output is correct