oj.uz

Submission #838093

# Submission time Handle Problem Language Result Execution time Memory
838093 2023-08-26T08:28:22 Z jasmin Mutating DNA (IOI21_dna) C++17
100 / 100
 36 ms 9736 KB 
//IOI 2021
#include<bits/stdc++.h>
using namespace std;

const int N=1e5+5;
int cnta[N][3];
int cntb[N][3];

int ps[N][3][3];

void init(string a, string b){
    int n=a.size();
    vector<int> enc = {'A', 'C', 'T'};
    map<char, int> dec;
    dec['A']=0;
    dec['C']=1;
    dec['T']=2;

    for(int i=0; i<n; i++){
        
        for(int j=0; j<3; j++){

            cnta[i+1][j] = cnta[i][j];
            cntb[i+1][j] = cntb[i][j];

            if(a[i] == enc[j]){
                cnta[i+1][j]++;
            }
            if(b[i] == enc[j]){
                cntb[i+1][j]++;
            }
        }
    }

    for(int i=0; i<n; i++){

        for(int j=0; j<3; j++){
            for(int k=0; k<3; k++){
                ps[i+1][j][k] = ps[i][j][k];
            }
        }

        int j = dec[a[i]];
        int k = dec[b[i]];

        if(j==k) continue;

        ps[i+1][j][k]++;
    }
}

int get_distance(int x, int y){

    for(int j=0; j<3; j++){

        if(cnta[y+1][j]-cnta[x][j] != cntb[y+1][j]-cntb[x][j]){
            return -1;
        }
    }

    int ans1=0;
    int ans2=0;
    for(int j=0; j<3; j++){
        for(int k=0; k<j; k++){

            int a=ps[y+1][j][k] - ps[x][j][k];
            int b=ps[y+1][k][j] - ps[x][k][j];

            ans1 += min(a, b);
            ans2 += max(a, b)-min(a, b);
        }
    }

    assert(ans2%3 == 0);
    int ans = ans1 + 2*ans2/3;
    return ans;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 7948 KB Output is correct
2 Correct 28 ms 7952 KB Output is correct
3 Correct 29 ms 7460 KB Output is correct
4 Correct 30 ms 7968 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 0 ms 212 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 6 ms 6612 KB Output is correct
5 Correct 6 ms 6740 KB Output is correct
6 Correct 6 ms 6612 KB Output is correct
7 Correct 6 ms 6228 KB Output is correct
8 Correct 7 ms 6748 KB Output is correct
9 Correct 4 ms 6740 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 6 ms 6612 KB Output is correct
5 Correct 6 ms 6740 KB Output is correct
6 Correct 6 ms 6612 KB Output is correct
7 Correct 6 ms 6228 KB Output is correct
8 Correct 7 ms 6748 KB Output is correct
9 Correct 4 ms 6740 KB Output is correct
10 Correct 28 ms 7956 KB Output is correct
11 Correct 28 ms 8004 KB Output is correct
12 Correct 31 ms 8008 KB Output is correct
13 Correct 29 ms 8132 KB Output is correct
14 Correct 29 ms 8344 KB Output is correct
15 Correct 27 ms 8328 KB Output is correct
16 Correct 28 ms 7960 KB Output is correct
17 Correct 35 ms 8084 KB Output is correct
18 Correct 29 ms 8328 KB Output is correct
19 Correct 27 ms 7968 KB Output is correct
20 Correct 27 ms 8084 KB Output is correct
21 Correct 27 ms 8464 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 6 ms 6612 KB Output is correct
5 Correct 6 ms 6740 KB Output is correct
6 Correct 6 ms 6612 KB Output is correct
7 Correct 6 ms 6228 KB Output is correct
8 Correct 7 ms 6748 KB Output is correct
9 Correct 4 ms 6740 KB Output is correct
10 Correct 6 ms 6100 KB Output is correct
11 Correct 7 ms 6740 KB Output is correct
12 Correct 6 ms 6228 KB Output is correct
13 Correct 7 ms 6868 KB Output is correct
14 Correct 8 ms 6852 KB Output is correct
15 Correct 5 ms 6868 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 7948 KB Output is correct
2 Correct 28 ms 7952 KB Output is correct
3 Correct 29 ms 7460 KB Output is correct
4 Correct 30 ms 7968 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 6 ms 6612 KB Output is correct
12 Correct 6 ms 6740 KB Output is correct
13 Correct 6 ms 6612 KB Output is correct
14 Correct 6 ms 6228 KB Output is correct
15 Correct 7 ms 6748 KB Output is correct
16 Correct 4 ms 6740 KB Output is correct
17 Correct 28 ms 7956 KB Output is correct
18 Correct 28 ms 8004 KB Output is correct
19 Correct 31 ms 8008 KB Output is correct
20 Correct 29 ms 8132 KB Output is correct
21 Correct 29 ms 8344 KB Output is correct
22 Correct 27 ms 8328 KB Output is correct
23 Correct 28 ms 7960 KB Output is correct
24 Correct 35 ms 8084 KB Output is correct
25 Correct 29 ms 8328 KB Output is correct
26 Correct 27 ms 7968 KB Output is correct
27 Correct 27 ms 8084 KB Output is correct
28 Correct 27 ms 8464 KB Output is correct
29 Correct 6 ms 6100 KB Output is correct
30 Correct 7 ms 6740 KB Output is correct
31 Correct 6 ms 6228 KB Output is correct
32 Correct 7 ms 6868 KB Output is correct
33 Correct 8 ms 6852 KB Output is correct
34 Correct 5 ms 6868 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 36 ms 8732 KB Output is correct
37 Correct 30 ms 9352 KB Output is correct
38 Correct 32 ms 9364 KB Output is correct
39 Correct 31 ms 9736 KB Output is correct
40 Correct 31 ms 9736 KB Output is correct
41 Correct 5 ms 6868 KB Output is correct
42 Correct 30 ms 9276 KB Output is correct
43 Correct 31 ms 9616 KB Output is correct
44 Correct 36 ms 9608 KB Output is correct
45 Correct 29 ms 9236 KB Output is correct
46 Correct 28 ms 9608 KB Output is correct
47 Correct 28 ms 9616 KB Output is correct