oj.uz

Submission #658955

# Submission time Handle Problem Language Result Execution time Memory
658955 2022-11-15T15:09:59 Z Banan Mutating DNA (IOI21_dna) C++17
100 / 100
 49 ms 7372 KB 
#include "dna.h"
#include <bits/stdc++.h>
using ll = long long;
#define double long double
#define endl '\n'
#define sz(a) (int)a.size()
#define pb push_back
#define fs first
#define sc second
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;

int n;
vector<int> cna(100005, 0), cnt(100005, 0), cnc(100005, 0);
vector<int> ac(100005, 0), att(100005, 0), ta(100005, 0), tc(100005, 0), ca(100005, 0), ct(100005, 0);

void init(std::string a, std::string b) {

    n=sz(a);
    for(int i=0;i<n;i++)
    {
        if(a[i]=='A'){cna[i]=cna[i-1]+1;}else{cna[i]=cna[i-1];}
        if(b[i]=='A'){cna[i]--;}

        if(a[i]=='T'){cnt[i]=cnt[i-1]+1;}else{cnt[i]=cnt[i-1];}
        if(b[i]=='T'){cnt[i]--;}

        if(a[i]=='C'){cnc[i]=cnc[i-1]+1;}else{cnc[i]=cnc[i-1];}
        if(b[i]=='C'){cnc[i]--;}

        if(a[i]=='A' && b[i]=='C'){ac[i]=ac[i-1]+1;}else{ac[i]=ac[i-1];}
        if(a[i]=='A' && b[i]=='T'){att[i]=att[i-1]+1;}else{att[i]=att[i-1];}

        if(a[i]=='T' && b[i]=='A'){ta[i]=ta[i-1]+1;}else{ta[i]=ta[i-1];}
        if(a[i]=='T' && b[i]=='C'){tc[i]=tc[i-1]+1;}else{tc[i]=tc[i-1];}

        if(a[i]=='C' && b[i]=='A'){ca[i]=ca[i-1]+1;}else{ca[i]=ca[i-1];}
        if(a[i]=='C' && b[i]=='T'){ct[i]=ct[i-1]+1;}else{ct[i]=ct[i-1];}
    }
}

