oj.uz

Submission #444054

# Submission time Handle Problem Language Result Execution time Memory
444054 2021-07-13T04:12:12 Z leinad2 Mutating DNA (IOI21_dna) C++17
100 / 100
 51 ms 8588 KB 
#include "dna.h"
#include<bits/stdc++.h>
using namespace std;
int pre[100010][3], pre2[100010][3], pre3[100010][6], i, j, n;
void init(string a, string b)
{
    n=a.size();
    for(i=0;i<n;i++)
    {
        if(a[i]=='A')pre[i][0]++;
        if(a[i]=='T')pre[i][1]++;
        if(a[i]=='C')pre[i][2]++;
    }
    for(i=0;i<n;i++)
    {
        if(b[i]=='A')pre2[i][0]++;
        if(b[i]=='T')pre2[i][1]++;
        if(b[i]=='C')pre2[i][2]++;
    }
    for(i=1;i<n;i++)for(j=0;j<3;j++)pre[i][j]+=pre[i-1][j],pre2[i][j]+=pre2[i-1][j];
    for(i=0;i<n;i++)
    {
        if(a[i]=='A'&&b[i]=='T')pre3[i][0]++;
        if(a[i]=='A'&&b[i]=='C')pre3[i][1]++;
        if(a[i]=='T'&&b[i]=='A')pre3[i][2]++;
        if(a[i]=='T'&&b[i]=='C')pre3[i][3]++;
        if(a[i]=='C'&&b[i]=='A')pre3[i][4]++;
        if(a[i]=='C'&&b[i]=='T')pre3[i][5]++;
    }
    for(i=1;i<n;i++)for(j=0;j<6;j++)pre3[i][j]+=pre3[i-1][j];
}

int get_distance(int x, int y)
{
    int ans=0;
    for(i=0;i<3;i++)if(pre[y][i]-(x==0?0:pre[x-1][i])!=pre2[y][i]-(x==0?0:pre2[x-1][i]))return -1;
    int A[6]={};
    for(i=0;i<6;i++)A[i]=pre3[y][i]-(x==0?0:pre3[x-1][i]);
    int a=min(A[0], A[2]);ans+=a;A[0]-=a;A[2]-=a;
    a=min(A[1], A[4]);ans+=a;A[1]-=a;A[4]-=a;
    a=min(A[3], A[5]);ans+=a;A[3]-=a;A[5]-=a;
    a=0;for(i=0;i<6;i++)a+=A[i];ans+=(2*a)/3;
    return ans;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 8068 KB Output is correct
2 Correct 45 ms 8152 KB Output is correct
3 Correct 45 ms 7624 KB Output is correct
4 Correct 44 ms 8168 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct

Subtask #2
22.0 / 22.0

# 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 204 KB Output is correct
4 Correct 8 ms 5684 KB Output is correct
5 Correct 8 ms 5708 KB Output is correct
6 Correct 8 ms 5692 KB Output is correct
7 Correct 7 ms 5400 KB Output is correct
8 Correct 9 ms 5708 KB Output is correct
9 Correct 6 ms 5720 KB Output is correct

Subtask #3
13.0 / 13.0

# 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 204 KB Output is correct
4 Correct 8 ms 5684 KB Output is correct
5 Correct 8 ms 5708 KB Output is correct
6 Correct 8 ms 5692 KB Output is correct
7 Correct 7 ms 5400 KB Output is correct
8 Correct 9 ms 5708 KB Output is correct
9 Correct 6 ms 5720 KB Output is correct
10 Correct 46 ms 8068 KB Output is correct
11 Correct 46 ms 8176 KB Output is correct
12 Correct 44 ms 8080 KB Output is correct
13 Correct 46 ms 8320 KB Output is correct
14 Correct 47 ms 8544 KB Output is correct
15 Correct 43 ms 8432 KB Output is correct
16 Correct 42 ms 8080 KB Output is correct
17 Correct 44 ms 8428 KB Output is correct
18 Correct 43 ms 8432 KB Output is correct
19 Correct 42 ms 8028 KB Output is correct
20 Correct 42 ms 8204 KB Output is correct
21 Correct 40 ms 8428 KB Output is correct

Subtask #4
28.0 / 28.0

# 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 204 KB Output is correct
4 Correct 8 ms 5684 KB Output is correct
5 Correct 8 ms 5708 KB Output is correct
6 Correct 8 ms 5692 KB Output is correct
7 Correct 7 ms 5400 KB Output is correct
8 Correct 9 ms 5708 KB Output is correct
9 Correct 6 ms 5720 KB Output is correct
10 Correct 9 ms 5268 KB Output is correct
11 Correct 9 ms 5812 KB Output is correct
12 Correct 8 ms 5324 KB Output is correct
13 Correct 8 ms 5708 KB Output is correct
14 Correct 10 ms 5764 KB Output is correct
15 Correct 7 ms 5708 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 8068 KB Output is correct
2 Correct 45 ms 8152 KB Output is correct
3 Correct 45 ms 7624 KB Output is correct
4 Correct 44 ms 8168 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 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 204 KB Output is correct
11 Correct 8 ms 5684 KB Output is correct
12 Correct 8 ms 5708 KB Output is correct
13 Correct 8 ms 5692 KB Output is correct
14 Correct 7 ms 5400 KB Output is correct
15 Correct 9 ms 5708 KB Output is correct
16 Correct 6 ms 5720 KB Output is correct
17 Correct 46 ms 8068 KB Output is correct
18 Correct 46 ms 8176 KB Output is correct
19 Correct 44 ms 8080 KB Output is correct
20 Correct 46 ms 8320 KB Output is correct
21 Correct 47 ms 8544 KB Output is correct
22 Correct 43 ms 8432 KB Output is correct
23 Correct 42 ms 8080 KB Output is correct
24 Correct 44 ms 8428 KB Output is correct
25 Correct 43 ms 8432 KB Output is correct
26 Correct 42 ms 8028 KB Output is correct
27 Correct 42 ms 8204 KB Output is correct
28 Correct 40 ms 8428 KB Output is correct
29 Correct 9 ms 5268 KB Output is correct
30 Correct 9 ms 5812 KB Output is correct
31 Correct 8 ms 5324 KB Output is correct
32 Correct 8 ms 5708 KB Output is correct
33 Correct 10 ms 5764 KB Output is correct
34 Correct 7 ms 5708 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 45 ms 7636 KB Output is correct
37 Correct 49 ms 8132 KB Output is correct
38 Correct 46 ms 8248 KB Output is correct
39 Correct 48 ms 8576 KB Output is correct
40 Correct 51 ms 8588 KB Output is correct
41 Correct 6 ms 5708 KB Output is correct
42 Correct 42 ms 8164 KB Output is correct
43 Correct 45 ms 8448 KB Output is correct
44 Correct 44 ms 8428 KB Output is correct
45 Correct 40 ms 8092 KB Output is correct
46 Correct 42 ms 8448 KB Output is correct
47 Correct 43 ms 8428 KB Output is correct