Submission #470779

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
470779	2021-09-05 14:48:00	nicolaalexandra	Mutating DNA (IOI21_dna)	C++17	100 / 100	109 ms	13636 KiB

dna

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#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);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 21 / 21
• Subtask 2: 22 / 22
• Subtask 3: 13 / 13
• Subtask 4: 28 / 28
• Subtask 5: 16 / 16