Submission #477679

# Submission time Handle Problem Language Result Execution time Memory
477679 2021-10-03T03:24:11 Z TairitsuOwO Mutating DNA (IOI21_dna) C++17
100 / 100
46 ms 9776 KB
#include "dna.h"
#include <bits/stdc++.h>
using namespace std;

const int mxn=1e5+9;
int counta[mxn][3], countb[mxn][3], arr[mxn][3][3];

void init(string a, string b) {
    auto f=[](char c)->int{
        return c=='A'? 0: c=='T'? 1: 2;
    };
    a=" "+a, b=" "+b;
    for (int i=1; i<a.length(); i++){
        for (int j=0; j<3; j++) for (int k=0; k<3; k++){
            arr[i][j][k]=arr[i-1][j][k];
            counta[i][j]=counta[i-1][j];
            countb[i][j]=countb[i-1][j];
        }
        counta[i][f(a[i])]++;
        countb[i][f(b[i])]++;
        arr[i][f(a[i])][f(b[i])]++;
    }
}

int get_distance(int x, int y) {
    x++, y++;
    for (int i=0; i<3; i++) if (counta[y][i]-counta[x-1][i]!=countb[y][i]-countb[x-1][i]) return -1;
    int tmp[3][3], res=0;
    for (int i=0; i<3; i++) for (int j=0; j<3; j++) tmp[i][j]=arr[y][i][j]-arr[x-1][i][j];
    for (int i=0; i<3; i++) for (int j=i+1; j<3; j++){
        int swaps=min(tmp[i][j], tmp[j][i]);
        tmp[i][j]-=swaps, tmp[j][i]-=swaps, res+=swaps;
    }
    int res2=0;
    for (int i=0; i<3; i++) for (int j=0; j<3; j++) if (i!=j) res2+=tmp[i][j];
	return res+res2*2/3;
}

Compilation message

dna.cpp: In function 'void init(std::string, std::string)':
dna.cpp:13:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 |     for (int i=1; i<a.length(); i++){
      |                   ~^~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 41 ms 8004 KB Output is correct
2 Correct 45 ms 8108 KB Output is correct
3 Correct 40 ms 7480 KB Output is correct
4 Correct 43 ms 9416 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 6 ms 6844 KB Output is correct
5 Correct 7 ms 6940 KB Output is correct
6 Correct 7 ms 6836 KB Output is correct
7 Correct 6 ms 6476 KB Output is correct
8 Correct 6 ms 6912 KB Output is correct
9 Correct 5 ms 6912 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 6 ms 6844 KB Output is correct
5 Correct 7 ms 6940 KB Output is correct
6 Correct 7 ms 6836 KB Output is correct
7 Correct 6 ms 6476 KB Output is correct
8 Correct 6 ms 6912 KB Output is correct
9 Correct 5 ms 6912 KB Output is correct
10 Correct 42 ms 7996 KB Output is correct
11 Correct 43 ms 8012 KB Output is correct
12 Correct 44 ms 7896 KB Output is correct
13 Correct 40 ms 8128 KB Output is correct
14 Correct 46 ms 8380 KB Output is correct
15 Correct 44 ms 8252 KB Output is correct
16 Correct 39 ms 7912 KB Output is correct
17 Correct 39 ms 8132 KB Output is correct
18 Correct 41 ms 8376 KB Output is correct
19 Correct 35 ms 7992 KB Output is correct
20 Correct 39 ms 8132 KB Output is correct
21 Correct 37 ms 8376 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 6 ms 6844 KB Output is correct
5 Correct 7 ms 6940 KB Output is correct
6 Correct 7 ms 6836 KB Output is correct
7 Correct 6 ms 6476 KB Output is correct
8 Correct 6 ms 6912 KB Output is correct
9 Correct 5 ms 6912 KB Output is correct
10 Correct 7 ms 6276 KB Output is correct
11 Correct 6 ms 7120 KB Output is correct
12 Correct 6 ms 6608 KB Output is correct
13 Correct 7 ms 6992 KB Output is correct
14 Correct 7 ms 7100 KB Output is correct
15 Correct 6 ms 7136 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 41 ms 8004 KB Output is correct
2 Correct 45 ms 8108 KB Output is correct
3 Correct 40 ms 7480 KB Output is correct
4 Correct 43 ms 9416 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 6 ms 6844 KB Output is correct
12 Correct 7 ms 6940 KB Output is correct
13 Correct 7 ms 6836 KB Output is correct
14 Correct 6 ms 6476 KB Output is correct
15 Correct 6 ms 6912 KB Output is correct
16 Correct 5 ms 6912 KB Output is correct
17 Correct 42 ms 7996 KB Output is correct
18 Correct 43 ms 8012 KB Output is correct
19 Correct 44 ms 7896 KB Output is correct
20 Correct 40 ms 8128 KB Output is correct
21 Correct 46 ms 8380 KB Output is correct
22 Correct 44 ms 8252 KB Output is correct
23 Correct 39 ms 7912 KB Output is correct
24 Correct 39 ms 8132 KB Output is correct
25 Correct 41 ms 8376 KB Output is correct
26 Correct 35 ms 7992 KB Output is correct
27 Correct 39 ms 8132 KB Output is correct
28 Correct 37 ms 8376 KB Output is correct
29 Correct 7 ms 6276 KB Output is correct
30 Correct 6 ms 7120 KB Output is correct
31 Correct 6 ms 6608 KB Output is correct
32 Correct 7 ms 6992 KB Output is correct
33 Correct 7 ms 7100 KB Output is correct
34 Correct 6 ms 7136 KB Output is correct
35 Correct 1 ms 208 KB Output is correct
36 Correct 43 ms 8864 KB Output is correct
37 Correct 45 ms 9396 KB Output is correct
38 Correct 41 ms 9264 KB Output is correct
39 Correct 45 ms 9644 KB Output is correct
40 Correct 43 ms 9756 KB Output is correct
41 Correct 6 ms 7120 KB Output is correct
42 Correct 38 ms 9252 KB Output is correct
43 Correct 37 ms 9664 KB Output is correct
44 Correct 37 ms 9688 KB Output is correct
45 Correct 38 ms 9176 KB Output is correct
46 Correct 36 ms 9776 KB Output is correct
47 Correct 36 ms 9656 KB Output is correct