oj.uz

Submission #549956

# Submission time Handle Problem Language Result Execution time Memory
549956 2022-04-17T01:26:51 Z CyberSleeper Mutating DNA (IOI21_dna) C++17
100 / 100
 43 ms 10176 KB 
#include "dna.h"
#include <bits/stdc++.h>
using namespace std;
char gen[]={'A', 'T', 'C'};
int N, diff[100007], pref[3][3][100007], prefA[3][100007], prefB[3][100007];
int getD(int x){
    if(x>=0)
        return diff[x];
    return 0;
}
int getP(int x, int y, int z){
    if(z>=0)
        return pref[x][y][z];
    return 0;
}
int getA(int x, int y){
    if(y>=0)
        return prefA[x][y];
    return 0;
}
int getB(int x, int y){
    if(y>=0)
        return prefB[x][y];
    return 0;
}
void init(std::string a, std::string b) {
    N=a.size();
    for(int i=0; i<N; i++){
        diff[i]=(a[i]!=b[i])+getD(i-1);
        for(int j=0; j<3; j++){
            prefA[j][i]=(a[i]==gen[j])+getA(j, i-1);
            prefB[j][i]=(b[i]==gen[j])+getB(j, i-1);
            for(int k=0; k<3; k++){
                pref[j][k][i]=((a[i]==gen[j])&&(b[i]==gen[k]))+getP(j, k, i-1);
            }
        }
    }
}
int get_distance(int x, int y){
    int sisa=0,  ans=0;
    for(int i=0; i<3; i++){
        if((getA(i, y)-getA(i, x-1))!=(getB(i, y)-getB(i, x-1)))
            return -1;
        for(int j=i+1, tmp; j<3; j++){
            if(i!=j){
                tmp=min(getP(i, j, y)-getP(i, j, x-1), getP(j, i, y)-getP(j, i, x-1));
                ans+=tmp;
                sisa+=max(getP(i, j, y)-getP(i, j, x-1), getP(j, i, y)-getP(j, i, x-1))-tmp;
            }
        }
    }
    return ans+sisa*2/3;
	return 0;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 9708 KB Output is correct
2 Correct 38 ms 9740 KB Output is correct
3 Correct 38 ms 9188 KB Output is correct
4 Correct 43 ms 9740 KB Output is correct
5 Correct 1 ms 312 KB Output is correct
6 Correct 1 ms 308 KB Output is correct
7 Correct 1 ms 340 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 7 ms 7272 KB Output is correct
5 Correct 7 ms 7240 KB Output is correct
6 Correct 8 ms 7324 KB Output is correct
7 Correct 7 ms 6824 KB Output is correct
8 Correct 7 ms 7236 KB Output is correct
9 Correct 6 ms 7296 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 7 ms 7272 KB Output is correct
5 Correct 7 ms 7240 KB Output is correct
6 Correct 8 ms 7324 KB Output is correct
7 Correct 7 ms 6824 KB Output is correct
8 Correct 7 ms 7236 KB Output is correct
9 Correct 6 ms 7296 KB Output is correct
10 Correct 41 ms 9716 KB Output is correct
11 Correct 38 ms 9736 KB Output is correct
12 Correct 38 ms 9580 KB Output is correct
13 Correct 42 ms 9840 KB Output is correct
14 Correct 42 ms 10108 KB Output is correct
15 Correct 37 ms 9988 KB Output is correct
16 Correct 35 ms 9628 KB Output is correct
17 Correct 38 ms 9720 KB Output is correct
18 Correct 41 ms 9972 KB Output is correct
19 Correct 34 ms 9620 KB Output is correct
20 Correct 33 ms 9756 KB Output is correct
21 Correct 32 ms 9984 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 7 ms 7272 KB Output is correct
5 Correct 7 ms 7240 KB Output is correct
6 Correct 8 ms 7324 KB Output is correct
7 Correct 7 ms 6824 KB Output is correct
8 Correct 7 ms 7236 KB Output is correct
9 Correct 6 ms 7296 KB Output is correct
10 Correct 6 ms 6740 KB Output is correct
11 Correct 7 ms 7232 KB Output is correct
12 Correct 7 ms 6868 KB Output is correct
13 Correct 7 ms 7232 KB Output is correct
14 Correct 8 ms 7252 KB Output is correct
15 Correct 7 ms 7252 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 9708 KB Output is correct
2 Correct 38 ms 9740 KB Output is correct
3 Correct 38 ms 9188 KB Output is correct
4 Correct 43 ms 9740 KB Output is correct
5 Correct 1 ms 312 KB Output is correct
6 Correct 1 ms 308 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 7 ms 7272 KB Output is correct
12 Correct 7 ms 7240 KB Output is correct
13 Correct 8 ms 7324 KB Output is correct
14 Correct 7 ms 6824 KB Output is correct
15 Correct 7 ms 7236 KB Output is correct
16 Correct 6 ms 7296 KB Output is correct
17 Correct 41 ms 9716 KB Output is correct
18 Correct 38 ms 9736 KB Output is correct
19 Correct 38 ms 9580 KB Output is correct
20 Correct 42 ms 9840 KB Output is correct
21 Correct 42 ms 10108 KB Output is correct
22 Correct 37 ms 9988 KB Output is correct
23 Correct 35 ms 9628 KB Output is correct
24 Correct 38 ms 9720 KB Output is correct
25 Correct 41 ms 9972 KB Output is correct
26 Correct 34 ms 9620 KB Output is correct
27 Correct 33 ms 9756 KB Output is correct
28 Correct 32 ms 9984 KB Output is correct
29 Correct 6 ms 6740 KB Output is correct
30 Correct 7 ms 7232 KB Output is correct
31 Correct 7 ms 6868 KB Output is correct
32 Correct 7 ms 7232 KB Output is correct
33 Correct 8 ms 7252 KB Output is correct
34 Correct 7 ms 7252 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 39 ms 9244 KB Output is correct
37 Correct 40 ms 9752 KB Output is correct
38 Correct 39 ms 9712 KB Output is correct
39 Correct 42 ms 10108 KB Output is correct
40 Correct 38 ms 10052 KB Output is correct
41 Correct 6 ms 7252 KB Output is correct
42 Correct 36 ms 9652 KB Output is correct
43 Correct 38 ms 10036 KB Output is correct
44 Correct 39 ms 9980 KB Output is correct
45 Correct 33 ms 9732 KB Output is correct
46 Correct 33 ms 10176 KB Output is correct
47 Correct 33 ms 9984 KB Output is correct