oj.uz

Submission #438735

# Submission time Handle Problem Language Result Execution time Memory
438735 2021-06-28T14:29:54 Z Tc14 Mutating DNA (IOI21_dna) C++17
100 / 100
 66 ms 9832 KB 
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include "dna.h"
using namespace std;
#define ve vector
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9 + 10;

int n;
ve<ve<int>> C;
ve<ve<ve<int>>> F;
ve<pair<char, char>> X = {
    {'A', 'C'}, {'C', 'A'}, 
    {'A', 'T'}, {'T', 'A'},
    {'C', 'T'}, {'T', 'C'},
};
ve<char> I = {'A', 'C', 'T'};

void init(string A, string B) {

    n = (int)A.size();
    C = ve<ve<int>>(6, ve<int>(n + 1));
    F = ve<ve<ve<int>>>(3, ve<ve<int>>(2, ve<int>(n + 1)));

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < 6; j++) {
            int x = A[i] == X[j].first && B[i] == X[j].second;
            C[j][i + 1] = C[j][i] + x;
        }
        for (int j = 0; j < 3; j++) {
            F[j][0][i + 1] = F[j][0][i] + (A[i] == I[j]);
            F[j][1][i + 1] = F[j][1][i] + (B[i] == I[j]);
        }
    }
}

int get_distance(int x, int y) {

    ve<int> P(6);
    for (int i = 0; i < 6; i++) {
        P[i] = C[i][y + 1] - C[i][x];
    }

    for (int i = 0; i < 3; i++) {
        int a = F[i][0][y + 1] - F[i][0][x];
        int b = F[i][1][y + 1] - F[i][1][x];
        if (a != b) return -1;
    }

    int ans = 0;

    ans += min(P[0], P[1]);
    ans += min(P[2], P[3]);
    ans += min(P[4], P[5]);

    ans += 2 * abs(P[0] - P[1]);

    return ans;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 9376 KB Output is correct
2 Correct 56 ms 9440 KB Output is correct
3 Correct 53 ms 8860 KB Output is correct
4 Correct 52 ms 9384 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 10 ms 6820 KB Output is correct
5 Correct 9 ms 6852 KB Output is correct
6 Correct 9 ms 6856 KB Output is correct
7 Correct 11 ms 6500 KB Output is correct
8 Correct 10 ms 6944 KB Output is correct
9 Correct 10 ms 6852 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 10 ms 6820 KB Output is correct
5 Correct 9 ms 6852 KB Output is correct
6 Correct 9 ms 6856 KB Output is correct
7 Correct 11 ms 6500 KB Output is correct
8 Correct 10 ms 6944 KB Output is correct
9 Correct 10 ms 6852 KB Output is correct
10 Correct 54 ms 9280 KB Output is correct
11 Correct 56 ms 9364 KB Output is correct
12 Correct 63 ms 9308 KB Output is correct
13 Correct 52 ms 9504 KB Output is correct
14 Correct 64 ms 9788 KB Output is correct
15 Correct 66 ms 9752 KB Output is correct
16 Correct 55 ms 9176 KB Output is correct
17 Correct 50 ms 9360 KB Output is correct
18 Correct 50 ms 9636 KB Output is correct
19 Correct 50 ms 9184 KB Output is correct
20 Correct 45 ms 9380 KB Output is correct
21 Correct 51 ms 9760 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 10 ms 6820 KB Output is correct
5 Correct 9 ms 6852 KB Output is correct
6 Correct 9 ms 6856 KB Output is correct
7 Correct 11 ms 6500 KB Output is correct
8 Correct 10 ms 6944 KB Output is correct
9 Correct 10 ms 6852 KB Output is correct
10 Correct 9 ms 6392 KB Output is correct
11 Correct 10 ms 6888 KB Output is correct
12 Correct 9 ms 6488 KB Output is correct
13 Correct 11 ms 6852 KB Output is correct
14 Correct 9 ms 6888 KB Output is correct
15 Correct 10 ms 6964 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 9376 KB Output is correct
2 Correct 56 ms 9440 KB Output is correct
3 Correct 53 ms 8860 KB Output is correct
4 Correct 52 ms 9384 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 10 ms 6820 KB Output is correct
12 Correct 9 ms 6852 KB Output is correct
13 Correct 9 ms 6856 KB Output is correct
14 Correct 11 ms 6500 KB Output is correct
15 Correct 10 ms 6944 KB Output is correct
16 Correct 10 ms 6852 KB Output is correct
17 Correct 54 ms 9280 KB Output is correct
18 Correct 56 ms 9364 KB Output is correct
19 Correct 63 ms 9308 KB Output is correct
20 Correct 52 ms 9504 KB Output is correct
21 Correct 64 ms 9788 KB Output is correct
22 Correct 66 ms 9752 KB Output is correct
23 Correct 55 ms 9176 KB Output is correct
24 Correct 50 ms 9360 KB Output is correct
25 Correct 50 ms 9636 KB Output is correct
26 Correct 50 ms 9184 KB Output is correct
27 Correct 45 ms 9380 KB Output is correct
28 Correct 51 ms 9760 KB Output is correct
29 Correct 9 ms 6392 KB Output is correct
30 Correct 10 ms 6888 KB Output is correct
31 Correct 9 ms 6488 KB Output is correct
32 Correct 11 ms 6852 KB Output is correct
33 Correct 9 ms 6888 KB Output is correct
34 Correct 10 ms 6964 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 51 ms 8796 KB Output is correct
37 Correct 56 ms 9400 KB Output is correct
38 Correct 63 ms 9384 KB Output is correct
39 Correct 63 ms 9832 KB Output is correct
40 Correct 51 ms 9792 KB Output is correct
41 Correct 8 ms 6980 KB Output is correct
42 Correct 48 ms 9284 KB Output is correct
43 Correct 54 ms 9712 KB Output is correct
44 Correct 59 ms 9764 KB Output is correct
45 Correct 44 ms 9252 KB Output is correct
46 Correct 44 ms 9764 KB Output is correct
47 Correct 44 ms 9660 KB Output is correct