Submission #533122

# Submission time Handle Problem Language Result Execution time Memory
533122 2022-03-04T21:48:26 Z VodkaInTheJar Mutating DNA (IOI21_dna) C++17
100 / 100
42 ms 9740 KB
#include <bits/stdc++.h>
#include "dna.h"

using namespace std;

const int maxn = 1e5 + 3;

int get_code(char ch) {
    if (ch == 'A')
        return 0;

    if (ch == 'C')
        return 1;

    return 2;
}

int cnt[maxn][3][3], cnt1[maxn][3], cnt2[maxn][3];
void init(string a, string b) {
    for (int i = 0; i < (int)a.size(); i++) {
        for (int j = 0; j < 3; j++)
            for (int k = 0; k < 3; k++)
                cnt[i][j][k] = (i ? cnt[i-1][j][k] : 0);

        cnt[i][get_code(a[i])][get_code(b[i])]++;
        for (int j = 0; j < 3; j++) {
            cnt1[i][j] = (i ? cnt1[i - 1][j] : 0);
            cnt2[i][j] = (i ? cnt2[i - 1][j] : 0);
        }

        cnt1[i][get_code(a[i])]++;
        cnt2[i][get_code(b[i])]++;
    }
}

int temp[3][3];
int get_distance(int l, int r) {
    for (int i = 0; i < 3; i++)
        if (cnt1[r][i] - cnt1[l-1][i] != cnt2[r][i] - cnt2[l-1][i])
            return -1;

    for (int i = 0; i < 3; i++)
        for (int j = 0; j < 3; j++)
            temp[i][j] = cnt[r][i][j] - cnt[l-1][i][j];

    int ans = 0, left = r - l + 1;
    for (int i = 0; i < 3; i++)
        for (int j = i + 1; j < 3; j++) {
            int mins = min(temp[i][j], temp[j][i]);
            temp[i][j] -= mins;
            temp[j][i] -= mins;
            ans += mins;
            left -= mins * 2;
        }

    for (int i = 0; i < 3; i++)
        left -= temp[i][i];

    ans += left * 2 / 3;
    return ans;
}

/*
int main() {
    init("ATACAT", "ACTATA");
    cout << get_distance(4, 5) << endl;
}
 */
# Verdict Execution time Memory Grader output
1 Correct 33 ms 7948 KB Output is correct
2 Correct 34 ms 9404 KB Output is correct
3 Correct 35 ms 8740 KB Output is correct
4 Correct 34 ms 9320 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 300 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 300 KB Output is correct
4 Correct 6 ms 6808 KB Output is correct
5 Correct 6 ms 6860 KB Output is correct
6 Correct 6 ms 6860 KB Output is correct
7 Correct 6 ms 6420 KB Output is correct
8 Correct 6 ms 6836 KB Output is correct
9 Correct 5 ms 6860 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 300 KB Output is correct
4 Correct 6 ms 6808 KB Output is correct
5 Correct 6 ms 6860 KB Output is correct
6 Correct 6 ms 6860 KB Output is correct
7 Correct 6 ms 6420 KB Output is correct
8 Correct 6 ms 6836 KB Output is correct
9 Correct 5 ms 6860 KB Output is correct
10 Correct 41 ms 9272 KB Output is correct
11 Correct 34 ms 9320 KB Output is correct
12 Correct 40 ms 9388 KB Output is correct
13 Correct 35 ms 9452 KB Output is correct
14 Correct 35 ms 9740 KB Output is correct
15 Correct 42 ms 9612 KB Output is correct
16 Correct 32 ms 9168 KB Output is correct
17 Correct 38 ms 9440 KB Output is correct
18 Correct 32 ms 9600 KB Output is correct
19 Correct 29 ms 9188 KB Output is correct
20 Correct 31 ms 9332 KB Output is correct
21 Correct 30 ms 9588 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 300 KB Output is correct
4 Correct 6 ms 6808 KB Output is correct
5 Correct 6 ms 6860 KB Output is correct
6 Correct 6 ms 6860 KB Output is correct
7 Correct 6 ms 6420 KB Output is correct
8 Correct 6 ms 6836 KB Output is correct
9 Correct 5 ms 6860 KB Output is correct
10 Correct 7 ms 6348 KB Output is correct
11 Correct 6 ms 6860 KB Output is correct
12 Correct 6 ms 6476 KB Output is correct
13 Correct 6 ms 6860 KB Output is correct
14 Correct 6 ms 6860 KB Output is correct
15 Correct 6 ms 6860 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 33 ms 7948 KB Output is correct
2 Correct 34 ms 9404 KB Output is correct
3 Correct 35 ms 8740 KB Output is correct
4 Correct 34 ms 9320 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 300 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 300 KB Output is correct
11 Correct 6 ms 6808 KB Output is correct
12 Correct 6 ms 6860 KB Output is correct
13 Correct 6 ms 6860 KB Output is correct
14 Correct 6 ms 6420 KB Output is correct
15 Correct 6 ms 6836 KB Output is correct
16 Correct 5 ms 6860 KB Output is correct
17 Correct 41 ms 9272 KB Output is correct
18 Correct 34 ms 9320 KB Output is correct
19 Correct 40 ms 9388 KB Output is correct
20 Correct 35 ms 9452 KB Output is correct
21 Correct 35 ms 9740 KB Output is correct
22 Correct 42 ms 9612 KB Output is correct
23 Correct 32 ms 9168 KB Output is correct
24 Correct 38 ms 9440 KB Output is correct
25 Correct 32 ms 9600 KB Output is correct
26 Correct 29 ms 9188 KB Output is correct
27 Correct 31 ms 9332 KB Output is correct
28 Correct 30 ms 9588 KB Output is correct
29 Correct 7 ms 6348 KB Output is correct
30 Correct 6 ms 6860 KB Output is correct
31 Correct 6 ms 6476 KB Output is correct
32 Correct 6 ms 6860 KB Output is correct
33 Correct 6 ms 6860 KB Output is correct
34 Correct 6 ms 6860 KB Output is correct
35 Correct 1 ms 296 KB Output is correct
36 Correct 36 ms 8724 KB Output is correct
37 Correct 34 ms 9360 KB Output is correct
38 Correct 36 ms 9356 KB Output is correct
39 Correct 36 ms 9728 KB Output is correct
40 Correct 35 ms 9696 KB Output is correct
41 Correct 5 ms 6860 KB Output is correct
42 Correct 33 ms 9244 KB Output is correct
43 Correct 31 ms 9624 KB Output is correct
44 Correct 32 ms 9584 KB Output is correct
45 Correct 31 ms 9308 KB Output is correct
46 Correct 31 ms 9600 KB Output is correct
47 Correct 31 ms 9576 KB Output is correct