oj.uz

Submission #826006

# Submission time Handle Problem Language Result Execution time Memory
826006 2023-08-15T09:50:01 Z TahirAliyev Mutating DNA (IOI21_dna) C++17
100 / 100
 104 ms 14088 KB 
#include "dna.h"
#include <bits/stdc++.h>

using namespace std;

const int MAX = 1e5 + 5;

array<array<int, 3>, 3> tree[4 * MAX];

vector<int> v1, v2;
int n;

array<array<int, 3>, 3> combine(array<array<int, 3>, 3> a, array<array<int, 3>, 3> b){
    array<array<int, 3>, 3> c;
    for (int i = 0; i < 3; i++)
    {
        for (int j = 0; j < 3; j++)
        {
            c[i][j] = a[i][j] + b[i][j];
        }
    }
    return c;
}

void build(int node, int l, int r){
    if(l == r) {
        tree[node][v1[l]][v2[l]]++;
        return;
    }
    int mid = (l + r) / 2;
    build(2 * node, l, mid);
    build(2 * node + 1, mid + 1, r);
    tree[node] = combine(tree[2 * node], tree[2 * node + 1]);
}

array<array<int, 3>, 3> ask(int node, int l, int r, int ql, int qr){
    if(r < ql || qr < l){
        return array<array<int, 3>, 3>();
    }
    if(ql <= l && r <= qr){
        return tree[node];
    }
    int mid = (l + r) / 2;
    return combine(ask(2 * node, l, mid, ql, qr), ask(2 * node + 1, mid + 1, r, ql, qr));
}

map<char, int> mp = {{'A', 0}, {'T', 1}, {'C', 2}};

void init(string a, string b) {
    n = a.size();
    for (int i = 0; i < n; i++)
    {
        v1.push_back(mp[a[i]]);
    }
    for (int i = 0; i < n; i++)
    {
        v2.push_back(mp[b[i]]);
    }
    build(1, 0, n - 1);
}

int get_distance(int x, int y) {
    array<array<int, 3>, 3> a = ask(1, 0, n - 1, x, y);
    int letters[3];
    memset(letters, 0, sizeof(letters));
    for (int i = 0; i < 3; i++)
    {
        for (int j = 0; j < 3; j++)
        {
            letters[i] += a[i][j];
            letters[j] -= a[i][j];
        }
    }
    for (int i = 0; i < 3; i++)
    {
        if(letters[i] != 0) {
            return -1;
        }
    }
    
    int p = min(a[0][1], a[1][0]) + min(a[1][2], a[2][1]) + min(a[0][2], a[2][0]);
    int s = a[0][0] + a[1][1] + a[2][2];
    int t = (y - x + 1) - p * 2 - s;
    return p + (t / 3 * 2);
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 13724 KB Output is correct
2 Correct 74 ms 13688 KB Output is correct
3 Correct 60 ms 13576 KB Output is correct
4 Correct 75 ms 13652 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 8 ms 11216 KB Output is correct
5 Correct 9 ms 11216 KB Output is correct
6 Correct 10 ms 11180 KB Output is correct
7 Correct 11 ms 11032 KB Output is correct
8 Correct 9 ms 11216 KB Output is correct
9 Correct 9 ms 11192 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 8 ms 11216 KB Output is correct
5 Correct 9 ms 11216 KB Output is correct
6 Correct 10 ms 11180 KB Output is correct
7 Correct 11 ms 11032 KB Output is correct
8 Correct 9 ms 11216 KB Output is correct
9 Correct 9 ms 11192 KB Output is correct
10 Correct 70 ms 13672 KB Output is correct
11 Correct 65 ms 13692 KB Output is correct
12 Correct 86 ms 13940 KB Output is correct
13 Correct 87 ms 13964 KB Output is correct
14 Correct 87 ms 14088 KB Output is correct
15 Correct 92 ms 13940 KB Output is correct
16 Correct 88 ms 13852 KB Output is correct
17 Correct 84 ms 13860 KB Output is correct
18 Correct 87 ms 13992 KB Output is correct
19 Correct 81 ms 13836 KB Output is correct
20 Correct 82 ms 13892 KB Output is correct
21 Correct 81 ms 13964 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 8 ms 11216 KB Output is correct
5 Correct 9 ms 11216 KB Output is correct
6 Correct 10 ms 11180 KB Output is correct
7 Correct 11 ms 11032 KB Output is correct
8 Correct 9 ms 11216 KB Output is correct
9 Correct 9 ms 11192 KB Output is correct
10 Correct 9 ms 11084 KB Output is correct
11 Correct 9 ms 11228 KB Output is correct
12 Correct 8 ms 11072 KB Output is correct
13 Correct 8 ms 11180 KB Output is correct
14 Correct 11 ms 11196 KB Output is correct
15 Correct 9 ms 11192 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 13724 KB Output is correct
2 Correct 74 ms 13688 KB Output is correct
3 Correct 60 ms 13576 KB Output is correct
4 Correct 75 ms 13652 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 8 ms 11216 KB Output is correct
12 Correct 9 ms 11216 KB Output is correct
13 Correct 10 ms 11180 KB Output is correct
14 Correct 11 ms 11032 KB Output is correct
15 Correct 9 ms 11216 KB Output is correct
16 Correct 9 ms 11192 KB Output is correct
17 Correct 70 ms 13672 KB Output is correct
18 Correct 65 ms 13692 KB Output is correct
19 Correct 86 ms 13940 KB Output is correct
20 Correct 87 ms 13964 KB Output is correct
21 Correct 87 ms 14088 KB Output is correct
22 Correct 92 ms 13940 KB Output is correct
23 Correct 88 ms 13852 KB Output is correct
24 Correct 84 ms 13860 KB Output is correct
25 Correct 87 ms 13992 KB Output is correct
26 Correct 81 ms 13836 KB Output is correct
27 Correct 82 ms 13892 KB Output is correct
28 Correct 81 ms 13964 KB Output is correct
29 Correct 9 ms 11084 KB Output is correct
30 Correct 9 ms 11228 KB Output is correct
31 Correct 8 ms 11072 KB Output is correct
32 Correct 8 ms 11180 KB Output is correct
33 Correct 11 ms 11196 KB Output is correct
34 Correct 9 ms 11192 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 64 ms 13528 KB Output is correct
37 Correct 62 ms 13768 KB Output is correct
38 Correct 89 ms 13980 KB Output is correct
39 Correct 104 ms 14072 KB Output is correct
40 Correct 89 ms 14068 KB Output is correct
41 Correct 8 ms 11216 KB Output is correct
42 Correct 93 ms 13888 KB Output is correct
43 Correct 91 ms 14024 KB Output is correct
44 Correct 89 ms 13988 KB Output is correct
45 Correct 84 ms 13868 KB Output is correct
46 Correct 81 ms 14012 KB Output is correct
47 Correct 81 ms 13964 KB Output is correct