oj.uz

Submission #591917

# Submission time Handle Problem Language Result Execution time Memory
591917 2022-07-08T08:46:36 Z Jarif_Rahman Mutating DNA (IOI21_dna) C++17
100 / 100
 47 ms 7408 KB 
#include "dna.h"
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;

vector<int> A, T, C, AT, CT, AC, TC, CA, TA;

void init(str a, str b){
    int n = a.size();
    A.assign(n, 0);
    T.assign(n, 0);
    C.assign(n, 0);
    AT.assign(n, 0);
    CT.assign(n, 0);
    AC.assign(n, 0);
    TC.assign(n, 0);
    CA.assign(n, 0);
    TA.assign(n, 0);

    for(int i = 0; i < n; i++){
        if(i != 0) A[i] = A[i-1], T[i] = T[i-1], C[i] = C[i-1];
        if(a[i] == 'A') A[i]++;
        if(a[i] == 'T') T[i]++;
        if(a[i] == 'C') C[i]++;
        if(b[i] == 'A') A[i]--;
        if(b[i] == 'T') T[i]--;
        if(b[i] == 'C') C[i]--;
    }

    for(int i = 0; i < n; i++){
        if(i != 0)
            AT[i] = AT[i-1], CT[i] = CT[i-1],
            AC[i] = AC[i-1], TC[i] = TC[i-1],
            CA[i] = CA[i-1], TA[i] = TA[i-1];
        if(a[i] == 'A' && b[i]  == 'T') AT[i]++;
        if(a[i] == 'C' && b[i]  == 'T') CT[i]++;
        if(a[i] == 'A' && b[i]  == 'C') AC[i]++;
        if(a[i] == 'T' && b[i]  == 'C') TC[i]++;
        if(a[i] == 'C' && b[i]  == 'A') CA[i]++;
        if(a[i] == 'T' && b[i]  == 'A') TA[i]++;
    }
}

int getsum(int l, int r, vector<int> &v){
    return v[r]-(l == 0 ? 0: v[l-1]);
}

int getmn(int &a, int &b){
    int mn = min(a, b);
    a-=mn, b-=mn;
    return mn;
}

int get_distance(int l, int r){
    if(getsum(l, r, A) != 0 || getsum(l, r, C) != 0 || getsum(l, r, T) != 0) return -1;

    int at = getsum(l, r, AT), ct = getsum(l, r, CT);
    int ac = getsum(l, r, AC), tc = getsum(l, r, TC);
    int ca = getsum(l, r, CA), ta = getsum(l, r, TA);

    int ans = 0;
    ans+=getmn(at, ta);
    ans+=getmn(ct, tc);
    ans+=getmn(ac, ca);

    if(at != 0) ans+=at+tc+ca-min(at, min(tc, ca));
    else ans+=ta+ac+ct-min(ta, min(ac, ct));

    return ans;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 7016 KB Output is correct
2 Correct 36 ms 6968 KB Output is correct
3 Correct 33 ms 6672 KB Output is correct
4 Correct 36 ms 7052 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 6 ms 4580 KB Output is correct
5 Correct 5 ms 4584 KB Output is correct
6 Correct 6 ms 4592 KB Output is correct
7 Correct 5 ms 4244 KB Output is correct
8 Correct 7 ms 4532 KB Output is correct
9 Correct 8 ms 4564 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 6 ms 4580 KB Output is correct
5 Correct 5 ms 4584 KB Output is correct
6 Correct 6 ms 4592 KB Output is correct
7 Correct 5 ms 4244 KB Output is correct
8 Correct 7 ms 4532 KB Output is correct
9 Correct 8 ms 4564 KB Output is correct
10 Correct 39 ms 7008 KB Output is correct
11 Correct 33 ms 6980 KB Output is correct
12 Correct 41 ms 7008 KB Output is correct
13 Correct 35 ms 7188 KB Output is correct
14 Correct 37 ms 7324 KB Output is correct
15 Correct 32 ms 7268 KB Output is correct
16 Correct 31 ms 7012 KB Output is correct
17 Correct 34 ms 7124 KB Output is correct
18 Correct 38 ms 7304 KB Output is correct
19 Correct 42 ms 6924 KB Output is correct
20 Correct 30 ms 7152 KB Output is correct
21 Correct 34 ms 7276 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 6 ms 4580 KB Output is correct
5 Correct 5 ms 4584 KB Output is correct
6 Correct 6 ms 4592 KB Output is correct
7 Correct 5 ms 4244 KB Output is correct
8 Correct 7 ms 4532 KB Output is correct
9 Correct 8 ms 4564 KB Output is correct
10 Correct 6 ms 4148 KB Output is correct
11 Correct 7 ms 4564 KB Output is correct
12 Correct 6 ms 4308 KB Output is correct
13 Correct 9 ms 4564 KB Output is correct
14 Correct 7 ms 4552 KB Output is correct
15 Correct 5 ms 4540 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 7016 KB Output is correct
2 Correct 36 ms 6968 KB Output is correct
3 Correct 33 ms 6672 KB Output is correct
4 Correct 36 ms 7052 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 6 ms 4580 KB Output is correct
12 Correct 5 ms 4584 KB Output is correct
13 Correct 6 ms 4592 KB Output is correct
14 Correct 5 ms 4244 KB Output is correct
15 Correct 7 ms 4532 KB Output is correct
16 Correct 8 ms 4564 KB Output is correct
17 Correct 39 ms 7008 KB Output is correct
18 Correct 33 ms 6980 KB Output is correct
19 Correct 41 ms 7008 KB Output is correct
20 Correct 35 ms 7188 KB Output is correct
21 Correct 37 ms 7324 KB Output is correct
22 Correct 32 ms 7268 KB Output is correct
23 Correct 31 ms 7012 KB Output is correct
24 Correct 34 ms 7124 KB Output is correct
25 Correct 38 ms 7304 KB Output is correct
26 Correct 42 ms 6924 KB Output is correct
27 Correct 30 ms 7152 KB Output is correct
28 Correct 34 ms 7276 KB Output is correct
29 Correct 6 ms 4148 KB Output is correct
30 Correct 7 ms 4564 KB Output is correct
31 Correct 6 ms 4308 KB Output is correct
32 Correct 9 ms 4564 KB Output is correct
33 Correct 7 ms 4552 KB Output is correct
34 Correct 5 ms 4540 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 33 ms 6668 KB Output is correct
37 Correct 40 ms 7012 KB Output is correct
38 Correct 36 ms 7144 KB Output is correct
39 Correct 47 ms 7404 KB Output is correct
40 Correct 34 ms 7408 KB Output is correct
41 Correct 5 ms 4564 KB Output is correct
42 Correct 34 ms 6996 KB Output is correct
43 Correct 33 ms 7320 KB Output is correct
44 Correct 39 ms 7272 KB Output is correct
45 Correct 30 ms 7084 KB Output is correct
46 Correct 30 ms 7272 KB Output is correct
47 Correct 38 ms 7264 KB Output is correct