oj.uz

Submission #647177

# Submission time Handle Problem Language Result Execution time Memory
647177 2022-10-01T19:16:03 Z kkkkkkkk Mutating DNA (IOI21_dna) C++17
100 / 100
 37 ms 8908 KB 
#include "dna.h"
#include <iostream>
 
using namespace std;
 
string a,b;
int klk_A1[100001]={0},klk_C1[100001]={0},klk_T1[100001]={0};
int klk_A2[100001]={0},klk_C2[100001]={0},klk_T2[100001]={0};
int A_C[100001]={0},A_T[100001]={0},C_A[100001]={0},C_T[100001]={0},T_A[100001]={0},T_C[100001]={0};
 
void init(string A,string B)
{
    a=A;
    b=B;
    if (a[0]=='A') klk_A1[0]=1;
    else if (a[0]=='C') klk_C1[0]=1;
    else klk_T1[0]=1;
    if (b[0]=='A') klk_A2[0]=1;
    else if (b[0]=='C') klk_C2[0]=1;
    else klk_T2[0]=1;
    //if (a[0]!=b[0]) razlicni[0]=1;
    if (a[0]=='A'&&b[0]=='C') A_C[0]++;
    else if (a[0]=='A'&&b[0]=='T') A_T[0]++;
    else if (a[0]=='C'&&b[0]=='A') C_A[0]++;
    else if (a[0]=='C'&&b[0]=='T') C_T[0]++;
    else if (a[0]=='T'&&b[0]=='A') T_A[0]++;
    else if (a[0]=='T'&&b[0]=='C') T_C[0]++;
    for (int i=1;i<a.size();i++)
    {
        klk_A1[i]=klk_A1[i-1],klk_C1[i]=klk_C1[i-1],klk_T1[i]=klk_T1[i-1];
        if (a[i]=='A') klk_A1[i]++;
        else if (a[i]=='C') klk_C1[i]++;
        else klk_T1[i]++;
        klk_A2[i]=klk_A2[i-1],klk_C2[i]=klk_C2[i-1],klk_T2[i]=klk_T2[i-1];
        if (b[i]=='A') klk_A2[i]++;
        else if (b[i]=='C') klk_C2[i]++;
        else klk_T2[i]++;
        A_C[i]=A_C[i-1],A_T[i]=A_T[i-1],C_A[i]=C_A[i-1],C_T[i]=C_T[i-1],T_A[i]=T_A[i-1],T_C[i]=T_C[i-1];
        if (a[i]=='A'&&b[i]=='C') A_C[i]++;
        else if (a[i]=='A'&&b[i]=='T') A_T[i]++;
        else if (a[i]=='C'&&b[i]=='A') C_A[i]++;
        else if (a[i]=='C'&&b[i]=='T') C_T[i]++;
        else if (a[i]=='T'&&b[i]=='A') T_A[i]++;
        else if (a[i]=='T'&&b[i]=='C') T_C[i]++;
    }  
}
 
int get_distance(int x,int y)
{
    bool ok=false;
    if (x==0&&klk_A1[y]==klk_A2[y]&&klk_C1[y]==klk_C2[y]&&klk_T1[y]==klk_T2[y])
        ok=true;
    if (x>0&&klk_A1[y]-klk_A1[x-1]==klk_A2[y]-klk_A2[x-1]&&klk_C1[y]-klk_C1[x-1]==klk_C2[y]-klk_C2[x-1]&&klk_T1[y]-klk_T1[x-1]==klk_T2[y]-klk_T2[x-1])
        ok=true;
    if (!ok) return -1;
    int ac,at,ca,ct,ta,tc;
    if (x==0) ac=A_C[y],at=A_T[y],ca=C_A[y],ct=C_T[y],ta=T_A[y],tc=T_C[y];
    else ac=A_C[y]-A_C[x-1],at=A_T[y]-A_T[x-1],ca=C_A[y]-C_A[x-1],ct=C_T[y]-C_T[x-1],ta=T_A[y]-T_A[x-1],tc=T_C[y]-T_C[x-1];
    int br_zameni=0,mac=min(ac,ca),mat=min(at,ta),mct=min(ct,tc);
    
    br_zameni+=mac,ac-=mac,ca-=mac;
    br_zameni+=mat,at-=mat,ta-=mat;
    br_zameni+=mct,ct-=mct,tc-=mct;
    br_zameni+=(((ac+at+ca+ct+ta+tc)/3)*2);
    return br_zameni;
    
}

Compilation message

