Submission #563567

# Submission time Handle Problem Language Result Execution time Memory
563567 2022-05-17T14:13:06 Z rafatoa Mutating DNA (IOI21_dna) C++17
100 / 100
51 ms 9608 KB
#include <bits/stdc++.h>
using namespace std;

int n;
int pre[100005][3][3];
int cnta[100005][3];
int cntb[100005][3];

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

void init(string a, string b){
    n = a.size();

    for(int i=0; i<=n; i++)
        for(int j=0; j<3; j++){
            cnta[i][j] += cnta[i-1][j] + (ix(a[i-1]) == j ? 1 : 0);
            cntb[i][j] += cntb[i-1][j] + (ix(b[i-1]) == j ? 1 : 0);
        }

    for(int i=0; i<=n; i++)
        for(int j=0; j<3; j++)
            for(int k=0; k<3; k++)
                pre[i][j][k] += pre[i-1][j][k] + (ix(a[i-1]) == j && ix(b[i-1]) == k ? 1 : 0);
}

int get_distance(int x, int y){
    x++; y++;
    for(int j=0; j<3; j++)
        if(cnta[y][j]-cnta[x-1][j] != cntb[y][j]-cntb[x-1][j])
            return -1;

    int v[3][3];

    for(int j=0; j<3; j++)
    for(int k=0; k<3; k++)
        v[j][k] = pre[y][j][k] - pre[x-1][j][k];
    
    int ans = 0;

    for(int i=0; i<3; i++)
    for(int j=i+1; j<3; j++){
        if(v[i][j] >= v[j][i]){
            ans += v[j][i];
            v[i][j] -= v[j][i]; v[j][i] = 0;
        } else {
            ans += v[i][j];
            v[j][i] -= v[i][j]; v[i][j] = 0;
        }
    }

    // while(v[0][1] && v[1][2] && v[2][0]){
    //     v[0][1]--; v[1][2]--; v[2][0]--;
    //     ans += 2;
    // }

    // while(v[1][0] && v[2][1] && v[0][2]){
    //     v[1][0]--; v[2][1]--; v[0][2]--;
    //     ans += 2;
    // } 

    //ESTO ES MAS OPTIMO
    ans += v[0][1]*2 + v[1][0]*2;
    return ans;
}
# Verdict Execution time Memory Grader output
1 Correct 37 ms 7944 KB Output is correct
2 Correct 37 ms 7944 KB Output is correct
3 Correct 37 ms 7408 KB Output is correct
4 Correct 37 ms 7948 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 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 8 ms 6564 KB Output is correct
5 Correct 8 ms 6740 KB Output is correct
6 Correct 7 ms 6612 KB Output is correct
7 Correct 8 ms 6228 KB Output is correct
8 Correct 7 ms 6740 KB Output is correct
9 Correct 6 ms 6740 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 8 ms 6564 KB Output is correct
5 Correct 8 ms 6740 KB Output is correct
6 Correct 7 ms 6612 KB Output is correct
7 Correct 8 ms 6228 KB Output is correct
8 Correct 7 ms 6740 KB Output is correct
9 Correct 6 ms 6740 KB Output is correct
10 Correct 38 ms 7940 KB Output is correct
11 Correct 41 ms 7968 KB Output is correct
12 Correct 35 ms 7916 KB Output is correct
13 Correct 50 ms 8084 KB Output is correct
14 Correct 40 ms 8360 KB Output is correct
15 Correct 34 ms 8308 KB Output is correct
16 Correct 32 ms 7920 KB Output is correct
17 Correct 33 ms 8072 KB Output is correct
18 Correct 35 ms 8332 KB Output is correct
19 Correct 31 ms 7904 KB Output is correct
20 Correct 31 ms 8072 KB Output is correct
21 Correct 33 ms 8468 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 8 ms 6564 KB Output is correct
5 Correct 8 ms 6740 KB Output is correct
6 Correct 7 ms 6612 KB Output is correct
7 Correct 8 ms 6228 KB Output is correct
8 Correct 7 ms 6740 KB Output is correct
9 Correct 6 ms 6740 KB Output is correct
10 Correct 7 ms 6156 KB Output is correct
11 Correct 7 ms 6636 KB Output is correct
12 Correct 8 ms 6248 KB Output is correct
13 Correct 7 ms 6612 KB Output is correct
14 Correct 8 ms 6740 KB Output is correct
15 Correct 7 ms 6740 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 37 ms 7944 KB Output is correct
2 Correct 37 ms 7944 KB Output is correct
3 Correct 37 ms 7408 KB Output is correct
4 Correct 37 ms 7948 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 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 8 ms 6564 KB Output is correct
12 Correct 8 ms 6740 KB Output is correct
13 Correct 7 ms 6612 KB Output is correct
14 Correct 8 ms 6228 KB Output is correct
15 Correct 7 ms 6740 KB Output is correct
16 Correct 6 ms 6740 KB Output is correct
17 Correct 38 ms 7940 KB Output is correct
18 Correct 41 ms 7968 KB Output is correct
19 Correct 35 ms 7916 KB Output is correct
20 Correct 50 ms 8084 KB Output is correct
21 Correct 40 ms 8360 KB Output is correct
22 Correct 34 ms 8308 KB Output is correct
23 Correct 32 ms 7920 KB Output is correct
24 Correct 33 ms 8072 KB Output is correct
25 Correct 35 ms 8332 KB Output is correct
26 Correct 31 ms 7904 KB Output is correct
27 Correct 31 ms 8072 KB Output is correct
28 Correct 33 ms 8468 KB Output is correct
29 Correct 7 ms 6156 KB Output is correct
30 Correct 7 ms 6636 KB Output is correct
31 Correct 8 ms 6248 KB Output is correct
32 Correct 7 ms 6612 KB Output is correct
33 Correct 8 ms 6740 KB Output is correct
34 Correct 7 ms 6740 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 35 ms 7492 KB Output is correct
37 Correct 41 ms 7944 KB Output is correct
38 Correct 37 ms 7952 KB Output is correct
39 Correct 38 ms 8308 KB Output is correct
40 Correct 37 ms 8336 KB Output is correct
41 Correct 6 ms 6740 KB Output is correct
42 Correct 36 ms 7964 KB Output is correct
43 Correct 51 ms 8328 KB Output is correct
44 Correct 45 ms 8360 KB Output is correct
45 Correct 33 ms 8104 KB Output is correct
46 Correct 33 ms 9608 KB Output is correct
47 Correct 34 ms 9592 KB Output is correct