oj.uz

Submission #670536

# Submission time Handle Problem Language Result Execution time Memory
670536 2022-12-09T13:49:53 Z Marszpace Mutating DNA (IOI21_dna) C++17
56 / 100
 39 ms 7852 KB 
#include<bits/stdc++.h>
using namespace std;
vector<int> diff;
vector<int> aCountA,bCountA,aCountT,bCountT,aCountC,bCountC;

void init(string a, string b){
    if(a[0]!=b[0]){
        diff.push_back(1);
    }
    else{
        diff.push_back(0);
    }
    for(int i=1;i<a.size();i++){
        if(a[i]!=b[i]){
            diff.push_back(diff[i-1]+1);
        }
        else{
            diff.push_back(diff[i-1]);
        }
    }

    if(a[0]=='A'){
        aCountA.push_back(1);
        aCountT.push_back(0);
        aCountC.push_back(0);
    }
    else if(a[0]=='T'){
        aCountA.push_back(0);
        aCountT.push_back(1);
        aCountC.push_back(0);
    }
    else{
        aCountA.push_back(0);
        aCountT.push_back(0);
        aCountC.push_back(1);
    }
    if(b[0]=='A'){
        bCountA.push_back(1);
        bCountT.push_back(0);
        bCountC.push_back(0);
    }
    else if(b[0]=='T'){
        bCountA.push_back(0);
        bCountT.push_back(1);
        bCountC.push_back(0);
    }
    else{
        bCountA.push_back(0);
        bCountT.push_back(0);
        bCountC.push_back(1);
    }
    for(int i=1;i<a.size();i++){
        if(a[i]=='A'){
            aCountA.push_back(aCountA[i-1]+1);
            aCountT.push_back(aCountT[i-1]);
            aCountC.push_back(aCountC[i-1]);
        }
        else if(a[i]=='T'){
            aCountA.push_back(aCountA[i-1]);
            aCountT.push_back(aCountT[i-1]+1);
            aCountC.push_back(aCountC[i-1]);
        }
        else{
            aCountA.push_back(aCountA[i-1]);
            aCountT.push_back(aCountT[i-1]);
            aCountC.push_back(aCountC[i-1]+1);
        }
        if(b[i]=='A'){
            bCountA.push_back(bCountA[i-1]+1);
            bCountT.push_back(bCountT[i-1]);
            bCountC.push_back(bCountC[i-1]);
        }
        else if(b[i]=='T'){
            bCountA.push_back(bCountA[i-1]);
            bCountT.push_back(bCountT[i-1]+1);
            bCountC.push_back(bCountC[i-1]);
        }
        else{
            bCountA.push_back(bCountA[i-1]);
            bCountT.push_back(bCountT[i-1]);
            bCountC.push_back(bCountC[i-1]+1);
        }
    }
}

int get_distance(int x, int y){
    x--;
    bool condA = (aCountA[y]-aCountA[x])==(bCountA[y]-bCountA[x]);
    bool condT = (aCountT[y]-aCountT[x])==(bCountT[y]-bCountT[x]);
    bool condC = (aCountC[y]-aCountC[x])==(bCountC[y]-bCountC[x]);
    //cout << endl << aCountA[y] << aCountA[x] << endl;
    if(!condA||!condT||!condT){
        return -1;
    }
    int res=diff[y]-diff[x];
    return (res+1)/2;
}


// int main(){
//     init("ATACAT", "ACTATA");
//     cout << get_distance(1, 3) << " " << get_distance(4, 5) << " " << get_distance(3, 5);
// }

Compilation message

