Submission #484439

# Submission time Handle Problem Language Result Execution time Memory
484439 2021-11-03T11:54:59 Z Spade1 Mutating DNA (IOI21_dna) C++17
100 / 100
35 ms 6212 KB
#include <bits/stdc++.h>
#include "dna.h"
#define ll long long
#define pii pair<int, int>
#define st first
#define nd second
#define pb push_back
using namespace std;

int p[100010][6];

void init(string a, string b) {
    for (int i = 1; i <= a.size(); ++i) {
        if (a[i - 1] == 'A' && b[i - 1] == 'C') p[i][0]++;
        if (a[i - 1] == 'A' && b[i - 1] == 'T') p[i][1]++;
        if (a[i - 1] == 'C' && b[i - 1] == 'A') p[i][2]++;
        if (a[i - 1] == 'C' && b[i - 1] == 'T') p[i][3]++;
        if (a[i - 1] == 'T' && b[i - 1] == 'A') p[i][4]++;
        if (a[i - 1] == 'T' && b[i - 1] == 'C') p[i][5]++;

        for (int j = 0; j < 6; ++j) p[i][j] += p[i - 1][j];
    }
}

int get_distance(int x, int y) {
    ++x, ++y;
    int tmp[6];
    for (int i = 0; i < 6; ++i) {
        tmp[i] = p[y][i] - p[x - 1][i];
    }
    int A1 = tmp[0] + tmp[1], A2 = tmp[2] + tmp[4];
    int C1 = tmp[2] + tmp[3], C2 = tmp[0] + tmp[5];
    int T1 = tmp[4] + tmp[5], T2 = tmp[1] + tmp[3];

    if (A1 != A2 || C1 != C2 || T1 != T2) return -1;

    int ans1 = 0;
    for (int i = 0; i < 6; ++i) ans1 += tmp[i];
    int ans2 = min(tmp[0], tmp[2]) + min(tmp[1], tmp[4]) + min(tmp[3], tmp[5]);
    ans1 -= 2*ans2;
    ans1 = ans1/3*2;

    return ans1 + ans2;
}

Compilation message

dna.cpp: In function 'void init(std::string, std::string)':
dna.cpp:13:23: 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.size(); ++i) {
      |                     ~~^~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 32 ms 5772 KB Output is correct
2 Correct 32 ms 5876 KB Output is correct
3 Correct 31 ms 5580 KB Output is correct
4 Correct 35 ms 5868 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 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 4 ms 3388 KB Output is correct
5 Correct 4 ms 3404 KB Output is correct
6 Correct 4 ms 3404 KB Output is correct
7 Correct 3 ms 3148 KB Output is correct
8 Correct 4 ms 3388 KB Output is correct
9 Correct 3 ms 3404 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 4 ms 3388 KB Output is correct
5 Correct 4 ms 3404 KB Output is correct
6 Correct 4 ms 3404 KB Output is correct
7 Correct 3 ms 3148 KB Output is correct
8 Correct 4 ms 3388 KB Output is correct
9 Correct 3 ms 3404 KB Output is correct
10 Correct 31 ms 5740 KB Output is correct
11 Correct 32 ms 5760 KB Output is correct
12 Correct 31 ms 5908 KB Output is correct
13 Correct 31 ms 6028 KB Output is correct
14 Correct 31 ms 6144 KB Output is correct
15 Correct 29 ms 6124 KB Output is correct
16 Correct 31 ms 5856 KB Output is correct
17 Correct 34 ms 5900 KB Output is correct
18 Correct 31 ms 6144 KB Output is correct
19 Correct 31 ms 5904 KB Output is correct
20 Correct 29 ms 6028 KB Output is correct
21 Correct 29 ms 6136 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 4 ms 3388 KB Output is correct
5 Correct 4 ms 3404 KB Output is correct
6 Correct 4 ms 3404 KB Output is correct
7 Correct 3 ms 3148 KB Output is correct
8 Correct 4 ms 3388 KB Output is correct
9 Correct 3 ms 3404 KB Output is correct
10 Correct 3 ms 3148 KB Output is correct
11 Correct 4 ms 3404 KB Output is correct
12 Correct 4 ms 3148 KB Output is correct
13 Correct 4 ms 3404 KB Output is correct
14 Correct 4 ms 3404 KB Output is correct
15 Correct 4 ms 3404 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 32 ms 5772 KB Output is correct
2 Correct 32 ms 5876 KB Output is correct
3 Correct 31 ms 5580 KB Output is correct
4 Correct 35 ms 5868 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 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 4 ms 3388 KB Output is correct
12 Correct 4 ms 3404 KB Output is correct
13 Correct 4 ms 3404 KB Output is correct
14 Correct 3 ms 3148 KB Output is correct
15 Correct 4 ms 3388 KB Output is correct
16 Correct 3 ms 3404 KB Output is correct
17 Correct 31 ms 5740 KB Output is correct
18 Correct 32 ms 5760 KB Output is correct
19 Correct 31 ms 5908 KB Output is correct
20 Correct 31 ms 6028 KB Output is correct
21 Correct 31 ms 6144 KB Output is correct
22 Correct 29 ms 6124 KB Output is correct
23 Correct 31 ms 5856 KB Output is correct
24 Correct 34 ms 5900 KB Output is correct
25 Correct 31 ms 6144 KB Output is correct
26 Correct 31 ms 5904 KB Output is correct
27 Correct 29 ms 6028 KB Output is correct
28 Correct 29 ms 6136 KB Output is correct
29 Correct 3 ms 3148 KB Output is correct
30 Correct 4 ms 3404 KB Output is correct
31 Correct 4 ms 3148 KB Output is correct
32 Correct 4 ms 3404 KB Output is correct
33 Correct 4 ms 3404 KB Output is correct
34 Correct 4 ms 3404 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 33 ms 5600 KB Output is correct
37 Correct 34 ms 5804 KB Output is correct
38 Correct 32 ms 6004 KB Output is correct
39 Correct 34 ms 6212 KB Output is correct
40 Correct 34 ms 6124 KB Output is correct
41 Correct 3 ms 3404 KB Output is correct
42 Correct 30 ms 5940 KB Output is correct
43 Correct 35 ms 6124 KB Output is correct
44 Correct 29 ms 6132 KB Output is correct
45 Correct 28 ms 5900 KB Output is correct
46 Correct 29 ms 6208 KB Output is correct
47 Correct 29 ms 6140 KB Output is correct