oj.uz

Submission #470779

# Submission time Handle Problem Language Result Execution time Memory
470779 2021-09-05T14:48:00 Z nicolaalexandra Mutating DNA (IOI21_dna) C++17
100 / 100
 109 ms 13636 KB 
#include <bits/stdc++.h>
#include "dna.h"
#define DIM 100010
using namespace std;

struct segment_tree{
    int stare[7];
} aint[DIM*4],sol;
string a,b;
int sp_a0[DIM],sp_a1[DIM],sp_a2[DIM],sp_b0[DIM],sp_b1[DIM],sp_b2[DIM];
int n;

void build (int nod, int st, int dr){
    if (st == dr){
        if (a[st-1] == 'A' && b[st-1] == 'C')
            aint[nod].stare[1] = 1;
        if (a[st-1] == 'A' && b[st-1] == 'T')
            aint[nod].stare[2] = 1;
        if (a[st-1] == 'C' && b[st-1] == 'A')
            aint[nod].stare[3] = 1;
        if (a[st-1] == 'C' && b[st-1] == 'T')
            aint[nod].stare[4] = 1;
        if (a[st-1] == 'T' && b[st-1] == 'A')
            aint[nod].stare[5] = 1;
        if (a[st-1] == 'T' && b[st-1] == 'C')
            aint[nod].stare[6] = 1;
        return;
    }
    int mid = (st+dr)>>1;
    build (nod<<1,st,mid);
    build ((nod<<1)|1,mid+1,dr);
    for (int i=1;i<=6;i++)
        aint[nod].stare[i] = aint[nod<<1].stare[i] + aint[(nod<<1)|1].stare[i];
}

void query (int nod, int st, int dr, int x, int y){
    if (x <= st && dr <= y){
        for (int i=1;i<=6;i++)
            sol.stare[i] += aint[nod].stare[i];
        return;
    }
    int mid = (st+dr)>>1;
    if (x <= mid)
        query (nod<<1,st,mid,x,y);
    if (y > mid)
        query ((nod<<1)|1,mid+1,dr,x,y);
}


void init (string A, string B){
    n = A.size();
    a = A, b = B;

    build (1,1,n);

    for (int i=1;i<=n;i++){
        sp_a0[i] = sp_a0[i-1] + (a[i-1] == 'A');
        sp_a1[i] = sp_a1[i-1] + (a[i-1] == 'C');
        sp_a2[i] = sp_a2[i-1] + (a[i-1] == 'T');

        sp_b0[i] = sp_b0[i-1] + (b[i-1] == 'A');
        sp_b1[i] = sp_b1[i-1] + (b[i-1] == 'C');
        sp_b2[i] = sp_b2[i-1] + (b[i-1] == 'T');
    }
}


