oj.uz

Submission #819914

# Submission time Handle Problem Language Result Execution time Memory
819914 2023-08-10T15:25:52 Z Marco_Escandon Mutating DNA (IOI21_dna) C++17
100 / 100
 32 ms 8760 KB 
#include<bits/stdc++.h>
using namespace std;
#define optimizar_io ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);cout.setf(ios::fixed);cout.precision(0);
#pragma GCC optimize("Ofast")
typedef long long ll;
ll AT[100002]={ },AC[100002]={ },TC[100002]={ };
ll TA[100002]={ },CA[100002]={ },CT[100002]={ };
ll n;
void init(string a, string b)
{
    n=a.size();
    for(int i=0; i<n; i++)
    {
        if(a[i]=='A'&&b[i]=='T')AT[i+1]=1;
        if(a[i]=='A'&&b[i]=='C')AC[i+1]=1;
        if(a[i]=='T'&&b[i]=='C')TC[i+1]=1;
        if(a[i]=='T'&&b[i]=='A')TA[i+1]=1;
        if(a[i]=='C'&&b[i]=='A')CA[i+1]=1;
        if(a[i]=='C'&&b[i]=='T')CT[i+1]=1;
        if(i>0)
        {
            AT[i+1]+=AT[i];
            AC[i+1]+=AC[i];
            TC[i+1]+=TC[i];
            TA[i+1]+=TA[i];
            CA[i+1]+=CA[i];
            CT[i+1]+=CT[i];
        }
    }
}
int get_distance(int x,int y)
{
    x++;
    y++;
    ll AT1=AT[y]-AT[x-1], TA1=TA[y]-TA[x-1], CT1=CT[y]-CT[x-1];
    ll AC1=AC[y]-AC[x-1], TC1=TC[y]-TC[x-1], CA1=CA[y]-CA[x-1];
    ll a1=AT1+AC1, t1=TC1+TA1 ,c1=CA1+CT1;
    ll a2=TA1+CA1, t2=AT1+CT1 ,c2=AC1+TC1;
    //cout<<a1<<a2<<" "<<t1<<t2<<" "<<c1<<c2;
    if(a1!=a2||t1!=t2||c1!=c2)return -1;
    else
    {
        return min(AT1,TA1)+min(AC1,CA1)+min(CT1,TC1)+(max(AT1,TA1)-min(AT1,TA1))*2;
    }
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 8072 KB Output is correct
2 Correct 26 ms 8176 KB Output is correct
3 Correct 27 ms 7664 KB Output is correct
4 Correct 27 ms 8140 KB Output is correct
5 Correct 0 ms 304 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 308 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 4 ms 5716 KB Output is correct
5 Correct 4 ms 5692 KB Output is correct
6 Correct 4 ms 5724 KB Output is correct
7 Correct 3 ms 5332 KB Output is correct
8 Correct 4 ms 5700 KB Output is correct
9 Correct 3 ms 5696 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 4 ms 5716 KB Output is correct
5 Correct 4 ms 5692 KB Output is correct
6 Correct 4 ms 5724 KB Output is correct
7 Correct 3 ms 5332 KB Output is correct
8 Correct 4 ms 5700 KB Output is correct
9 Correct 3 ms 5696 KB Output is correct
10 Correct 26 ms 8072 KB Output is correct
11 Correct 27 ms 8184 KB Output is correct
12 Correct 27 ms 8116 KB Output is correct
13 Correct 27 ms 8244 KB Output is correct
14 Correct 27 ms 8564 KB Output is correct
15 Correct 27 ms 8440 KB Output is correct
16 Correct 29 ms 8212 KB Output is correct
17 Correct 28 ms 8256 KB Output is correct
18 Correct 27 ms 8468 KB Output is correct
19 Correct 25 ms 8040 KB Output is correct
20 Correct 26 ms 8308 KB Output is correct
21 Correct 26 ms 8496 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 4 ms 5716 KB Output is correct
5 Correct 4 ms 5692 KB Output is correct
6 Correct 4 ms 5724 KB Output is correct
7 Correct 3 ms 5332 KB Output is correct
8 Correct 4 ms 5700 KB Output is correct
9 Correct 3 ms 5696 KB Output is correct
10 Correct 4 ms 5204 KB Output is correct
11 Correct 4 ms 5716 KB Output is correct
12 Correct 4 ms 5332 KB Output is correct
13 Correct 4 ms 5716 KB Output is correct
14 Correct 5 ms 5728 KB Output is correct
15 Correct 3 ms 5704 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 8072 KB Output is correct
2 Correct 26 ms 8176 KB Output is correct
3 Correct 27 ms 7664 KB Output is correct
4 Correct 27 ms 8140 KB Output is correct
5 Correct 0 ms 304 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 308 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 4 ms 5716 KB Output is correct
12 Correct 4 ms 5692 KB Output is correct
13 Correct 4 ms 5724 KB Output is correct
14 Correct 3 ms 5332 KB Output is correct
15 Correct 4 ms 5700 KB Output is correct
16 Correct 3 ms 5696 KB Output is correct
17 Correct 26 ms 8072 KB Output is correct
18 Correct 27 ms 8184 KB Output is correct
19 Correct 27 ms 8116 KB Output is correct
20 Correct 27 ms 8244 KB Output is correct
21 Correct 27 ms 8564 KB Output is correct
22 Correct 27 ms 8440 KB Output is correct
23 Correct 29 ms 8212 KB Output is correct
24 Correct 28 ms 8256 KB Output is correct
25 Correct 27 ms 8468 KB Output is correct
26 Correct 25 ms 8040 KB Output is correct
27 Correct 26 ms 8308 KB Output is correct
28 Correct 26 ms 8496 KB Output is correct
29 Correct 4 ms 5204 KB Output is correct
30 Correct 4 ms 5716 KB Output is correct
31 Correct 4 ms 5332 KB Output is correct
32 Correct 4 ms 5716 KB Output is correct
33 Correct 5 ms 5728 KB Output is correct
34 Correct 3 ms 5704 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 27 ms 7756 KB Output is correct
37 Correct 28 ms 8216 KB Output is correct
38 Correct 30 ms 8212 KB Output is correct
39 Correct 27 ms 8568 KB Output is correct
40 Correct 30 ms 8760 KB Output is correct
41 Correct 3 ms 5716 KB Output is correct
42 Correct 32 ms 8132 KB Output is correct
43 Correct 27 ms 8444 KB Output is correct
44 Correct 27 ms 8440 KB Output is correct
45 Correct 26 ms 8172 KB Output is correct
46 Correct 26 ms 8456 KB Output is correct
47 Correct 28 ms 8548 KB Output is correct