dna.cpp: In function 'void init(std::string, std::string)':
dna.cpp:28:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |     for (int i=1;i<a.size();i++)
      |                  ~^~~~~~~~~

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 7712 KB Output is correct
2 Correct 34 ms 7772 KB Output is correct
3 Correct 37 ms 7324 KB Output is correct
4 Correct 35 ms 7760 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 308 KB Output is correct
7 Correct 1 ms 212 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 212 KB Output is correct
4 Correct 5 ms 5952 KB Output is correct
5 Correct 5 ms 5972 KB Output is correct
6 Correct 5 ms 5976 KB Output is correct
7 Correct 6 ms 5588 KB Output is correct
8 Correct 6 ms 5980 KB Output is correct
9 Correct 5 ms 5952 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 212 KB Output is correct
4 Correct 5 ms 5952 KB Output is correct
5 Correct 5 ms 5972 KB Output is correct
6 Correct 5 ms 5976 KB Output is correct
7 Correct 6 ms 5588 KB Output is correct
8 Correct 6 ms 5980 KB Output is correct
9 Correct 5 ms 5952 KB Output is correct
10 Correct 36 ms 7752 KB Output is correct
11 Correct 37 ms 7756 KB Output is correct
12 Correct 35 ms 7788 KB Output is correct
13 Correct 34 ms 8552 KB Output is correct
14 Correct 35 ms 8768 KB Output is correct
15 Correct 35 ms 8756 KB Output is correct
16 Correct 34 ms 8324 KB Output is correct
17 Correct 34 ms 8652 KB Output is correct
18 Correct 33 ms 8712 KB Output is correct
19 Correct 30 ms 8420 KB Output is correct
20 Correct 32 ms 8500 KB Output is correct
21 Correct 31 ms 8792 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 212 KB Output is correct
4 Correct 5 ms 5952 KB Output is correct
5 Correct 5 ms 5972 KB Output is correct
6 Correct 5 ms 5976 KB Output is correct
7 Correct 6 ms 5588 KB Output is correct
8 Correct 6 ms 5980 KB Output is correct
9 Correct 5 ms 5952 KB Output is correct
10 Correct 6 ms 5452 KB Output is correct
11 Correct 6 ms 5972 KB Output is correct
12 Correct 5 ms 5588 KB Output is correct
13 Correct 6 ms 5972 KB Output is correct
14 Correct 6 ms 5948 KB Output is correct
15 Correct 5 ms 5972 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 7712 KB Output is correct
2 Correct 34 ms 7772 KB Output is correct
3 Correct 37 ms 7324 KB Output is correct
4 Correct 35 ms 7760 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 308 KB Output is correct
7 Correct 1 ms 212 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 212 KB Output is correct
11 Correct 5 ms 5952 KB Output is correct
12 Correct 5 ms 5972 KB Output is correct
13 Correct 5 ms 5976 KB Output is correct
14 Correct 6 ms 5588 KB Output is correct
15 Correct 6 ms 5980 KB Output is correct
16 Correct 5 ms 5952 KB Output is correct
17 Correct 36 ms 7752 KB Output is correct
18 Correct 37 ms 7756 KB Output is correct
19 Correct 35 ms 7788 KB Output is correct
20 Correct 34 ms 8552 KB Output is correct
21 Correct 35 ms 8768 KB Output is correct
22 Correct 35 ms 8756 KB Output is correct
23 Correct 34 ms 8324 KB Output is correct
24 Correct 34 ms 8652 KB Output is correct
25 Correct 33 ms 8712 KB Output is correct
26 Correct 30 ms 8420 KB Output is correct
27 Correct 32 ms 8500 KB Output is correct
28 Correct 31 ms 8792 KB Output is correct
29 Correct 6 ms 5452 KB Output is correct
30 Correct 6 ms 5972 KB Output is correct
31 Correct 5 ms 5588 KB Output is correct
32 Correct 6 ms 5972 KB Output is correct
33 Correct 6 ms 5948 KB Output is correct
34 Correct 5 ms 5972 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 35 ms 7948 KB Output is correct
37 Correct 33 ms 8404 KB Output is correct
38 Correct 33 ms 8496 KB Output is correct
39 Correct 35 ms 8780 KB Output is correct
40 Correct 35 ms 8780 KB Output is correct
41 Correct 4 ms 5952 KB Output is correct
42 Correct 32 ms 8476 KB Output is correct
43 Correct 36 ms 8768 KB Output is correct
44 Correct 34 ms 8752 KB Output is correct
45 Correct 31 ms 8372 KB Output is correct
46 Correct 34 ms 8908 KB Output is correct
47 Correct 33 ms 8744 KB Output is correct