Submission #540288

# Submission time Handle Problem Language Result Execution time Memory
540288 2022-03-19T20:35:46 Z colossal_pepe Mutating DNA (IOI21_dna) C++17
100 / 100
38 ms 7648 KB
#include <iostream>
#include <cstring>
using namespace std;

int n;
string s1, s2;
int cnt[100005][3][3];

int id(char c) {
    if (c == 'A') return 0;
    else if (c == 'T') return 1;
    else return 2;
}

void beautifyData() {
    for (int i = 0; i < n; i++) {
        cnt[i][id(s1[i])][id(s2[i])] = 1;
        if (i > 0) {
            for (int j = 0; j < 3; j++) {
                for (int k = 0; k < 3; k++) {
                    cnt[i][j][k] += cnt[i - 1][j][k];
                }
            }
        }
    }
}

void init(string a, string b) {
    s1 = a, s2 = b;
    n = a.size();
    beautifyData();
}

int get_distance(int x, int y) {
    int mat[3][3];
    for (int i = 0; i < 3; i++) {
        for (int j = 0; j < 3; j++) {
            mat[i][j] = cnt[y][i][j] - (x > 0 ? cnt[x - 1][i][j] : 0);
        }
    }
    for (int i = 0; i < 3; i++) {
        if (mat[i][0] + mat[i][1] + mat[i][2] != mat[0][i] + mat[1][i] + mat[2][i]) return -1;
    }
    int ans = 0;
    for (int i = 0; i < 2; i++) {
        for (int j = i + 1; j < 3; j++) {
            int moves = min(mat[i][j], mat[j][i]);
            ans += moves;
            mat[i][j] -= moves;
            mat[j][i] -= moves;
            mat[i][i] += moves;
            mat[j][j] += moves;
        }
    }
    ans += mat[0][1];
    mat[2][1] += mat[0][1];
    mat[0][1] = 0;
    ans += mat[0][2];
    mat[1][2] += mat[0][2];
    mat[0][2] -= 0;
    ans += mat[2][1];
    mat[2][1] = mat[1][2] = 0;
    return ans;
}
# Verdict Execution time Memory Grader output
1 Correct 34 ms 7384 KB Output is correct
2 Correct 34 ms 7300 KB Output is correct
3 Correct 34 ms 6860 KB Output is correct
4 Correct 35 ms 7324 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
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 308 KB Output is correct
4 Correct 4 ms 4676 KB Output is correct
5 Correct 5 ms 4692 KB Output is correct
6 Correct 4 ms 4692 KB Output is correct
7 Correct 4 ms 4420 KB Output is correct
8 Correct 4 ms 4800 KB Output is correct
9 Correct 3 ms 4692 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 308 KB Output is correct
4 Correct 4 ms 4676 KB Output is correct
5 Correct 5 ms 4692 KB Output is correct
6 Correct 4 ms 4692 KB Output is correct
7 Correct 4 ms 4420 KB Output is correct
8 Correct 4 ms 4800 KB Output is correct
9 Correct 3 ms 4692 KB Output is correct
10 Correct 35 ms 7244 KB Output is correct
11 Correct 36 ms 7224 KB Output is correct
12 Correct 33 ms 7244 KB Output is correct
13 Correct 34 ms 7372 KB Output is correct
14 Correct 35 ms 7648 KB Output is correct
15 Correct 34 ms 7616 KB Output is correct
16 Correct 35 ms 7168 KB Output is correct
17 Correct 34 ms 7372 KB Output is correct
18 Correct 33 ms 7492 KB Output is correct
19 Correct 30 ms 7248 KB Output is correct
20 Correct 31 ms 7380 KB Output is correct
21 Correct 32 ms 7504 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 308 KB Output is correct
4 Correct 4 ms 4676 KB Output is correct
5 Correct 5 ms 4692 KB Output is correct
6 Correct 4 ms 4692 KB Output is correct
7 Correct 4 ms 4420 KB Output is correct
8 Correct 4 ms 4800 KB Output is correct
9 Correct 3 ms 4692 KB Output is correct
10 Correct 4 ms 4308 KB Output is correct
11 Correct 5 ms 4692 KB Output is correct
12 Correct 4 ms 4436 KB Output is correct
13 Correct 4 ms 4668 KB Output is correct
14 Correct 4 ms 4712 KB Output is correct
15 Correct 4 ms 4820 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 34 ms 7384 KB Output is correct
2 Correct 34 ms 7300 KB Output is correct
3 Correct 34 ms 6860 KB Output is correct
4 Correct 35 ms 7324 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 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 308 KB Output is correct
11 Correct 4 ms 4676 KB Output is correct
12 Correct 5 ms 4692 KB Output is correct
13 Correct 4 ms 4692 KB Output is correct
14 Correct 4 ms 4420 KB Output is correct
15 Correct 4 ms 4800 KB Output is correct
16 Correct 3 ms 4692 KB Output is correct
17 Correct 35 ms 7244 KB Output is correct
18 Correct 36 ms 7224 KB Output is correct
19 Correct 33 ms 7244 KB Output is correct
20 Correct 34 ms 7372 KB Output is correct
21 Correct 35 ms 7648 KB Output is correct
22 Correct 34 ms 7616 KB Output is correct
23 Correct 35 ms 7168 KB Output is correct
24 Correct 34 ms 7372 KB Output is correct
25 Correct 33 ms 7492 KB Output is correct
26 Correct 30 ms 7248 KB Output is correct
27 Correct 31 ms 7380 KB Output is correct
28 Correct 32 ms 7504 KB Output is correct
29 Correct 4 ms 4308 KB Output is correct
30 Correct 5 ms 4692 KB Output is correct
31 Correct 4 ms 4436 KB Output is correct
32 Correct 4 ms 4668 KB Output is correct
33 Correct 4 ms 4712 KB Output is correct
34 Correct 4 ms 4820 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 34 ms 6796 KB Output is correct
37 Correct 33 ms 7232 KB Output is correct
38 Correct 34 ms 7408 KB Output is correct
39 Correct 33 ms 7616 KB Output is correct
40 Correct 38 ms 7628 KB Output is correct
41 Correct 3 ms 4808 KB Output is correct
42 Correct 31 ms 7228 KB Output is correct
43 Correct 33 ms 7488 KB Output is correct
44 Correct 32 ms 7552 KB Output is correct
45 Correct 30 ms 7332 KB Output is correct
46 Correct 30 ms 7588 KB Output is correct
47 Correct 31 ms 7616 KB Output is correct