oj.uz

Submission #439309

# Submission time Handle Problem Language Result Execution time Memory
439309 2021-06-29T14:39:09 Z 4fecta Mutating DNA (IOI21_dna) C++17
100 / 100
 53 ms 4872 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pii pair<int, int>
#define f first
#define s second
#define boost() cin.tie(0), cin.sync_with_stdio(0)

const int MN = 100005;

int n, ac[MN], ca[MN], ct[MN], tc[MN], ta[MN], at[MN];

void init(string a, string b) {
    n = a.size();
    for (int i = 1; i <= n; i++) {
        char f = a[i - 1], s = b[i - 1];
        if (f == 'A' && s == 'C') ac[i]++;
        if (f == 'C' && s == 'A') ca[i]++;
        if (f == 'C' && s == 'T') ct[i]++;
        if (f == 'T' && s == 'C') tc[i]++;
        if (f == 'T' && s == 'A') ta[i]++;
        if (f == 'A' && s == 'T') at[i]++;
        ac[i] += ac[i - 1];
        ca[i] += ca[i - 1];
        ct[i] += ct[i - 1];
        tc[i] += tc[i - 1];
        ta[i] += ta[i - 1];
        at[i] += at[i - 1];
    }
}

int get_distance(int x, int y) {
    x++, y++;
    int AC = ac[y] - ac[x - 1];
    int CA = ca[y] - ca[x - 1];
    int CT = ct[y] - ct[x - 1];
    int TC = tc[y] - tc[x - 1];
    int TA = ta[y] - ta[x - 1];
    int AT = at[y] - at[x - 1];
    int m1 = min(AC, CA), m2 = min(CT, TC), m3 = min(TA, AT);
    int ans = m1 + m2 + m3;
    AC -= m1, CA -= m1, CT -= m2, TC -= m2, TA -= m3, AT -= m3;
    if (AC != CT || CT != TA) return -1;
    if (CA != TC || TC != AT) return -1;
    ans += (AC + CA) * 2;
    return ans;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 4492 KB Output is correct
2 Correct 41 ms 4488 KB Output is correct
3 Correct 42 ms 4208 KB Output is correct
4 Correct 44 ms 4456 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 0 ms 204 KB Output is correct
4 Correct 5 ms 3148 KB Output is correct
5 Correct 6 ms 3176 KB Output is correct
6 Correct 6 ms 3148 KB Output is correct
7 Correct 5 ms 2952 KB Output is correct
8 Correct 5 ms 3148 KB Output is correct
9 Correct 4 ms 3200 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 0 ms 204 KB Output is correct
4 Correct 5 ms 3148 KB Output is correct
5 Correct 6 ms 3176 KB Output is correct
6 Correct 6 ms 3148 KB Output is correct
7 Correct 5 ms 2952 KB Output is correct
8 Correct 5 ms 3148 KB Output is correct
9 Correct 4 ms 3200 KB Output is correct
10 Correct 40 ms 4472 KB Output is correct
11 Correct 39 ms 4476 KB Output is correct
12 Correct 40 ms 4640 KB Output is correct
13 Correct 42 ms 4732 KB Output is correct
14 Correct 40 ms 4792 KB Output is correct
15 Correct 43 ms 4732 KB Output is correct
16 Correct 38 ms 4588 KB Output is correct
17 Correct 38 ms 4668 KB Output is correct
18 Correct 40 ms 4868 KB Output is correct
19 Correct 35 ms 4624 KB Output is correct
20 Correct 36 ms 4748 KB Output is correct
21 Correct 35 ms 4864 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 0 ms 204 KB Output is correct
4 Correct 5 ms 3148 KB Output is correct
5 Correct 6 ms 3176 KB Output is correct
6 Correct 6 ms 3148 KB Output is correct
7 Correct 5 ms 2952 KB Output is correct
8 Correct 5 ms 3148 KB Output is correct
9 Correct 4 ms 3200 KB Output is correct
10 Correct 5 ms 2980 KB Output is correct
11 Correct 5 ms 3148 KB Output is correct
12 Correct 5 ms 3020 KB Output is correct
13 Correct 6 ms 3148 KB Output is correct
14 Correct 7 ms 3148 KB Output is correct
15 Correct 6 ms 3148 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 4492 KB Output is correct
2 Correct 41 ms 4488 KB Output is correct
3 Correct 42 ms 4208 KB Output is correct
4 Correct 44 ms 4456 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 0 ms 204 KB Output is correct
11 Correct 5 ms 3148 KB Output is correct
12 Correct 6 ms 3176 KB Output is correct
13 Correct 6 ms 3148 KB Output is correct
14 Correct 5 ms 2952 KB Output is correct
15 Correct 5 ms 3148 KB Output is correct
16 Correct 4 ms 3200 KB Output is correct
17 Correct 40 ms 4472 KB Output is correct
18 Correct 39 ms 4476 KB Output is correct
19 Correct 40 ms 4640 KB Output is correct
20 Correct 42 ms 4732 KB Output is correct
21 Correct 40 ms 4792 KB Output is correct
22 Correct 43 ms 4732 KB Output is correct
23 Correct 38 ms 4588 KB Output is correct
24 Correct 38 ms 4668 KB Output is correct
25 Correct 40 ms 4868 KB Output is correct
26 Correct 35 ms 4624 KB Output is correct
27 Correct 36 ms 4748 KB Output is correct
28 Correct 35 ms 4864 KB Output is correct
29 Correct 5 ms 2980 KB Output is correct
30 Correct 5 ms 3148 KB Output is correct
31 Correct 5 ms 3020 KB Output is correct
32 Correct 6 ms 3148 KB Output is correct
33 Correct 7 ms 3148 KB Output is correct
34 Correct 6 ms 3148 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 41 ms 4208 KB Output is correct
37 Correct 44 ms 4496 KB Output is correct
38 Correct 53 ms 4712 KB Output is correct
39 Correct 39 ms 4860 KB Output is correct
40 Correct 39 ms 4864 KB Output is correct
41 Correct 4 ms 3148 KB Output is correct
42 Correct 38 ms 4728 KB Output is correct
43 Correct 39 ms 4788 KB Output is correct
44 Correct 38 ms 4828 KB Output is correct
45 Correct 35 ms 4724 KB Output is correct
46 Correct 53 ms 4860 KB Output is correct
47 Correct 38 ms 4872 KB Output is correct