oj.uz

Submission #550741

# Submission time Handle Problem Language Result Execution time Memory
550741 2022-04-19T01:20:36 Z perchuts Mutating DNA (IOI21_dna) C++17
100 / 100
 47 ms 8880 KB 
#include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define sz(x) (int) x.size()
#define endl '\n'
#define pb push_back
#define _ ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ii = pair<int,int>;
using iii = tuple<int,int,int>;

const int inf = 2e9+1;
const int mod = 1e9+7;
const int maxn = 1e5+100;

template<typename X, typename Y> bool ckmin(X& x, const Y& y) { return (y < x) ? (x=y,1):0; }
template<typename X, typename Y> bool ckmax(X& x, const Y& y) { return (x < y) ? (x=y,1):0; }

string a,b;
int pref[maxn][3][2], pr[maxn][3][2], n;
map<char,int>t;

ii getType(int i){
    if(a[i]=='A'&&b[i]=='C')return {0,0};
    if(a[i]=='A'&&b[i]=='T')return {1,0};
    if(a[i]=='C'&&b[i]=='T')return {2,0};
    if(a[i]=='C'&&b[i]=='A')return {0,1};
    if(a[i]=='T'&&b[i]=='A')return {1,1};
    if(a[i]=='T'&&b[i]=='C')return {2,1};
    return {-1,-1};
}

void init(string s1,string s2){
    a = s1, b = s2;
    n = sz(a);
    t['A'] = 0, t['C'] = 1, t['T'] = 2;
    pref[0][t[a[0]]][0] = pref[0][t[b[0]]][1] = 1;
    ii cur = getType(0);
    if(cur.first!=-1)pr[0][cur.first][cur.second]++;
    for(int i=1;i<n;++i){
        for(int j=0;j<3;++j)pref[i][j][0] = pref[i-1][j][0], pref[i][j][1] = pref[i-1][j][1];
        pref[i][t[a[i]]][0]++, pref[i][t[b[i]]][1]++;
        for(int j=0;j<3;++j)pr[i][j][0] = pr[i-1][j][0], pr[i][j][1] = pr[i-1][j][1];
        cur = getType(i);
        if(cur.first!=-1)pr[i][cur.first][cur.second]++;
    }
}

int getqnt(int l,int r,int x,int y){return pref[r][x][y] - (l==0?0:pref[l-1][x][y]);}

int getqnt2(int l,int r,int x,int y){return pr[r][x][y] - (l==0?0:pr[l-1][x][y]);}

int get_distance(int l,int r){
    if(!(getqnt(l,r,0,0)==getqnt(l,r,0,1)&&getqnt(l,r,1,0)==getqnt(l,r,1,1)))return -1;
    int ac = getqnt2(l,r,0,0), at = getqnt2(l,r,1,0), ct = getqnt2(l,r,2,0),
    ca = getqnt2(l,r,0,1), ta = getqnt2(l,r,1,1), tc = getqnt2(l,r,2,1);
    int resp = min(ac,ca) + min(at,ta) + min(tc,ct) + 2*(max(ac,ca) - min(ac,ca));
    return resp;
}

// int main(){
//     int sd,q;cin>>sd>>q;
//     string a,b;cin>>a>>b;
//     init(a,b);
//     while(q--){
//         int l,r;cin>>l>>r;
//         cout<<get_distance(l,r)<<endl;
//     }
// }

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 8372 KB Output is correct
2 Correct 36 ms 8440 KB Output is correct
3 Correct 35 ms 7916 KB Output is correct
4 Correct 36 ms 8396 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 1 ms 304 KB Output is correct
7 Correct 1 ms 304 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 6 ms 5824 KB Output is correct
5 Correct 6 ms 5952 KB Output is correct
6 Correct 7 ms 5844 KB Output is correct
7 Correct 6 ms 5588 KB Output is correct
8 Correct 6 ms 5972 KB Output is correct
9 Correct 7 ms 5968 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 6 ms 5824 KB Output is correct
5 Correct 6 ms 5952 KB Output is correct
6 Correct 7 ms 5844 KB Output is correct
7 Correct 6 ms 5588 KB Output is correct
8 Correct 6 ms 5972 KB Output is correct
9 Correct 7 ms 5968 KB Output is correct
10 Correct 35 ms 8324 KB Output is correct
11 Correct 35 ms 8436 KB Output is correct
12 Correct 38 ms 8364 KB Output is correct
13 Correct 41 ms 8652 KB Output is correct
14 Correct 35 ms 8764 KB Output is correct
15 Correct 34 ms 8688 KB Output is correct
16 Correct 44 ms 8264 KB Output is correct
17 Correct 44 ms 8472 KB Output is correct
18 Correct 34 ms 8756 KB Output is correct
19 Correct 31 ms 8268 KB Output is correct
20 Correct 34 ms 8464 KB Output is correct
21 Correct 41 ms 8792 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 6 ms 5824 KB Output is correct
5 Correct 6 ms 5952 KB Output is correct
6 Correct 7 ms 5844 KB Output is correct
7 Correct 6 ms 5588 KB Output is correct
8 Correct 6 ms 5972 KB Output is correct
9 Correct 7 ms 5968 KB Output is correct
10 Correct 6 ms 5460 KB Output is correct
11 Correct 7 ms 5988 KB Output is correct
12 Correct 6 ms 5588 KB Output is correct
13 Correct 7 ms 5844 KB Output is correct
14 Correct 8 ms 5924 KB Output is correct
15 Correct 7 ms 5924 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 8372 KB Output is correct
2 Correct 36 ms 8440 KB Output is correct
3 Correct 35 ms 7916 KB Output is correct
4 Correct 36 ms 8396 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 1 ms 304 KB Output is correct
7 Correct 1 ms 304 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 6 ms 5824 KB Output is correct
12 Correct 6 ms 5952 KB Output is correct
13 Correct 7 ms 5844 KB Output is correct
14 Correct 6 ms 5588 KB Output is correct
15 Correct 6 ms 5972 KB Output is correct
16 Correct 7 ms 5968 KB Output is correct
17 Correct 35 ms 8324 KB Output is correct
18 Correct 35 ms 8436 KB Output is correct
19 Correct 38 ms 8364 KB Output is correct
20 Correct 41 ms 8652 KB Output is correct
21 Correct 35 ms 8764 KB Output is correct
22 Correct 34 ms 8688 KB Output is correct
23 Correct 44 ms 8264 KB Output is correct
24 Correct 44 ms 8472 KB Output is correct
25 Correct 34 ms 8756 KB Output is correct
26 Correct 31 ms 8268 KB Output is correct
27 Correct 34 ms 8464 KB Output is correct
28 Correct 41 ms 8792 KB Output is correct
29 Correct 6 ms 5460 KB Output is correct
30 Correct 7 ms 5988 KB Output is correct
31 Correct 6 ms 5588 KB Output is correct
32 Correct 7 ms 5844 KB Output is correct
33 Correct 8 ms 5924 KB Output is correct
34 Correct 7 ms 5924 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 47 ms 7912 KB Output is correct
37 Correct 35 ms 8380 KB Output is correct
38 Correct 39 ms 8488 KB Output is correct
39 Correct 37 ms 8796 KB Output is correct
40 Correct 41 ms 8880 KB Output is correct
41 Correct 7 ms 5952 KB Output is correct
42 Correct 36 ms 8344 KB Output is correct
43 Correct 37 ms 8764 KB Output is correct
44 Correct 45 ms 8752 KB Output is correct
45 Correct 43 ms 8440 KB Output is correct
46 Correct 35 ms 8776 KB Output is correct
47 Correct 36 ms 8764 KB Output is correct