oj.uz

답안 #583665

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
583665 2022-06-26T01:15:17 Z Cauchico DNA 돌연변이 (IOI21_dna) C++17
100 / 100
 50 ms 6152 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int n;
vector<array<int,6>> arr; //ac,at,ca,ct,ta,tc
void init(string a, string b) {
    n = a.size();
    arr.resize(n+1);
    for (int i=0;i<n;i++) {
        arr[i+1] = arr[i];
        if (a[i] == 'A') {
            if (b[i] == 'C') {
                arr[i+1][0]++;
            }
            if (b[i] == 'T') {
                arr[i+1][1]++;
            }
        }
        if (a[i] == 'C') {
            if (b[i] == 'A') {
                arr[i+1][2]++;
            }
            if (b[i] == 'T') {
                arr[i+1][3]++;
            }
        }
        if (a[i] == 'T') {
            if (b[i] == 'A') {
                arr[i+1][4]++;
            }
            if (b[i] == 'C') {
                arr[i+1][5]++;
            }
        }
    }
}

int get_distance(int x, int y) {
    y++;
    int aa = arr[y][0] + arr[y][1] - arr[x][0] - arr[x][1];
    int ab = arr[y][2] + arr[y][4] - arr[x][2] - arr[x][4];
    int ca = arr[y][2] + arr[y][3] - arr[x][2] - arr[x][3];
    int cb = arr[y][0] + arr[y][5] - arr[x][0] - arr[x][5];
    int ta = arr[y][4] + arr[y][5] - arr[x][4] - arr[x][5];
    int tb = arr[y][1] + arr[y][3] - arr[x][1] - arr[x][3];
    if (aa-ab != 0 or ca-cb != 0 or ta-tb != 0) {
        return -1;
    }
    array<int,6> diff;
    for (int i=0;i<6;i++) {
        diff[i] = arr[y][i] - arr[x][i];
    }
    int ans = min(diff[0],diff[2])+min(diff[1],diff[4])+min(diff[3],diff[5]);
    int uni = abs(diff[0]-diff[2])+abs(diff[1]-diff[4])+abs(diff[3]-diff[5]);
    
    return ans + 2*uni/3;
}

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 4472 KB Output is correct
2 Correct 32 ms 4404 KB Output is correct
3 Correct 43 ms 4272 KB Output is correct
4 Correct 36 ms 4488 KB Output is correct
5 Correct 1 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 0 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 4 ms 3156 KB Output is correct
5 Correct 3 ms 3156 KB Output is correct
6 Correct 3 ms 3156 KB Output is correct
7 Correct 3 ms 3028 KB Output is correct
8 Correct 4 ms 3156 KB Output is correct
9 Correct 3 ms 3156 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 0 ms 212 KB Output is correct
4 Correct 4 ms 3156 KB Output is correct
5 Correct 3 ms 3156 KB Output is correct
6 Correct 3 ms 3156 KB Output is correct
7 Correct 3 ms 3028 KB Output is correct
8 Correct 4 ms 3156 KB Output is correct
9 Correct 3 ms 3156 KB Output is correct
10 Correct 36 ms 4464 KB Output is correct
11 Correct 34 ms 4480 KB Output is correct
12 Correct 43 ms 4576 KB Output is correct
13 Correct 34 ms 4736 KB Output is correct
14 Correct 34 ms 4852 KB Output is correct
15 Correct 34 ms 4780 KB Output is correct
16 Correct 32 ms 4636 KB Output is correct
17 Correct 37 ms 4764 KB Output is correct
18 Correct 30 ms 4840 KB Output is correct
19 Correct 30 ms 4640 KB Output is correct
20 Correct 34 ms 4736 KB Output is correct
21 Correct 32 ms 4872 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 0 ms 212 KB Output is correct
4 Correct 4 ms 3156 KB Output is correct
5 Correct 3 ms 3156 KB Output is correct
6 Correct 3 ms 3156 KB Output is correct
7 Correct 3 ms 3028 KB Output is correct
8 Correct 4 ms 3156 KB Output is correct
9 Correct 3 ms 3156 KB Output is correct
10 Correct 4 ms 2900 KB Output is correct
11 Correct 6 ms 3156 KB Output is correct
12 Correct 6 ms 3028 KB Output is correct
13 Correct 6 ms 3384 KB Output is correct
14 Correct 6 ms 3388 KB Output is correct
15 Correct 5 ms 3380 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 4472 KB Output is correct
2 Correct 32 ms 4404 KB Output is correct
3 Correct 43 ms 4272 KB Output is correct
4 Correct 36 ms 4488 KB Output is correct
5 Correct 1 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 0 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 4 ms 3156 KB Output is correct
12 Correct 3 ms 3156 KB Output is correct
13 Correct 3 ms 3156 KB Output is correct
14 Correct 3 ms 3028 KB Output is correct
15 Correct 4 ms 3156 KB Output is correct
16 Correct 3 ms 3156 KB Output is correct
17 Correct 36 ms 4464 KB Output is correct
18 Correct 34 ms 4480 KB Output is correct
19 Correct 43 ms 4576 KB Output is correct
20 Correct 34 ms 4736 KB Output is correct
21 Correct 34 ms 4852 KB Output is correct
22 Correct 34 ms 4780 KB Output is correct
23 Correct 32 ms 4636 KB Output is correct
24 Correct 37 ms 4764 KB Output is correct
25 Correct 30 ms 4840 KB Output is correct
26 Correct 30 ms 4640 KB Output is correct
27 Correct 34 ms 4736 KB Output is correct
28 Correct 32 ms 4872 KB Output is correct
29 Correct 4 ms 2900 KB Output is correct
30 Correct 6 ms 3156 KB Output is correct
31 Correct 6 ms 3028 KB Output is correct
32 Correct 6 ms 3384 KB Output is correct
33 Correct 6 ms 3388 KB Output is correct
34 Correct 5 ms 3380 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 34 ms 5532 KB Output is correct
37 Correct 35 ms 5896 KB Output is correct
38 Correct 50 ms 6008 KB Output is correct
39 Correct 47 ms 6152 KB Output is correct
40 Correct 34 ms 6128 KB Output is correct
41 Correct 3 ms 3384 KB Output is correct
42 Correct 33 ms 5908 KB Output is correct
43 Correct 31 ms 6152 KB Output is correct
44 Correct 35 ms 6112 KB Output is correct
45 Correct 36 ms 5888 KB Output is correct
46 Correct 30 ms 6120 KB Output is correct
47 Correct 30 ms 6072 KB Output is correct