oj.uz

Submission #571533

# Submission time Handle Problem Language Result Execution time Memory
571533 2022-06-02T10:38:43 Z il9 Mutating DNA (IOI21_dna) C++17
100 / 100
 60 ms 8584 KB 
#include <bits/stdc++.h>

using namespace std;
int pre[100001][6];
int n;
int q;
int pre1[100001][3][2];
int get_distance(int x,int y)
{
    //pre[y+1]-pre[x]

    int ans[6];
    for(int i=0;i<3;i++)
    {
        if(pre1[y+1][i][0]-pre1[x][i][0]!=pre1[y+1][i][1]-pre1[x][i][1])
        {

            return -1;
        }
    }
    for(int i=0;i<6;i++)
    {
        ans[i]=pre[y+1][i]-pre[x][i];
    }
    int prop=0;
    for(int i=0;i<6;i+=2)
    {
        int temp=min(ans[i],ans[i+1]);
        prop+=temp;

        ans[i]-=temp;
        ans[i+1]-=temp;
    }
    int temp=0;
    for(int i=0;i<6;i++)
    {
        temp+=ans[i];
    }

    if(temp%3==0)
    {
        temp/=3;
        temp*=2;
    }else
    {
        temp=2*(temp/3)+temp%3;
    }

    return prop+temp;
}
void init(string a,string b)
{
    n=a.size();

    for(int i=0;i<6;i++)
    {
        pre[0][i]=0;
    }
    pre1[0][0][0]=0;
    pre1[0][1][0]=0;
    pre1[0][2][0]=0;
      pre1[0][0][1]=0;
    pre1[0][1][1]=0;
    pre1[0][2][1]=0;
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<3;j++)
        {
            pre1[i+1][j][0]=pre1[i][j][0];
            pre1[i+1][j][1]=pre1[i][j][1];
        }
        if(a[i]=='A')
        {
            pre1[i+1][0][0]++;
        }else if(a[i]=='T')
        {
             pre1[i+1][1][0]++;
        }else
        {
             pre1[i+1][2][0]++;
        }
        if(b[i]=='A')
        {
            pre1[i+1][0][1]++;
        }else if(b[i]=='T')
        {
             pre1[i+1][1][1]++;
        }else
        {
             pre1[i+1][2][1]++;
        }
    }
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<6;j++)
        {
            pre[i+1][j]=pre[i][j];
        }
        if(a[i]!=b[i])
        {
            if(a[i]=='A')
            {
                if(b[i]=='T')
                {
                    pre[i+1][0]++;
                }else if(b[i]=='C')
                {
                     pre[i+1][2]++;
                }

            }else if(a[i]=='T')
            {
                if(b[i]=='A')
                {
                    pre[i+1][1]++;
                }else if(b[i]=='C')
                {
                    pre[i+1][5]++;
                }
            }else if(a[i]=='C')
            {
                if(b[i]=='T')
                {
                    pre[i+1][4]++;
                }else if(b[i]=='A')
                {
                    pre[i+1][3]++;
                }
            }
        }
    }

}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 7564 KB Output is correct
2 Correct 35 ms 7552 KB Output is correct
3 Correct 39 ms 7152 KB Output is correct
4 Correct 46 ms 7532 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 308 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 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 7 ms 5688 KB Output is correct
5 Correct 7 ms 5716 KB Output is correct
6 Correct 7 ms 5696 KB Output is correct
7 Correct 7 ms 5296 KB Output is correct
8 Correct 8 ms 5716 KB Output is correct
9 Correct 6 ms 5672 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 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 7 ms 5688 KB Output is correct
5 Correct 7 ms 5716 KB Output is correct
6 Correct 7 ms 5696 KB Output is correct
7 Correct 7 ms 5296 KB Output is correct
8 Correct 8 ms 5716 KB Output is correct
9 Correct 6 ms 5672 KB Output is correct
10 Correct 45 ms 7564 KB Output is correct
11 Correct 38 ms 7652 KB Output is correct
12 Correct 45 ms 7528 KB Output is correct
13 Correct 44 ms 7748 KB Output is correct
14 Correct 38 ms 7964 KB Output is correct
15 Correct 60 ms 7900 KB Output is correct
16 Correct 45 ms 7576 KB Output is correct
17 Correct 41 ms 7680 KB Output is correct
18 Correct 34 ms 7940 KB Output is correct
19 Correct 33 ms 7660 KB Output is correct
20 Correct 41 ms 7828 KB Output is correct
21 Correct 32 ms 7944 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 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 7 ms 5688 KB Output is correct
5 Correct 7 ms 5716 KB Output is correct
6 Correct 7 ms 5696 KB Output is correct
7 Correct 7 ms 5296 KB Output is correct
8 Correct 8 ms 5716 KB Output is correct
9 Correct 6 ms 5672 KB Output is correct
10 Correct 6 ms 5276 KB Output is correct
11 Correct 6 ms 5692 KB Output is correct
12 Correct 6 ms 5316 KB Output is correct
13 Correct 6 ms 5684 KB Output is correct
14 Correct 7 ms 5716 KB Output is correct
15 Correct 5 ms 5716 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 7564 KB Output is correct
2 Correct 35 ms 7552 KB Output is correct
3 Correct 39 ms 7152 KB Output is correct
4 Correct 46 ms 7532 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 308 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 7 ms 5688 KB Output is correct
12 Correct 7 ms 5716 KB Output is correct
13 Correct 7 ms 5696 KB Output is correct
14 Correct 7 ms 5296 KB Output is correct
15 Correct 8 ms 5716 KB Output is correct
16 Correct 6 ms 5672 KB Output is correct
17 Correct 45 ms 7564 KB Output is correct
18 Correct 38 ms 7652 KB Output is correct
19 Correct 45 ms 7528 KB Output is correct
20 Correct 44 ms 7748 KB Output is correct
21 Correct 38 ms 7964 KB Output is correct
22 Correct 60 ms 7900 KB Output is correct
23 Correct 45 ms 7576 KB Output is correct
24 Correct 41 ms 7680 KB Output is correct
25 Correct 34 ms 7940 KB Output is correct
26 Correct 33 ms 7660 KB Output is correct
27 Correct 41 ms 7828 KB Output is correct
28 Correct 32 ms 7944 KB Output is correct
29 Correct 6 ms 5276 KB Output is correct
30 Correct 6 ms 5692 KB Output is correct
31 Correct 6 ms 5316 KB Output is correct
32 Correct 6 ms 5684 KB Output is correct
33 Correct 7 ms 5716 KB Output is correct
34 Correct 5 ms 5716 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 35 ms 7660 KB Output is correct
37 Correct 36 ms 8184 KB Output is correct
38 Correct 36 ms 8172 KB Output is correct
39 Correct 39 ms 8536 KB Output is correct
40 Correct 36 ms 8584 KB Output is correct
41 Correct 4 ms 5716 KB Output is correct
42 Correct 35 ms 8084 KB Output is correct
43 Correct 34 ms 8476 KB Output is correct
44 Correct 35 ms 8456 KB Output is correct
45 Correct 35 ms 8160 KB Output is correct
46 Correct 35 ms 8436 KB Output is correct
47 Correct 34 ms 8456 KB Output is correct