int get_distance (int x, int y){
    x++, y++;
    int ans = 0;

    if (sp_a0[y] - sp_a0[x-1] != sp_b0[y] - sp_b0[x-1])
        return -1;
    if (sp_a1[y] - sp_a1[x-1] != sp_b1[y] - sp_b1[x-1])
        return -1;
    if (sp_a2[y] - sp_a2[x-1] != sp_b2[y] - sp_b2[x-1])
        return -1;

    for (int i=1;i<=6;i++)
        sol.stare[i] = 0;

    query (1,1,n,x,y);

    int nr = min (sol.stare[1],sol.stare[3]);
    ans += nr;
    sol.stare[1] -= nr, sol.stare[3] -= nr;

    nr = min (sol.stare[2],sol.stare[5]);
    ans += nr;
    sol.stare[2] -= nr, sol.stare[5] -= nr;

    nr = min (sol.stare[4],sol.stare[6]);
    ans += nr;
    sol.stare[4] -= nr, sol.stare[6] -= nr;

    nr = min (sol.stare[1],min(sol.stare[4],sol.stare[5]));
    ans += 2 * nr;
    sol.stare[1] -= nr, sol.stare[4] -= nr, sol.stare[5] -= nr;

    nr = min (sol.stare[2],min(sol.stare[3],sol.stare[6]));
    ans += 2 * nr;
    sol.stare[2] -= nr, sol.stare[3] -= nr, sol.stare[6] -= nr;

    return ans;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 80 ms 11928 KB Output is correct
2 Correct 67 ms 11976 KB Output is correct
3 Correct 64 ms 11680 KB Output is correct
4 Correct 65 ms 11980 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 1 ms 332 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 9 ms 10572 KB Output is correct
5 Correct 9 ms 10572 KB Output is correct
6 Correct 10 ms 10592 KB Output is correct
7 Correct 10 ms 10316 KB Output is correct
8 Correct 10 ms 10572 KB Output is correct
9 Correct 9 ms 10572 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 1 ms 332 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 9 ms 10572 KB Output is correct
5 Correct 9 ms 10572 KB Output is correct
6 Correct 10 ms 10592 KB Output is correct
7 Correct 10 ms 10316 KB Output is correct
8 Correct 10 ms 10572 KB Output is correct
9 Correct 9 ms 10572 KB Output is correct
10 Correct 66 ms 11884 KB Output is correct
11 Correct 74 ms 11968 KB Output is correct
12 Correct 105 ms 12088 KB Output is correct
13 Correct 99 ms 12188 KB Output is correct
14 Correct 99 ms 12228 KB Output is correct
15 Correct 100 ms 12164 KB Output is correct
16 Correct 91 ms 12100 KB Output is correct
17 Correct 87 ms 12184 KB Output is correct
18 Correct 88 ms 12336 KB Output is correct
19 Correct 80 ms 12100 KB Output is correct
20 Correct 80 ms 12228 KB Output is correct
21 Correct 76 ms 12364 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 1 ms 332 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 9 ms 10572 KB Output is correct
5 Correct 9 ms 10572 KB Output is correct
6 Correct 10 ms 10592 KB Output is correct
7 Correct 10 ms 10316 KB Output is correct
8 Correct 10 ms 10572 KB Output is correct
9 Correct 9 ms 10572 KB Output is correct
10 Correct 9 ms 10320 KB Output is correct
11 Correct 10 ms 10572 KB Output is correct
12 Correct 9 ms 10348 KB Output is correct
13 Correct 10 ms 10816 KB Output is correct
14 Correct 11 ms 10700 KB Output is correct
15 Correct 10 ms 10812 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 80 ms 11928 KB Output is correct
2 Correct 67 ms 11976 KB Output is correct
3 Correct 64 ms 11680 KB Output is correct
4 Correct 65 ms 11980 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 1 ms 332 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 9 ms 10572 KB Output is correct
12 Correct 9 ms 10572 KB Output is correct
13 Correct 10 ms 10592 KB Output is correct
14 Correct 10 ms 10316 KB Output is correct
15 Correct 10 ms 10572 KB Output is correct
16 Correct 9 ms 10572 KB Output is correct
17 Correct 66 ms 11884 KB Output is correct
18 Correct 74 ms 11968 KB Output is correct
19 Correct 105 ms 12088 KB Output is correct
20 Correct 99 ms 12188 KB Output is correct
21 Correct 99 ms 12228 KB Output is correct
22 Correct 100 ms 12164 KB Output is correct
23 Correct 91 ms 12100 KB Output is correct
24 Correct 87 ms 12184 KB Output is correct
25 Correct 88 ms 12336 KB Output is correct
26 Correct 80 ms 12100 KB Output is correct
27 Correct 80 ms 12228 KB Output is correct
28 Correct 76 ms 12364 KB Output is correct
29 Correct 9 ms 10320 KB Output is correct
30 Correct 10 ms 10572 KB Output is correct
31 Correct 9 ms 10348 KB Output is correct
32 Correct 10 ms 10816 KB Output is correct
33 Correct 11 ms 10700 KB Output is correct
34 Correct 10 ms 10812 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 66 ms 12980 KB Output is correct
37 Correct 66 ms 13252 KB Output is correct
38 Correct 109 ms 13452 KB Output is correct
39 Correct 95 ms 13636 KB Output is correct
40 Correct 98 ms 13632 KB Output is correct
41 Correct 9 ms 10700 KB Output is correct
42 Correct 85 ms 13340 KB Output is correct
43 Correct 91 ms 13628 KB Output is correct
44 Correct 91 ms 13508 KB Output is correct
45 Correct 89 ms 13412 KB Output is correct
46 Correct 77 ms 13496 KB Output is correct
47 Correct 80 ms 13508 KB Output is correct