oj.uz

Submission #914657

# Submission time Handle Problem Language Result Execution time Memory
914657 2024-01-22T13:26:59 Z JooDdae Mutating DNA (IOI21_dna) C++17
100 / 100
 42 ms 7488 KB 
#include "dna.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int r[256], n, s[100100][3][3], c[3][3], p[3];

void init(string a, string b) {
    r['A'] = 0, r['T'] = 1, r['C'] = 2;
    n = a.size();

    for(int i=0;i<n;i++) {
        int A = r[a[i]], B = r[b[i]];
        for(int j=0;j<3;j++) for(int k=0;k<3;k++) s[i+1][j][k] = s[i][j][k] + (j == A && k == B);
    }
}

int get_distance(int x, int y) {
    for(int i=0;i<3;i++) for(int j=0;j<3;j++) c[i][j] = s[y+1][i][j] - s[x][i][j];
    p[0] = p[1] = p[2] = 0;
    for(int i=0;i<3;i++) for(int j=0;j<3;j++) p[i] += c[i][j], p[j] -= c[i][j];
    if(p[0] || p[1] || p[2]) return -1;

    int ans = 0;
    for(int i=0;i<3;i++) for(int j=i+1;j<3;j++) {
        int k = min(c[i][j], c[j][i]);
        ans += k, c[i][j] -= k, c[j][i] -= k;
    }
    return ans + c[0][1]*2 + c[1][0]*2;
}

Compilation message

dna.cpp: In function 'void init(std::string, std::string)':
dna.cpp:13:23: warning: array subscript has type 'char' [-Wchar-subscripts]
   13 |         int A = r[a[i]], B = r[b[i]];
      |                       ^
dna.cpp:13:36: warning: array subscript has type 'char' [-Wchar-subscripts]
   13 |         int A = r[a[i]], B = r[b[i]];
      |                                    ^

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 7004 KB Output is correct
2 Correct 31 ms 7192 KB Output is correct
3 Correct 28 ms 6636 KB Output is correct
4 Correct 29 ms 7112 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 3 ms 4552 KB Output is correct
5 Correct 4 ms 4736 KB Output is correct
6 Correct 4 ms 4700 KB Output is correct
7 Correct 4 ms 4444 KB Output is correct
8 Correct 4 ms 4700 KB Output is correct
9 Correct 3 ms 4700 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 3 ms 4552 KB Output is correct
5 Correct 4 ms 4736 KB Output is correct
6 Correct 4 ms 4700 KB Output is correct
7 Correct 4 ms 4444 KB Output is correct
8 Correct 4 ms 4700 KB Output is correct
9 Correct 3 ms 4700 KB Output is correct
10 Correct 32 ms 7000 KB Output is correct
11 Correct 30 ms 7192 KB Output is correct
12 Correct 35 ms 7024 KB Output is correct
13 Correct 41 ms 7232 KB Output is correct
14 Correct 34 ms 7324 KB Output is correct
15 Correct 30 ms 7440 KB Output is correct
16 Correct 28 ms 6944 KB Output is correct
17 Correct 32 ms 7304 KB Output is correct
18 Correct 28 ms 7328 KB Output is correct
19 Correct 36 ms 6940 KB Output is correct
20 Correct 30 ms 7292 KB Output is correct
21 Correct 28 ms 7488 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 3 ms 4552 KB Output is correct
5 Correct 4 ms 4736 KB Output is correct
6 Correct 4 ms 4700 KB Output is correct
7 Correct 4 ms 4444 KB Output is correct
8 Correct 4 ms 4700 KB Output is correct
9 Correct 3 ms 4700 KB Output is correct
10 Correct 3 ms 4188 KB Output is correct
11 Correct 5 ms 4700 KB Output is correct
12 Correct 3 ms 4440 KB Output is correct
13 Correct 3 ms 4952 KB Output is correct
14 Correct 4 ms 4700 KB Output is correct
15 Correct 3 ms 4700 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 7004 KB Output is correct
2 Correct 31 ms 7192 KB Output is correct
3 Correct 28 ms 6636 KB Output is correct
4 Correct 29 ms 7112 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 3 ms 4552 KB Output is correct
12 Correct 4 ms 4736 KB Output is correct
13 Correct 4 ms 4700 KB Output is correct
14 Correct 4 ms 4444 KB Output is correct
15 Correct 4 ms 4700 KB Output is correct
16 Correct 3 ms 4700 KB Output is correct
17 Correct 32 ms 7000 KB Output is correct
18 Correct 30 ms 7192 KB Output is correct
19 Correct 35 ms 7024 KB Output is correct
20 Correct 41 ms 7232 KB Output is correct
21 Correct 34 ms 7324 KB Output is correct
22 Correct 30 ms 7440 KB Output is correct
23 Correct 28 ms 6944 KB Output is correct
24 Correct 32 ms 7304 KB Output is correct
25 Correct 28 ms 7328 KB Output is correct
26 Correct 36 ms 6940 KB Output is correct
27 Correct 30 ms 7292 KB Output is correct
28 Correct 28 ms 7488 KB Output is correct
29 Correct 3 ms 4188 KB Output is correct
30 Correct 5 ms 4700 KB Output is correct
31 Correct 3 ms 4440 KB Output is correct
32 Correct 3 ms 4952 KB Output is correct
33 Correct 4 ms 4700 KB Output is correct
34 Correct 3 ms 4700 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 32 ms 6692 KB Output is correct
37 Correct 32 ms 7036 KB Output is correct
38 Correct 29 ms 7312 KB Output is correct
39 Correct 29 ms 7448 KB Output is correct
40 Correct 37 ms 7372 KB Output is correct
41 Correct 3 ms 4700 KB Output is correct
42 Correct 31 ms 7028 KB Output is correct
43 Correct 31 ms 7436 KB Output is correct
44 Correct 42 ms 7408 KB Output is correct
45 Correct 29 ms 7080 KB Output is correct
46 Correct 40 ms 7400 KB Output is correct
47 Correct 35 ms 7432 KB Output is correct