oj.uz

Submission #485648

# Submission time Handle Problem Language Result Execution time Memory
485648 2021-11-08T19:18:31 Z niloyroot Mutating DNA (IOI21_dna) C++17
100 / 100
 65 ms 14348 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<ll>;
using pl = pair<ll,ll>;
#define pb push_back
#define form(m,it) for(auto it=m.begin(); it!=m.end(); it++)
#define forp(i,a,b) for(ll i=a; i<=b; i++)
#define forn(i,a,b) for(ll i=a; i>=b; i--)
#define newl '\n'
ll cnt[3][3][100005];
ll seq[2][3][100005];

void init(string a, string b){
    ll n=a.length();

    forp(i,0,n-1){
        a[i]=(a[i]=='T')?'B':a[i];
        b[i]=(b[i]=='T')?'B':b[i];
    }

    forp(i,1,n){
        forp(i1,0,2){
            forp(i2,0,2){
                if(a[i-1]==(char)(i1+'A')&&b[i-1]==(char)(i2+'A')){
                    cnt[i1][i2][i]=cnt[i1][i2][i-1]+1;
                } else {
                    cnt[i1][i2][i]=cnt[i1][i2][i-1];
                }
                //cout<<(char)(i1+'A')<<" "<<(char)(i2+'A')<<" "<<i<<" "<<cnt[i1][i2][i]<<newl;
            }
        }
        forp(j,0,2){
            if(a[i-1]==(char)(j+'A')){
                seq[0][j][i]=seq[0][j][i-1]+1;
            } else {
                seq[0][j][i]=seq[0][j][i-1];
            }
            if(b[i-1]==(char)(j+'A')){
                seq[1][j][i]=seq[1][j][i-1]+1;
            } else {
                seq[1][j][i]=seq[1][j][i-1];
            }
        }
    }
}

int get_distance(int x, int y){
    x++; y++;
    forp(j,0,2){
        if(seq[0][j][y]-seq[0][j][x-1]!=seq[1][j][y]-seq[1][j][x-1]){
            return -1;
        }
    }

    ll c=0;
    ll ans=0;
    forp(i,0,2){
        forp(j,i+1,2){
            ans+=min((cnt[j][i][y]-cnt[j][i][x-1]),(cnt[i][j][y]-cnt[i][j][x-1]));
            c+=2*min((cnt[j][i][y]-cnt[j][i][x-1]),(cnt[i][j][y]-cnt[i][j][x-1]));
        }
        c+=(cnt[i][i][y]-cnt[i][i][x-1]);
    }

    ans+=2*((y-x+1-c)/3);
    return ans;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 13828 KB Output is correct
2 Correct 43 ms 13968 KB Output is correct
3 Correct 42 ms 12948 KB Output is correct
4 Correct 43 ms 13948 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 7 ms 12568 KB Output is correct
5 Correct 8 ms 12644 KB Output is correct
6 Correct 8 ms 12620 KB Output is correct
7 Correct 7 ms 11852 KB Output is correct
8 Correct 8 ms 12688 KB Output is correct
9 Correct 7 ms 12680 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 7 ms 12568 KB Output is correct
5 Correct 8 ms 12644 KB Output is correct
6 Correct 8 ms 12620 KB Output is correct
7 Correct 7 ms 11852 KB Output is correct
8 Correct 8 ms 12688 KB Output is correct
9 Correct 7 ms 12680 KB Output is correct
10 Correct 47 ms 13888 KB Output is correct
11 Correct 45 ms 13944 KB Output is correct
12 Correct 65 ms 13584 KB Output is correct
13 Correct 52 ms 13876 KB Output is correct
14 Correct 48 ms 14292 KB Output is correct
15 Correct 54 ms 14228 KB Output is correct
16 Correct 39 ms 13584 KB Output is correct
17 Correct 42 ms 13912 KB Output is correct
18 Correct 44 ms 14348 KB Output is correct
19 Correct 31 ms 13584 KB Output is correct
20 Correct 31 ms 13964 KB Output is correct
21 Correct 35 ms 14336 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 7 ms 12568 KB Output is correct
5 Correct 8 ms 12644 KB Output is correct
6 Correct 8 ms 12620 KB Output is correct
7 Correct 7 ms 11852 KB Output is correct
8 Correct 8 ms 12688 KB Output is correct
9 Correct 7 ms 12680 KB Output is correct
10 Correct 9 ms 11688 KB Output is correct
11 Correct 8 ms 12680 KB Output is correct
12 Correct 7 ms 11980 KB Output is correct
13 Correct 10 ms 12620 KB Output is correct
14 Correct 9 ms 12700 KB Output is correct
15 Correct 8 ms 12704 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 13828 KB Output is correct
2 Correct 43 ms 13968 KB Output is correct
3 Correct 42 ms 12948 KB Output is correct
4 Correct 43 ms 13948 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 7 ms 12568 KB Output is correct
12 Correct 8 ms 12644 KB Output is correct
13 Correct 8 ms 12620 KB Output is correct
14 Correct 7 ms 11852 KB Output is correct
15 Correct 8 ms 12688 KB Output is correct
16 Correct 7 ms 12680 KB Output is correct
17 Correct 47 ms 13888 KB Output is correct
18 Correct 45 ms 13944 KB Output is correct
19 Correct 65 ms 13584 KB Output is correct
20 Correct 52 ms 13876 KB Output is correct
21 Correct 48 ms 14292 KB Output is correct
22 Correct 54 ms 14228 KB Output is correct
23 Correct 39 ms 13584 KB Output is correct
24 Correct 42 ms 13912 KB Output is correct
25 Correct 44 ms 14348 KB Output is correct
26 Correct 31 ms 13584 KB Output is correct
27 Correct 31 ms 13964 KB Output is correct
28 Correct 35 ms 14336 KB Output is correct
29 Correct 9 ms 11688 KB Output is correct
30 Correct 8 ms 12680 KB Output is correct
31 Correct 7 ms 11980 KB Output is correct
32 Correct 10 ms 12620 KB Output is correct
33 Correct 9 ms 12700 KB Output is correct
34 Correct 8 ms 12704 KB Output is correct
35 Correct 0 ms 332 KB Output is correct
36 Correct 41 ms 12980 KB Output is correct
37 Correct 47 ms 14012 KB Output is correct
38 Correct 49 ms 13688 KB Output is correct
39 Correct 50 ms 14324 KB Output is correct
40 Correct 51 ms 14308 KB Output is correct
41 Correct 7 ms 12680 KB Output is correct
42 Correct 41 ms 13640 KB Output is correct
43 Correct 40 ms 14308 KB Output is correct
44 Correct 50 ms 14332 KB Output is correct
45 Correct 32 ms 13688 KB Output is correct
46 Correct 33 ms 14336 KB Output is correct
47 Correct 32 ms 14344 KB Output is correct