int get_distance(int x, int y) {
    int ans=0;
    if(x==0)
    {
        if(cna[y]!=0 || cnt[y]!=0 || cnc[y]!=0){return -1;}
        if(cna[y]-cna[x-1]!=0 || cnt[y]-cnt[x-1]!=0 || cnc[y]-cnc[x-1]!=0){return -1;}
        ans+=min(ca[y], ac[y]);
        ans+=min(ta[y], att[y]);
        ans+=min(tc[y], ct[y]);
        vector<int> v(3);
        v[0]=max(ca[y], ac[y])-min(ca[y], ac[y]);
        v[1]=max(ta[y], att[y])-min(ta[y], att[y]);
        v[2]=max(tc[y], ct[y])-min(tc[y], ct[y]);
        sort(all(v));
        ans+=v[0]+v[1];
    }
    else
    {
        if(cna[y]-cna[x-1]!=0 || cnt[y]-cnt[x-1]!=0 || cnc[y]-cnc[x-1]!=0){return -1;}
        ans+=min(ca[y]-ca[x-1], ac[y]-ac[x-1]);
        ans+=min(ta[y]-ta[x-1], att[y]-att[x-1]);
        ans+=min(tc[y]-tc[x-1], ct[y]-ct[x-1]);
        vector<int> v(3);
        v[0]=max(ca[y]-ca[x-1], ac[y]-ac[x-1])-min(ca[y]-ca[x-1], ac[y]-ac[x-1]);
        v[1]=max(ta[y]-ta[x-1], att[y]-att[x-1])-min(ta[y]-ta[x-1], att[y]-att[x-1]);
        v[2]=max(tc[y]-tc[x-1], ct[y]-ct[x-1])-min(tc[y]-tc[x-1], ct[y]-ct[x-1]);
        sort(all(v));
        ans+=v[0]+v[1];
    }
    return ans;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 6988 KB Output is correct
2 Correct 41 ms 6960 KB Output is correct
3 Correct 40 ms 6992 KB Output is correct
4 Correct 38 ms 6968 KB Output is correct
5 Correct 2 ms 3840 KB Output is correct
6 Correct 2 ms 3796 KB Output is correct
7 Correct 3 ms 3796 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3848 KB Output is correct
2 Correct 2 ms 3844 KB Output is correct
3 Correct 2 ms 3796 KB Output is correct
4 Correct 9 ms 4564 KB Output is correct
5 Correct 8 ms 4564 KB Output is correct
6 Correct 9 ms 4564 KB Output is correct
7 Correct 8 ms 4560 KB Output is correct
8 Correct 8 ms 4532 KB Output is correct
9 Correct 7 ms 4564 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3848 KB Output is correct
2 Correct 2 ms 3844 KB Output is correct
3 Correct 2 ms 3796 KB Output is correct
4 Correct 9 ms 4564 KB Output is correct
5 Correct 8 ms 4564 KB Output is correct
6 Correct 9 ms 4564 KB Output is correct
7 Correct 8 ms 4560 KB Output is correct
8 Correct 8 ms 4532 KB Output is correct
9 Correct 7 ms 4564 KB Output is correct
10 Correct 39 ms 6968 KB Output is correct
11 Correct 43 ms 7000 KB Output is correct
12 Correct 40 ms 7320 KB Output is correct
13 Correct 49 ms 7352 KB Output is correct
14 Correct 38 ms 7364 KB Output is correct
15 Correct 39 ms 7252 KB Output is correct
16 Correct 37 ms 7276 KB Output is correct
17 Correct 39 ms 7292 KB Output is correct
18 Correct 38 ms 7264 KB Output is correct
19 Correct 36 ms 7248 KB Output is correct
20 Correct 35 ms 7252 KB Output is correct
21 Correct 34 ms 7372 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3848 KB Output is correct
2 Correct 2 ms 3844 KB Output is correct
3 Correct 2 ms 3796 KB Output is correct
4 Correct 9 ms 4564 KB Output is correct
5 Correct 8 ms 4564 KB Output is correct
6 Correct 9 ms 4564 KB Output is correct
7 Correct 8 ms 4560 KB Output is correct
8 Correct 8 ms 4532 KB Output is correct
9 Correct 7 ms 4564 KB Output is correct
10 Correct 8 ms 4564 KB Output is correct
11 Correct 11 ms 4568 KB Output is correct
12 Correct 8 ms 4564 KB Output is correct
13 Correct 7 ms 4564 KB Output is correct
14 Correct 7 ms 4564 KB Output is correct
15 Correct 8 ms 4632 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 6988 KB Output is correct
2 Correct 41 ms 6960 KB Output is correct
3 Correct 40 ms 6992 KB Output is correct
4 Correct 38 ms 6968 KB Output is correct
5 Correct 2 ms 3840 KB Output is correct
6 Correct 2 ms 3796 KB Output is correct
7 Correct 3 ms 3796 KB Output is correct
8 Correct 2 ms 3848 KB Output is correct
9 Correct 2 ms 3844 KB Output is correct
10 Correct 2 ms 3796 KB Output is correct
11 Correct 9 ms 4564 KB Output is correct
12 Correct 8 ms 4564 KB Output is correct
13 Correct 9 ms 4564 KB Output is correct
14 Correct 8 ms 4560 KB Output is correct
15 Correct 8 ms 4532 KB Output is correct
16 Correct 7 ms 4564 KB Output is correct
17 Correct 39 ms 6968 KB Output is correct
18 Correct 43 ms 7000 KB Output is correct
19 Correct 40 ms 7320 KB Output is correct
20 Correct 49 ms 7352 KB Output is correct
21 Correct 38 ms 7364 KB Output is correct
22 Correct 39 ms 7252 KB Output is correct
23 Correct 37 ms 7276 KB Output is correct
24 Correct 39 ms 7292 KB Output is correct
25 Correct 38 ms 7264 KB Output is correct
26 Correct 36 ms 7248 KB Output is correct
27 Correct 35 ms 7252 KB Output is correct
28 Correct 34 ms 7372 KB Output is correct
29 Correct 8 ms 4564 KB Output is correct
30 Correct 11 ms 4568 KB Output is correct
31 Correct 8 ms 4564 KB Output is correct
32 Correct 7 ms 4564 KB Output is correct
33 Correct 7 ms 4564 KB Output is correct
34 Correct 8 ms 4632 KB Output is correct
35 Correct 2 ms 3796 KB Output is correct
36 Correct 39 ms 7004 KB Output is correct
37 Correct 41 ms 7048 KB Output is correct
38 Correct 41 ms 7348 KB Output is correct
39 Correct 40 ms 7360 KB Output is correct
40 Correct 44 ms 7364 KB Output is correct
41 Correct 8 ms 4564 KB Output is correct
42 Correct 39 ms 7284 KB Output is correct
43 Correct 40 ms 7268 KB Output is correct
44 Correct 38 ms 7240 KB Output is correct
45 Correct 36 ms 7208 KB Output is correct
46 Correct 38 ms 7360 KB Output is correct
47 Correct 36 ms 7336 KB Output is correct