Submission #441336

# Submission time Handle Problem Language Result Execution time Memory
441336 2021-07-05T01:02:03 Z SirCovidThe19th Mutating DNA (IOI21_dna) C++17
100 / 100
52 ms 6592 KB
#include <bits/stdc++.h>
using namespace std;

int pre[100005][3][3], mp[256];

void init(string a, string b){
    mp['A'] = 0, mp['C'] = 1, mp['T'] = 2;
    for (int i = 1; i <= a.size(); i++)
        for (int j = 0; j < 3; j++)
            for (int k = 0; k < 3; k++)
                pre[i][j][k] = pre[i-1][j][k]+(mp[a[i-1]] == j and mp[b[i-1]] == k);
}
int get_distance(int a, int b){
    int own = 0, share = 0;
    for (int i = 0; i < 3; i++){ int j = (i+1)%3;
        int cnt1 = pre[b+1][i][j]-pre[a][i][j];
        int cnt2 = pre[b+1][j][i]-pre[a][j][i];
        if (i == 0) share = cnt1-cnt2;
        else if (cnt1-cnt2 != share) return -1;
        own += min(cnt1, cnt2);
    }return own+(abs(share)*2);
}

Compilation message

dna.cpp: In function 'void init(std::string, std::string)':
dna.cpp:8:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 |     for (int i = 1; i <= a.size(); i++)
      |                     ~~^~~~~~~~~~~
dna.cpp:11:57: warning: array subscript has type 'char' [-Wchar-subscripts]
   11 |                 pre[i][j][k] = pre[i-1][j][k]+(mp[a[i-1]] == j and mp[b[i-1]] == k);
      |                                                         ^
dna.cpp:11:77: warning: array subscript has type 'char' [-Wchar-subscripts]
   11 |                 pre[i][j][k] = pre[i-1][j][k]+(mp[a[i-1]] == j and mp[b[i-1]] == k);
      |                                                                             ^
# Verdict Execution time Memory Grader output
1 Correct 40 ms 5636 KB Output is correct
2 Correct 39 ms 5648 KB Output is correct
3 Correct 41 ms 5360 KB Output is correct
4 Correct 40 ms 6164 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 332 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 204 KB Output is correct
4 Correct 5 ms 4264 KB Output is correct
5 Correct 5 ms 4300 KB Output is correct
6 Correct 6 ms 4300 KB Output is correct
7 Correct 5 ms 4044 KB Output is correct
8 Correct 5 ms 4300 KB Output is correct
9 Correct 5 ms 4300 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 204 KB Output is correct
4 Correct 5 ms 4264 KB Output is correct
5 Correct 5 ms 4300 KB Output is correct
6 Correct 6 ms 4300 KB Output is correct
7 Correct 5 ms 4044 KB Output is correct
8 Correct 5 ms 4300 KB Output is correct
9 Correct 5 ms 4300 KB Output is correct
10 Correct 40 ms 5636 KB Output is correct
11 Correct 51 ms 5628 KB Output is correct
12 Correct 48 ms 5776 KB Output is correct
13 Correct 41 ms 5816 KB Output is correct
14 Correct 40 ms 6012 KB Output is correct
15 Correct 39 ms 5884 KB Output is correct
16 Correct 38 ms 5736 KB Output is correct
17 Correct 38 ms 5884 KB Output is correct
18 Correct 39 ms 6012 KB Output is correct
19 Correct 36 ms 5804 KB Output is correct
20 Correct 36 ms 5876 KB Output is correct
21 Correct 36 ms 6108 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 204 KB Output is correct
4 Correct 5 ms 4264 KB Output is correct
5 Correct 5 ms 4300 KB Output is correct
6 Correct 6 ms 4300 KB Output is correct
7 Correct 5 ms 4044 KB Output is correct
8 Correct 5 ms 4300 KB Output is correct
9 Correct 5 ms 4300 KB Output is correct
10 Correct 5 ms 3996 KB Output is correct
11 Correct 5 ms 4536 KB Output is correct
12 Correct 5 ms 4300 KB Output is correct
13 Correct 5 ms 4536 KB Output is correct
14 Correct 5 ms 4556 KB Output is correct
15 Correct 5 ms 4544 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 40 ms 5636 KB Output is correct
2 Correct 39 ms 5648 KB Output is correct
3 Correct 41 ms 5360 KB Output is correct
4 Correct 40 ms 6164 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 332 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 204 KB Output is correct
11 Correct 5 ms 4264 KB Output is correct
12 Correct 5 ms 4300 KB Output is correct
13 Correct 6 ms 4300 KB Output is correct
14 Correct 5 ms 4044 KB Output is correct
15 Correct 5 ms 4300 KB Output is correct
16 Correct 5 ms 4300 KB Output is correct
17 Correct 40 ms 5636 KB Output is correct
18 Correct 51 ms 5628 KB Output is correct
19 Correct 48 ms 5776 KB Output is correct
20 Correct 41 ms 5816 KB Output is correct
21 Correct 40 ms 6012 KB Output is correct
22 Correct 39 ms 5884 KB Output is correct
23 Correct 38 ms 5736 KB Output is correct
24 Correct 38 ms 5884 KB Output is correct
25 Correct 39 ms 6012 KB Output is correct
26 Correct 36 ms 5804 KB Output is correct
27 Correct 36 ms 5876 KB Output is correct
28 Correct 36 ms 6108 KB Output is correct
29 Correct 5 ms 3996 KB Output is correct
30 Correct 5 ms 4536 KB Output is correct
31 Correct 5 ms 4300 KB Output is correct
32 Correct 5 ms 4536 KB Output is correct
33 Correct 5 ms 4556 KB Output is correct
34 Correct 5 ms 4544 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 52 ms 5860 KB Output is correct
37 Correct 45 ms 6200 KB Output is correct
38 Correct 42 ms 6288 KB Output is correct
39 Correct 43 ms 6556 KB Output is correct
40 Correct 42 ms 6492 KB Output is correct
41 Correct 5 ms 4560 KB Output is correct
42 Correct 40 ms 6308 KB Output is correct
43 Correct 40 ms 6536 KB Output is correct
44 Correct 39 ms 6528 KB Output is correct
45 Correct 37 ms 6288 KB Output is correct
46 Correct 37 ms 6496 KB Output is correct
47 Correct 38 ms 6592 KB Output is correct