oj.uz

Submission #483706

# Submission time Handle Problem Language Result Execution time Memory
483706 2021-10-31T21:05:05 Z tredsused70 Mutating DNA (IOI21_dna) C++17
100 / 100
 46 ms 8212 KB 
#include <bits/stdc++.h>
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("avx,avx2")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,avx,avx2")
 
using namespace std;
 
#define accelerator ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define fi first
#define se second
#define pb push_back
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const int nmax=200011,mod=1000000007,inf=2000010000,key=200003;
const ll infll=4000000000000000000;
const ld eps=1e-7;
 
string a,b;
int cntc[nmax][3]={0},mas1[nmax]={0},mas2[nmax]={0},cnt[nmax][3][3]={0};

void cnv(string s,int mas[])
{
    int n=s.size();
    for(int i=0;i<n;i++)
    {
        if(s[i]=='A')
        {
            mas[i+1]=0;
            continue;
        }
        if(s[i]=='T')
            mas[i+1]=1;
        else
            mas[i+1]=2;
    }
    return ;
}
 
void init(string a,string b)
{
    cnv(a,mas1);
    cnv(b,mas2);
    int n=a.size();
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<3;j++)
            cntc[i+1][j]=cntc[i][j];
        cntc[i+1][mas1[i+1]]++;
        cntc[i+1][mas2[i+1]]--;
        for(int j=0;j<3;j++)
            for(int k=0;k<3;k++)
                cnt[i+1][j][k]=cnt[i][j][k];
        cnt[i+1][mas1[i+1]][mas2[i+1]]++;
    }
    return ;
}
 
int count_swaps(int mas[3][3])
{
    int ans=0,t;
    for(int i=0;i<3;i++)
    {
        mas[i][i]=0;
        for(int j=i+1;j<3;j++)
        {
            t=min(mas[i][j],mas[j][i]);
            ans+=t;
            mas[i][j]-=t;
            mas[j][i]-=t;
        }
    }
    t=0;
    for(int i=0;i<3;i++)
        for(int j=0;j<3;j++)
            t+=mas[i][j];
    ans+=2*t/3;
    return ans;
}
 
int get_distance(int l,int r)
{
    r++;
    for(int i=0;i<3;i++)
    {
        if(cntc[l][i]!=cntc[r][i])
            return -1;
    }
    int cntt[3][3];
    for(int i=0;i<3;i++)
        for(int j=0;j<3;j++)
        {
            cntt[i][j]=cnt[r][i][j];
            cntt[i][j]-=cnt[l][i][j];
        }
    return count_swaps(cntt);
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 7592 KB Output is correct
2 Correct 45 ms 7620 KB Output is correct
3 Correct 36 ms 7056 KB Output is correct
4 Correct 34 ms 7628 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 5 ms 6348 KB Output is correct
5 Correct 5 ms 6476 KB Output is correct
6 Correct 5 ms 6348 KB Output is correct
7 Correct 4 ms 5964 KB Output is correct
8 Correct 6 ms 6476 KB Output is correct
9 Correct 5 ms 6476 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 5 ms 6348 KB Output is correct
5 Correct 5 ms 6476 KB Output is correct
6 Correct 5 ms 6348 KB Output is correct
7 Correct 4 ms 5964 KB Output is correct
8 Correct 6 ms 6476 KB Output is correct
9 Correct 5 ms 6476 KB Output is correct
10 Correct 35 ms 7600 KB Output is correct
11 Correct 35 ms 7620 KB Output is correct
12 Correct 33 ms 7592 KB Output is correct
13 Correct 34 ms 7656 KB Output is correct
14 Correct 35 ms 7976 KB Output is correct
15 Correct 43 ms 7960 KB Output is correct
16 Correct 36 ms 7604 KB Output is correct
17 Correct 32 ms 7712 KB Output is correct
18 Correct 32 ms 8020 KB Output is correct
19 Correct 30 ms 7576 KB Output is correct
20 Correct 34 ms 7732 KB Output is correct
21 Correct 31 ms 8040 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 5 ms 6348 KB Output is correct
5 Correct 5 ms 6476 KB Output is correct
6 Correct 5 ms 6348 KB Output is correct
7 Correct 4 ms 5964 KB Output is correct
8 Correct 6 ms 6476 KB Output is correct
9 Correct 5 ms 6476 KB Output is correct
10 Correct 4 ms 5836 KB Output is correct
11 Correct 5 ms 6364 KB Output is correct
12 Correct 5 ms 5964 KB Output is correct
13 Correct 5 ms 6348 KB Output is correct
14 Correct 5 ms 6476 KB Output is correct
15 Correct 5 ms 6376 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 7592 KB Output is correct
2 Correct 45 ms 7620 KB Output is correct
3 Correct 36 ms 7056 KB Output is correct
4 Correct 34 ms 7628 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 5 ms 6348 KB Output is correct
12 Correct 5 ms 6476 KB Output is correct
13 Correct 5 ms 6348 KB Output is correct
14 Correct 4 ms 5964 KB Output is correct
15 Correct 6 ms 6476 KB Output is correct
16 Correct 5 ms 6476 KB Output is correct
17 Correct 35 ms 7600 KB Output is correct
18 Correct 35 ms 7620 KB Output is correct
19 Correct 33 ms 7592 KB Output is correct
20 Correct 34 ms 7656 KB Output is correct
21 Correct 35 ms 7976 KB Output is correct
22 Correct 43 ms 7960 KB Output is correct
23 Correct 36 ms 7604 KB Output is correct
24 Correct 32 ms 7712 KB Output is correct
25 Correct 32 ms 8020 KB Output is correct
26 Correct 30 ms 7576 KB Output is correct
27 Correct 34 ms 7732 KB Output is correct
28 Correct 31 ms 8040 KB Output is correct
29 Correct 4 ms 5836 KB Output is correct
30 Correct 5 ms 6364 KB Output is correct
31 Correct 5 ms 5964 KB Output is correct
32 Correct 5 ms 6348 KB Output is correct
33 Correct 5 ms 6476 KB Output is correct
34 Correct 5 ms 6376 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 33 ms 7228 KB Output is correct
37 Correct 34 ms 7844 KB Output is correct
38 Correct 35 ms 7772 KB Output is correct
39 Correct 34 ms 8092 KB Output is correct
40 Correct 36 ms 8120 KB Output is correct
41 Correct 5 ms 6476 KB Output is correct
42 Correct 31 ms 7704 KB Output is correct
43 Correct 32 ms 8112 KB Output is correct
44 Correct 32 ms 8120 KB Output is correct
45 Correct 34 ms 7820 KB Output is correct
46 Correct 32 ms 8212 KB Output is correct
47 Correct 30 ms 8116 KB Output is correct