oj.uz

Submission #438669

# Submission time Handle Problem Language Result Execution time Memory
438669 2021-06-28T12:18:07 Z dxz05 Mutating DNA (IOI21_dna) C++17
100 / 100
 58 ms 6456 KB 
#include "dna.h"
#include <bits/stdc++.h>

using namespace std;

const int MAXN = 2e5 + 3e2;

int pref[MAXN][6];
long long cnt[MAXN][2];

vector<vector<char>> dna = {{'A', 'C'}, {'C', 'A'}, {'A', 'T'}, {'T', 'A'}, {'T', 'C'}, {'C', 'T'}};

long long f(char ch){
    if (ch == 'A') return 1ll;
    if (ch == 'C') return 200000ll;
    if (ch == 'T') return 40000000000ll;
    return -1;
}

void init(string a, string b) {
    int n = a.size();
    for (int i = 1; i <= n; i++){
        cnt[i][0] = cnt[i - 1][0] + f(a[i - 1]);
        cnt[i][1] = cnt[i - 1][1] + f(b[i - 1]);
    }

    for (int i = 1; i <= n; i++){
        for (int j = 0; j < 6; j++){
            pref[i][j] = pref[i - 1][j] + (a[i - 1] == dna[j][0] && b[i - 1] == dna[j][1]);
        }
    }

}

int get_distance(int x, int y) {
    x++, y++;
    if (cnt[y][0] - cnt[x - 1][0] != cnt[y][1] - cnt[x - 1][1]) return -1;

    int ans1 = 0, ans2 = 0;
    for (int j = 0; j < 6; j += 2){
        int a = pref[y][j] - pref[x - 1][j];
        int b = pref[y][j + 1] - pref[x - 1][j + 1];

        int c = min(a, b);
        ans1 += c;
        ans2 += a - c + b - c;
    }

    int res = ans1 + ans2 / 3 * 2;

	return res;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 6016 KB Output is correct
2 Correct 58 ms 6016 KB Output is correct
3 Correct 42 ms 5656 KB Output is correct
4 Correct 43 ms 6016 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 204 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 8 ms 4684 KB Output is correct
5 Correct 7 ms 4684 KB Output is correct
6 Correct 6 ms 4748 KB Output is correct
7 Correct 6 ms 4428 KB Output is correct
8 Correct 6 ms 4696 KB Output is correct
9 Correct 5 ms 4736 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 8 ms 4684 KB Output is correct
5 Correct 7 ms 4684 KB Output is correct
6 Correct 6 ms 4748 KB Output is correct
7 Correct 6 ms 4428 KB Output is correct
8 Correct 6 ms 4696 KB Output is correct
9 Correct 5 ms 4736 KB Output is correct
10 Correct 45 ms 5968 KB Output is correct
11 Correct 53 ms 6004 KB Output is correct
12 Correct 53 ms 6124 KB Output is correct
13 Correct 41 ms 6156 KB Output is correct
14 Correct 46 ms 6336 KB Output is correct
15 Correct 41 ms 6296 KB Output is correct
16 Correct 41 ms 6128 KB Output is correct
17 Correct 43 ms 6268 KB Output is correct
18 Correct 42 ms 6404 KB Output is correct
19 Correct 38 ms 6120 KB Output is correct
20 Correct 39 ms 6268 KB Output is correct
21 Correct 38 ms 6428 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 8 ms 4684 KB Output is correct
5 Correct 7 ms 4684 KB Output is correct
6 Correct 6 ms 4748 KB Output is correct
7 Correct 6 ms 4428 KB Output is correct
8 Correct 6 ms 4696 KB Output is correct
9 Correct 5 ms 4736 KB Output is correct
10 Correct 7 ms 4300 KB Output is correct
11 Correct 7 ms 4684 KB Output is correct
12 Correct 6 ms 4388 KB Output is correct
13 Correct 7 ms 4684 KB Output is correct
14 Correct 7 ms 4716 KB Output is correct
15 Correct 6 ms 4812 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 6016 KB Output is correct
2 Correct 58 ms 6016 KB Output is correct
3 Correct 42 ms 5656 KB Output is correct
4 Correct 43 ms 6016 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 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 8 ms 4684 KB Output is correct
12 Correct 7 ms 4684 KB Output is correct
13 Correct 6 ms 4748 KB Output is correct
14 Correct 6 ms 4428 KB Output is correct
15 Correct 6 ms 4696 KB Output is correct
16 Correct 5 ms 4736 KB Output is correct
17 Correct 45 ms 5968 KB Output is correct
18 Correct 53 ms 6004 KB Output is correct
19 Correct 53 ms 6124 KB Output is correct
20 Correct 41 ms 6156 KB Output is correct
21 Correct 46 ms 6336 KB Output is correct
22 Correct 41 ms 6296 KB Output is correct
23 Correct 41 ms 6128 KB Output is correct
24 Correct 43 ms 6268 KB Output is correct
25 Correct 42 ms 6404 KB Output is correct
26 Correct 38 ms 6120 KB Output is correct
27 Correct 39 ms 6268 KB Output is correct
28 Correct 38 ms 6428 KB Output is correct
29 Correct 7 ms 4300 KB Output is correct
30 Correct 7 ms 4684 KB Output is correct
31 Correct 6 ms 4388 KB Output is correct
32 Correct 7 ms 4684 KB Output is correct
33 Correct 7 ms 4716 KB Output is correct
34 Correct 6 ms 4812 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 49 ms 5604 KB Output is correct
37 Correct 43 ms 6016 KB Output is correct
38 Correct 44 ms 6140 KB Output is correct
39 Correct 43 ms 6404 KB Output is correct
40 Correct 48 ms 6456 KB Output is correct
41 Correct 5 ms 4684 KB Output is correct
42 Correct 40 ms 6132 KB Output is correct
43 Correct 41 ms 6400 KB Output is correct
44 Correct 41 ms 6396 KB Output is correct
45 Correct 42 ms 6156 KB Output is correct
46 Correct 38 ms 6400 KB Output is correct
47 Correct 41 ms 6420 KB Output is correct