oj.uz

Submission #448141

# Submission time Handle Problem Language Result Execution time Memory
448141 2021-07-29T03:20:34 Z hizuna Mutating DNA (IOI21_dna) C++17
100 / 100
 47 ms 7416 KB 
#include "dna.h"
#include <bits/stdc++.h>

int f[100005][3][3];

int get_pair_cnt(int ca, int cb, int l, int r) {
    return f[r + 1][ca][cb] - f[l][ca][cb];
}

int ord(char c) {
    return c == 'A' ? 0 : (c == 'C' ? 1 : 2);
}

void init(std::string a, std::string b) {
    int sz = a.size(), orda, ordb;

    for(int k = 1; k <= sz; k++) {
        for(int i = 0; i < 3; i++) {
            for(int j = 0; j < 3; j++) {
                f[k][i][j] += f[k - 1][i][j];
            }
        }
        orda = ord(a[k - 1]), ordb = ord(b[k - 1]);
        if(orda != ordb) ++f[k][orda][ordb];
    } 
}

int get_distance(int x, int y) {
    int res = 0, charbal[3] = {};

    for(int i = 0; i < 3; i++) {
        for(int j = 0; j < 3; j++) {
            int pairs = get_pair_cnt(i, j, x, y);
            charbal[i] += pairs;
            charbal[j] -= pairs;
        }
    }

    for(int i = 0; i < 3; i++) {
        if(charbal[i] != 0) return -1;
    }

    int tot = 0;
    for(int i = 0; i < 3; i++) {
        for(int j = 0; j < 3; j++) {
            tot += get_pair_cnt(i, j, x, y);
        }
    }
    for(int i = 0; i < 3; i++) {
        for(int j = i + 1; j < 3; j++) {
            int cm = std::min(get_pair_cnt(i, j, x, y), get_pair_cnt(j, i, x, y));
            tot -= cm * 2;
            res += cm;
        }
    }

    res += (tot / 3) * 2;

    return res;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 5636 KB Output is correct
2 Correct 43 ms 7012 KB Output is correct
3 Correct 47 ms 6568 KB Output is correct
4 Correct 45 ms 7060 KB Output is correct
5 Correct 0 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 0 ms 204 KB Output is correct
4 Correct 5 ms 4300 KB Output is correct
5 Correct 5 ms 4556 KB Output is correct
6 Correct 4 ms 4556 KB Output is correct
7 Correct 4 ms 4300 KB Output is correct
8 Correct 5 ms 4556 KB Output is correct
9 Correct 4 ms 4556 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 0 ms 204 KB Output is correct
4 Correct 5 ms 4300 KB Output is correct
5 Correct 5 ms 4556 KB Output is correct
6 Correct 4 ms 4556 KB Output is correct
7 Correct 4 ms 4300 KB Output is correct
8 Correct 5 ms 4556 KB Output is correct
9 Correct 4 ms 4556 KB Output is correct
10 Correct 43 ms 6876 KB Output is correct
11 Correct 43 ms 7020 KB Output is correct
12 Correct 43 ms 7008 KB Output is correct
13 Correct 43 ms 7180 KB Output is correct
14 Correct 43 ms 7280 KB Output is correct
15 Correct 42 ms 7280 KB Output is correct
16 Correct 42 ms 7004 KB Output is correct
17 Correct 42 ms 7140 KB Output is correct
18 Correct 43 ms 7268 KB Output is correct
19 Correct 40 ms 6960 KB Output is correct
20 Correct 39 ms 7132 KB Output is correct
21 Correct 40 ms 7352 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 0 ms 204 KB Output is correct
4 Correct 5 ms 4300 KB Output is correct
5 Correct 5 ms 4556 KB Output is correct
6 Correct 4 ms 4556 KB Output is correct
7 Correct 4 ms 4300 KB Output is correct
8 Correct 5 ms 4556 KB Output is correct
9 Correct 4 ms 4556 KB Output is correct
10 Correct 4 ms 4172 KB Output is correct
11 Correct 5 ms 4556 KB Output is correct
12 Correct 5 ms 4268 KB Output is correct
13 Correct 5 ms 4556 KB Output is correct
14 Correct 5 ms 4508 KB Output is correct
15 Correct 4 ms 4556 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 5636 KB Output is correct
2 Correct 43 ms 7012 KB Output is correct
3 Correct 47 ms 6568 KB Output is correct
4 Correct 45 ms 7060 KB Output is correct
5 Correct 0 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 0 ms 204 KB Output is correct
11 Correct 5 ms 4300 KB Output is correct
12 Correct 5 ms 4556 KB Output is correct
13 Correct 4 ms 4556 KB Output is correct
14 Correct 4 ms 4300 KB Output is correct
15 Correct 5 ms 4556 KB Output is correct
16 Correct 4 ms 4556 KB Output is correct
17 Correct 43 ms 6876 KB Output is correct
18 Correct 43 ms 7020 KB Output is correct
19 Correct 43 ms 7008 KB Output is correct
20 Correct 43 ms 7180 KB Output is correct
21 Correct 43 ms 7280 KB Output is correct
22 Correct 42 ms 7280 KB Output is correct
23 Correct 42 ms 7004 KB Output is correct
24 Correct 42 ms 7140 KB Output is correct
25 Correct 43 ms 7268 KB Output is correct
26 Correct 40 ms 6960 KB Output is correct
27 Correct 39 ms 7132 KB Output is correct
28 Correct 40 ms 7352 KB Output is correct
29 Correct 4 ms 4172 KB Output is correct
30 Correct 5 ms 4556 KB Output is correct
31 Correct 5 ms 4268 KB Output is correct
32 Correct 5 ms 4556 KB Output is correct
33 Correct 5 ms 4508 KB Output is correct
34 Correct 4 ms 4556 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 44 ms 6680 KB Output is correct
37 Correct 44 ms 7168 KB Output is correct
38 Correct 42 ms 7072 KB Output is correct
39 Correct 43 ms 7408 KB Output is correct
40 Correct 43 ms 7416 KB Output is correct
41 Correct 4 ms 4556 KB Output is correct
42 Correct 41 ms 7016 KB Output is correct
43 Correct 43 ms 7276 KB Output is correct
44 Correct 43 ms 7280 KB Output is correct
45 Correct 40 ms 6972 KB Output is correct
46 Correct 40 ms 7296 KB Output is correct
47 Correct 40 ms 7316 KB Output is correct