oj.uz

Submission #909803

# Submission time Handle Problem Language Result Execution time Memory
909803 2024-01-17T12:38:51 Z Marceantasy Mutating DNA (IOI21_dna) C++17
100 / 100
 34 ms 9868 KB 
#include <bits/stdc++.h>

using namespace std;


int n;
int pref[100000][3][3]; 
int pre1[100000][3], pre2[100000][3]; 
int matrix[3][3];
string letras = "ACT";
void init(string a, string b){
    n = a.size();
    memset(pref, 0, sizeof(pref));
    for (int i = 0; i < n; i++){
        for (int A = 0; A < 3; A++){
            for (int B = 0; B < 3; B++){
                if (i > 0){
                    pref[i][A][B] += pref[i-1][A][B];
                }
                if (a[i] == letras[A] && b[i] == letras[B]){
                    pref[i][A][B]++;
                }
            }
        }
    }
    memset(pre1, 0, sizeof(pre1));
    memset(pre2, 0, sizeof(pre2));
    for (int i = 0; i < n; i++){
        for (int j = 0; j < 3; j++){
            if (i > 0){
                pre1[i][j] = pre1[i-1][j];
                pre2[i][j] = pre2[i-1][j];
            }
            if (a[i] == letras[j]){
                pre1[i][j]++;
            } 
            if (b[i] == letras[j]){
                pre2[i][j]++;
            }
        }
    }



}

int get_distance(int x, int y){
    for(int A  = 0; A < 3; A++){
        if (pre1[y][A] - ( x == 0 ? 0 : pre1[x-1][A]) != pre2[y][A] - ( x == 0 ? 0 : pre2[x-1][A])){
            return -1;
        }
    }
    for (int A = 0; A<3; ++A){
        for(int B = 0; B<3; ++B){
            matrix[A][B] = pref[y][A][B] - ( x == 0 ? 0 : pref[x-1][A][B]);
        }
    }
    int sol = 0;
    for (int A = 0; A<3; ++A){
        for(int B = 0; B<3; ++B){
            if (A == B){
                continue;
            }
            int val = min(matrix[A][B], matrix[B][A]);
            sol += val;
            matrix[A][B] -= val;
            matrix[B][A] -= val;
        }
    }
    int f = 2*max(matrix[0][1], matrix[1][0]);
    return sol + f; 
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 9360 KB Output is correct
2 Correct 33 ms 9336 KB Output is correct
3 Correct 31 ms 9292 KB Output is correct
4 Correct 32 ms 9488 KB Output is correct
5 Correct 2 ms 6232 KB Output is correct
6 Correct 2 ms 6236 KB Output is correct
7 Correct 2 ms 6236 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6236 KB Output is correct
2 Correct 3 ms 6232 KB Output is correct
3 Correct 2 ms 6236 KB Output is correct
4 Correct 7 ms 7080 KB Output is correct
5 Correct 6 ms 7000 KB Output is correct
6 Correct 6 ms 7004 KB Output is correct
7 Correct 6 ms 7000 KB Output is correct
8 Correct 6 ms 6984 KB Output is correct
9 Correct 5 ms 6892 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6236 KB Output is correct
2 Correct 3 ms 6232 KB Output is correct
3 Correct 2 ms 6236 KB Output is correct
4 Correct 7 ms 7080 KB Output is correct
5 Correct 6 ms 7000 KB Output is correct
6 Correct 6 ms 7004 KB Output is correct
7 Correct 6 ms 7000 KB Output is correct
8 Correct 6 ms 6984 KB Output is correct
9 Correct 5 ms 6892 KB Output is correct
10 Correct 33 ms 9492 KB Output is correct
11 Correct 31 ms 9484 KB Output is correct
12 Correct 30 ms 9724 KB Output is correct
13 Correct 34 ms 9756 KB Output is correct
14 Correct 31 ms 9740 KB Output is correct
15 Correct 29 ms 9816 KB Output is correct
16 Correct 30 ms 9612 KB Output is correct
17 Correct 31 ms 9764 KB Output is correct
18 Correct 30 ms 9744 KB Output is correct
19 Correct 29 ms 9756 KB Output is correct
20 Correct 33 ms 9752 KB Output is correct
21 Correct 28 ms 9740 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6236 KB Output is correct
2 Correct 3 ms 6232 KB Output is correct
3 Correct 2 ms 6236 KB Output is correct
4 Correct 7 ms 7080 KB Output is correct
5 Correct 6 ms 7000 KB Output is correct
6 Correct 6 ms 7004 KB Output is correct
7 Correct 6 ms 7000 KB Output is correct
8 Correct 6 ms 6984 KB Output is correct
9 Correct 5 ms 6892 KB Output is correct
10 Correct 7 ms 7004 KB Output is correct
11 Correct 7 ms 7004 KB Output is correct
12 Correct 7 ms 6956 KB Output is correct
13 Correct 7 ms 7004 KB Output is correct
14 Correct 7 ms 7008 KB Output is correct
15 Correct 5 ms 6980 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 9360 KB Output is correct
2 Correct 33 ms 9336 KB Output is correct
3 Correct 31 ms 9292 KB Output is correct
4 Correct 32 ms 9488 KB Output is correct
5 Correct 2 ms 6232 KB Output is correct
6 Correct 2 ms 6236 KB Output is correct
7 Correct 2 ms 6236 KB Output is correct
8 Correct 2 ms 6236 KB Output is correct
9 Correct 3 ms 6232 KB Output is correct
10 Correct 2 ms 6236 KB Output is correct
11 Correct 7 ms 7080 KB Output is correct
12 Correct 6 ms 7000 KB Output is correct
13 Correct 6 ms 7004 KB Output is correct
14 Correct 6 ms 7000 KB Output is correct
15 Correct 6 ms 6984 KB Output is correct
16 Correct 5 ms 6892 KB Output is correct
17 Correct 33 ms 9492 KB Output is correct
18 Correct 31 ms 9484 KB Output is correct
19 Correct 30 ms 9724 KB Output is correct
20 Correct 34 ms 9756 KB Output is correct
21 Correct 31 ms 9740 KB Output is correct
22 Correct 29 ms 9816 KB Output is correct
23 Correct 30 ms 9612 KB Output is correct
24 Correct 31 ms 9764 KB Output is correct
25 Correct 30 ms 9744 KB Output is correct
26 Correct 29 ms 9756 KB Output is correct
27 Correct 33 ms 9752 KB Output is correct
28 Correct 28 ms 9740 KB Output is correct
29 Correct 7 ms 7004 KB Output is correct
30 Correct 7 ms 7004 KB Output is correct
31 Correct 7 ms 6956 KB Output is correct
32 Correct 7 ms 7004 KB Output is correct
33 Correct 7 ms 7008 KB Output is correct
34 Correct 5 ms 6980 KB Output is correct
35 Correct 2 ms 6236 KB Output is correct
36 Correct 30 ms 9292 KB Output is correct
37 Correct 31 ms 9484 KB Output is correct
38 Correct 33 ms 9868 KB Output is correct
39 Correct 32 ms 9836 KB Output is correct
40 Correct 32 ms 9688 KB Output is correct
41 Correct 5 ms 7000 KB Output is correct
42 Correct 31 ms 9756 KB Output is correct
43 Correct 31 ms 9752 KB Output is correct
44 Correct 31 ms 9800 KB Output is correct
45 Correct 31 ms 9752 KB Output is correct
46 Correct 29 ms 9740 KB Output is correct
47 Correct 29 ms 9748 KB Output is correct