oj.uz

Submission #446074

# Submission time Handle Problem Language Result Execution time Memory
446074 2021-07-20T17:24:45 Z boris_mihov Mutating DNA (IOI21_dna) C++17
100 / 100
 65 ms 9744 KB 
#include <iostream>
using namespace std;
const int maxn = 1e5+10;
int prefix[3][3][maxn], n;
int prefix_letters[2][3][maxn];
int convert[128];

void init(string a, string b) {

    n = a.size();
    convert['A'] = 0;
    convert['C'] = 1;
    convert['T'] = 2;
    a = ' ' + a;
    b = ' ' + b;

    for (int i = 1 ; i <= n ; ++i) {

        for (int x = 0 ; x < 3 ; ++x) {

            prefix_letters[0][x][i] = prefix_letters[0][x][i-1];
            prefix_letters[1][x][i] = prefix_letters[1][x][i-1];

        }

        for (int x = 0 ; x < 3 ; ++x)
            for (int y = 0 ; y < 3 ; ++y)
                prefix[x][y][i] = prefix[x][y][i-1];
            

        ++prefix[convert[a[i]]][convert[b[i]]][i];
        ++prefix_letters[0][convert[a[i]]][i];
        ++prefix_letters[1][convert[b[i]]][i];

    }

}

int t[3][3];

int get_distance(int l, int r) {

    ++l; ++r;

    for (int i = 0 ; i < 3 ; ++i)
        if (prefix_letters[0][i][r] - prefix_letters[0][i][l-1] != prefix_letters[1][i][r] - prefix_letters[1][i][l-1]) return -1; 

    for (int x = 0 ; x < 3 ; ++x)
        for (int y = 0 ; y < 3 ; ++y)
            t[x][y] = prefix[x][y][r] - prefix[x][y][l-1];

    t[0][0] = 0;
    t[1][1] = 0;
    t[2][2] = 0;
    int ans = 0;

    for (int x = 0 ; x < 3 ; ++x) {
        for (int y = x+1 ; y < 3 ; ++y) {

            int remove = min(t[x][y], t[y][x]);
            t[x][y] -= remove;
            t[y][x] -= remove;
            ans += remove;

        }
    }

    for (int x = 0 ; x < 3 ; ++x) {
        for (int y = 0 ; y < 3 ; ++y) {
            if (t[x][y] > 0) {

                ans += t[x][y]*2;
                return ans;

            }
        }
    }

    return ans;

}

Compilation message

dna.cpp: In function 'void init(std::string, std::string)':
dna.cpp:31:30: warning: array subscript has type 'char' [-Wchar-subscripts]
   31 |         ++prefix[convert[a[i]]][convert[b[i]]][i];
      |                              ^
dna.cpp:31:45: warning: array subscript has type 'char' [-Wchar-subscripts]
   31 |         ++prefix[convert[a[i]]][convert[b[i]]][i];
      |                                             ^
dna.cpp:32:41: warning: array subscript has type 'char' [-Wchar-subscripts]
   32 |         ++prefix_letters[0][convert[a[i]]][i];
      |                                         ^
dna.cpp:33:41: warning: array subscript has type 'char' [-Wchar-subscripts]
   33 |         ++prefix_letters[1][convert[b[i]]][i];
      |                                         ^

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 7960 KB Output is correct
2 Correct 56 ms 9360 KB Output is correct
3 Correct 52 ms 8832 KB Output is correct
4 Correct 55 ms 9360 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 9 ms 7000 KB Output is correct
5 Correct 9 ms 6988 KB Output is correct
6 Correct 9 ms 6988 KB Output is correct
7 Correct 8 ms 6548 KB Output is correct
8 Correct 8 ms 6988 KB Output is correct
9 Correct 9 ms 6988 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 9 ms 7000 KB Output is correct
5 Correct 9 ms 6988 KB Output is correct
6 Correct 9 ms 6988 KB Output is correct
7 Correct 8 ms 6548 KB Output is correct
8 Correct 8 ms 6988 KB Output is correct
9 Correct 9 ms 6988 KB Output is correct
10 Correct 52 ms 9340 KB Output is correct
11 Correct 52 ms 9324 KB Output is correct
12 Correct 57 ms 9320 KB Output is correct
13 Correct 55 ms 9388 KB Output is correct
14 Correct 55 ms 9632 KB Output is correct
15 Correct 60 ms 9600 KB Output is correct
16 Correct 51 ms 9248 KB Output is correct
17 Correct 53 ms 9420 KB Output is correct
18 Correct 48 ms 9604 KB Output is correct
19 Correct 47 ms 9268 KB Output is correct
20 Correct 42 ms 9356 KB Output is correct
21 Correct 44 ms 9604 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 9 ms 7000 KB Output is correct
5 Correct 9 ms 6988 KB Output is correct
6 Correct 9 ms 6988 KB Output is correct
7 Correct 8 ms 6548 KB Output is correct
8 Correct 8 ms 6988 KB Output is correct
9 Correct 9 ms 6988 KB Output is correct
10 Correct 7 ms 6456 KB Output is correct
11 Correct 8 ms 7004 KB Output is correct
12 Correct 8 ms 6608 KB Output is correct
13 Correct 9 ms 6964 KB Output is correct
14 Correct 8 ms 6968 KB Output is correct
15 Correct 10 ms 6972 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 7960 KB Output is correct
2 Correct 56 ms 9360 KB Output is correct
3 Correct 52 ms 8832 KB Output is correct
4 Correct 55 ms 9360 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 9 ms 7000 KB Output is correct
12 Correct 9 ms 6988 KB Output is correct
13 Correct 9 ms 6988 KB Output is correct
14 Correct 8 ms 6548 KB Output is correct
15 Correct 8 ms 6988 KB Output is correct
16 Correct 9 ms 6988 KB Output is correct
17 Correct 52 ms 9340 KB Output is correct
18 Correct 52 ms 9324 KB Output is correct
19 Correct 57 ms 9320 KB Output is correct
20 Correct 55 ms 9388 KB Output is correct
21 Correct 55 ms 9632 KB Output is correct
22 Correct 60 ms 9600 KB Output is correct
23 Correct 51 ms 9248 KB Output is correct
24 Correct 53 ms 9420 KB Output is correct
25 Correct 48 ms 9604 KB Output is correct
26 Correct 47 ms 9268 KB Output is correct
27 Correct 42 ms 9356 KB Output is correct
28 Correct 44 ms 9604 KB Output is correct
29 Correct 7 ms 6456 KB Output is correct
30 Correct 8 ms 7004 KB Output is correct
31 Correct 8 ms 6608 KB Output is correct
32 Correct 9 ms 6964 KB Output is correct
33 Correct 8 ms 6968 KB Output is correct
34 Correct 10 ms 6972 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 61 ms 8824 KB Output is correct
37 Correct 54 ms 9376 KB Output is correct
38 Correct 62 ms 9352 KB Output is correct
39 Correct 61 ms 9708 KB Output is correct
40 Correct 65 ms 9744 KB Output is correct
41 Correct 10 ms 7020 KB Output is correct
42 Correct 47 ms 9292 KB Output is correct
43 Correct 49 ms 9608 KB Output is correct
44 Correct 52 ms 9624 KB Output is correct
45 Correct 48 ms 9360 KB Output is correct
46 Correct 42 ms 9604 KB Output is correct
47 Correct 42 ms 9616 KB Output is correct