Submission #481055

# Submission time Handle Problem Language Result Execution time Memory
481055 2021-10-19T11:15:16 Z MasterTaster Mutating DNA (IOI21_dna) C++17
100 / 100
54 ms 8548 KB
#include "dna.h"
#include <bits/stdc++.h>

#define ll long long
#define pb push_back
#define pii pair<int, int>
#define xx first
#define yy second

using namespace std;

///A -> x
///T -> y
///C -> z

int n, ax[100010], ay[100010], az[100010], bx[100010], by[100010], bz[100010], xy[100010], xz[100010], yx[100010], yz[100010], zx[100010], zy[100010];

void init(std::string a, std::string b) {
    n=a.size();
    a='J'+a; b='J'+b;
    for (int i=1; i<=n; i++)
    {
        if (i!=1) { ax[i]=ax[i-1]; ay[i]=ay[i-1]; az[i]=az[i-1]; }
        if (a[i]=='A') ax[i]++; else if (a[i]=='T') { ay[i]++; } else az[i]++;
    }
    for (int i=1; i<=n; i++)
    {
        if (i!=1) { bx[i]=bx[i-1]; by[i]=by[i-1]; bz[i]=bz[i-1]; }
        if (b[i]=='A') bx[i]++; else if (b[i]=='T') { by[i]++; } else bz[i]++;
    }

    for (int i=1; i<=n; i++)
    {
        if (i!=1) { xy[i]=xy[i-1]; xz[i]=xz[i-1]; yx[i]=yx[i-1]; yz[i]=yz[i-1]; zx[i]=zx[i-1]; zy[i]=zy[i-1]; }
        if (a[i]=='A' && b[i]=='T') xy[i]++;
        if (a[i]=='A' && b[i]=='C') xz[i]++;
        if (a[i]=='T' && b[i]=='A') yx[i]++;
        if (a[i]=='T' && b[i]=='C') yz[i]++;
        if (a[i]=='C' && b[i]=='A') zx[i]++;
        if (a[i]=='C' && b[i]=='T') zy[i]++;
    }


}