dna.cpp: In function 'void init(std::string, std::string)':
dna.cpp:13:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 |     for(int i=1;i<a.size();i++){
      |                 ~^~~~~~~~~
dna.cpp:52:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |     for(int i=1;i<a.size();i++){
      |                 ~^~~~~~~~~
dna.cpp: In function 'int get_distance(int, int)':
dna.cpp:90:10: warning: unused variable 'condC' [-Wunused-variable]
   90 |     bool condC = (aCountC[y]-aCountC[x])==(bCountC[y]-bCountC[x]);
      |          ^~~~~

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 7484 KB Output is correct
2 Correct 39 ms 7472 KB Output is correct
3 Correct 34 ms 7216 KB Output is correct
4 Correct 34 ms 7464 KB Output is correct
5 Correct 0 ms 300 KB Output is correct
6 Correct 1 ms 296 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 304 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 8 ms 4940 KB Output is correct
5 Correct 6 ms 5036 KB Output is correct
6 Correct 6 ms 4940 KB Output is correct
7 Correct 6 ms 4732 KB Output is correct
8 Correct 6 ms 5036 KB Output is correct
9 Correct 5 ms 4940 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 8 ms 4940 KB Output is correct
5 Correct 6 ms 5036 KB Output is correct
6 Correct 6 ms 4940 KB Output is correct
7 Correct 6 ms 4732 KB Output is correct
8 Correct 6 ms 5036 KB Output is correct
9 Correct 5 ms 4940 KB Output is correct
10 Correct 33 ms 7464 KB Output is correct
11 Correct 35 ms 7452 KB Output is correct
12 Correct 35 ms 7548 KB Output is correct
13 Correct 33 ms 7688 KB Output is correct
14 Correct 34 ms 7852 KB Output is correct
15 Correct 31 ms 7748 KB Output is correct
16 Correct 32 ms 7624 KB Output is correct
17 Correct 32 ms 7656 KB Output is correct
18 Correct 31 ms 7716 KB Output is correct
19 Correct 29 ms 7620 KB Output is correct
20 Correct 31 ms 7708 KB Output is correct
21 Correct 31 ms 7748 KB Output is correct

Subtask #4
0.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 8 ms 4940 KB Output is correct
5 Correct 6 ms 5036 KB Output is correct
6 Correct 6 ms 4940 KB Output is correct
7 Correct 6 ms 4732 KB Output is correct
8 Correct 6 ms 5036 KB Output is correct
9 Correct 5 ms 4940 KB Output is correct
10 Correct 6 ms 4740 KB Output is correct
11 Correct 7 ms 4940 KB Output is correct
12 Incorrect 6 ms 4784 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #5
0.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 7484 KB Output is correct
2 Correct 39 ms 7472 KB Output is correct
3 Correct 34 ms 7216 KB Output is correct
4 Correct 34 ms 7464 KB Output is correct
5 Correct 0 ms 300 KB Output is correct
6 Correct 1 ms 296 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 304 KB Output is correct
9 Correct 1 ms 296 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 8 ms 4940 KB Output is correct
12 Correct 6 ms 5036 KB Output is correct
13 Correct 6 ms 4940 KB Output is correct
14 Correct 6 ms 4732 KB Output is correct
15 Correct 6 ms 5036 KB Output is correct
16 Correct 5 ms 4940 KB Output is correct
17 Correct 33 ms 7464 KB Output is correct
18 Correct 35 ms 7452 KB Output is correct
19 Correct 35 ms 7548 KB Output is correct
20 Correct 33 ms 7688 KB Output is correct
21 Correct 34 ms 7852 KB Output is correct
22 Correct 31 ms 7748 KB Output is correct
23 Correct 32 ms 7624 KB Output is correct
24 Correct 32 ms 7656 KB Output is correct
25 Correct 31 ms 7716 KB Output is correct
26 Correct 29 ms 7620 KB Output is correct
27 Correct 31 ms 7708 KB Output is correct
28 Correct 31 ms 7748 KB Output is correct
29 Correct 6 ms 4740 KB Output is correct
30 Correct 7 ms 4940 KB Output is correct
31 Incorrect 6 ms 4784 KB Output isn't correct
32 Halted 0 ms 0 KB -