Submission #614491

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
614491	2022-07-31 03:27:43	serize	Mutating DNA (IOI21_dna)	C++17	100 / 100	54 ms	8592 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 "dna.h"
#include <cstdio>
#include <cassert>
#include <string>
#include <vector>
using namespace std;
const int MAX = 1e5+2;
vector<int> A(MAX), Ab(MAX), C(MAX), Cb(MAX), T(MAX), Tb(MAX), AC(MAX), CA(MAX), AT(MAX), TA(MAX), CT(MAX), TC(MAX); 
void init(std::string a, std::string b) {
    int n = a.size();
    for(int i = 0; i < n; i++){
        if(a[i] == 'A') A[i+1]++;
        if(a[i] == 'C') C[i+1]++;
        if(a[i] == 'T') T[i+1]++;
        if(b[i] == 'A') Ab[i+1]++;
        if(b[i] == 'C') Cb[i+1]++;
        if(b[i] == 'T') Tb[i+1]++;
        if(a[i] == 'A'){
            if(b[i] == 'C') AC[i+1]++;
            if(b[i] == 'T') AT[i+1]++;
        }
        if(a[i] == 'C'){
            if(b[i] == 'A') CA[i+1]++;
            if(b[i] == 'T') CT[i+1]++;
        }
        if(a[i] == 'T'){
            if(b[i] == 'A') TA[i+1]++;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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