int get_distance(int l, int r) {
    ll ress=0;
    int kolko1=0, kolko2=0, kolkoxy=0, kolkoxz=0, kolkoyx=0, kolkoyz=0, kolkozx=0, kolkozy=0;
    l++; r++;

    kolko1=ax[r]-ax[l-1];
    kolko2=bx[r]-bx[l-1];
    if (kolko1!=kolko2) return -1;

    kolko1=ay[r]-ay[l-1];
    kolko2=by[r]-by[l-1];
    if (kolko1!=kolko2) return -1;

    kolko1=az[r]-az[l-1];
    kolko2=bz[r]-bz[l-1];
    if (kolko1!=kolko2) return -1;

    ///imam resenje

    kolkoxy=xy[r]-xy[l-1];
    kolkoyx=yx[r]-yx[l-1];

    kolkoxz=xz[r]-xz[l-1];
    kolkozx=zx[r]-zx[l-1];

    kolkoyz=yz[r]-yz[l-1];
    kolkozy=zy[r]-zy[l-1];

    ress+=min(kolkoxy, kolkoyx)+min(kolkoyz, kolkozy)+min(kolkoxz, kolkozx);

    kolkoxy=max(kolkoxy, kolkoyx)-min(kolkoxy, kolkoyx);
    kolkoyz=max(kolkoyz, kolkozy)-min(kolkoyz, kolkozy);
    kolkozx=max(kolkozx, kolkoxz)-min(kolkozx, kolkoxz);

    ress+=(((kolkoxy+kolkoyz+kolkozx)/3)*2);

    return ress;
}
# Verdict Execution time Memory Grader output
1 Correct 42 ms 6816 KB Output is correct
2 Correct 54 ms 6844 KB Output is correct
3 Correct 43 ms 6420 KB Output is correct
4 Correct 47 ms 6848 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
# 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 0 ms 204 KB Output is correct
4 Correct 7 ms 5612 KB Output is correct
5 Correct 6 ms 5592 KB Output is correct
6 Correct 6 ms 5608 KB Output is correct
7 Correct 8 ms 5324 KB Output is correct
8 Correct 6 ms 5592 KB Output is correct
9 Correct 7 ms 5580 KB Output is correct
# 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 0 ms 204 KB Output is correct
4 Correct 7 ms 5612 KB Output is correct
5 Correct 6 ms 5592 KB Output is correct
6 Correct 6 ms 5608 KB Output is correct
7 Correct 8 ms 5324 KB Output is correct
8 Correct 6 ms 5592 KB Output is correct
9 Correct 7 ms 5580 KB Output is correct
10 Correct 44 ms 6812 KB Output is correct
11 Correct 40 ms 6852 KB Output is correct
12 Correct 38 ms 6876 KB Output is correct
13 Correct 40 ms 7100 KB Output is correct
14 Correct 44 ms 7200 KB Output is correct
15 Correct 39 ms 7068 KB Output is correct
16 Correct 38 ms 6904 KB Output is correct
17 Correct 36 ms 6944 KB Output is correct
18 Correct 37 ms 7252 KB Output is correct
19 Correct 37 ms 6924 KB Output is correct
20 Correct 36 ms 7068 KB Output is correct
21 Correct 35 ms 7200 KB Output is correct
# 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 0 ms 204 KB Output is correct
4 Correct 7 ms 5612 KB Output is correct
5 Correct 6 ms 5592 KB Output is correct
6 Correct 6 ms 5608 KB Output is correct
7 Correct 8 ms 5324 KB Output is correct
8 Correct 6 ms 5592 KB Output is correct
9 Correct 7 ms 5580 KB Output is correct
10 Correct 8 ms 5204 KB Output is correct
11 Correct 10 ms 5824 KB Output is correct
12 Correct 7 ms 5452 KB Output is correct
13 Correct 10 ms 5748 KB Output is correct
14 Correct 9 ms 5836 KB Output is correct
15 Correct 6 ms 5836 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 42 ms 6816 KB Output is correct
2 Correct 54 ms 6844 KB Output is correct
3 Correct 43 ms 6420 KB Output is correct
4 Correct 47 ms 6848 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 7 ms 5612 KB Output is correct
12 Correct 6 ms 5592 KB Output is correct
13 Correct 6 ms 5608 KB Output is correct
14 Correct 8 ms 5324 KB Output is correct
15 Correct 6 ms 5592 KB Output is correct
16 Correct 7 ms 5580 KB Output is correct
17 Correct 44 ms 6812 KB Output is correct
18 Correct 40 ms 6852 KB Output is correct
19 Correct 38 ms 6876 KB Output is correct
20 Correct 40 ms 7100 KB Output is correct
21 Correct 44 ms 7200 KB Output is correct
22 Correct 39 ms 7068 KB Output is correct
23 Correct 38 ms 6904 KB Output is correct
24 Correct 36 ms 6944 KB Output is correct
25 Correct 37 ms 7252 KB Output is correct
26 Correct 37 ms 6924 KB Output is correct
27 Correct 36 ms 7068 KB Output is correct
28 Correct 35 ms 7200 KB Output is correct
29 Correct 8 ms 5204 KB Output is correct
30 Correct 10 ms 5824 KB Output is correct
31 Correct 7 ms 5452 KB Output is correct
32 Correct 10 ms 5748 KB Output is correct
33 Correct 9 ms 5836 KB Output is correct
34 Correct 6 ms 5836 KB Output is correct
35 Correct 0 ms 332 KB Output is correct
36 Correct 43 ms 7704 KB Output is correct
37 Correct 48 ms 8208 KB Output is correct
38 Correct 47 ms 8256 KB Output is correct
39 Correct 40 ms 8480 KB Output is correct
40 Correct 44 ms 8548 KB Output is correct
41 Correct 5 ms 5836 KB Output is correct
42 Correct 38 ms 8204 KB Output is correct
43 Correct 39 ms 8500 KB Output is correct
44 Correct 44 ms 8452 KB Output is correct
45 Correct 38 ms 8244 KB Output is correct
46 Correct 39 ms 8452 KB Output is correct
47 Correct 37 ms 8444 KB Output is correct