oj.uz

Submission #793833

# Submission time Handle Problem Language Result Execution time Memory
793833 2023-07-26T07:08:17 Z finn__ Mutating DNA (IOI21_dna) C++17
100 / 100
 78 ms 6344 KB 
#include "dna.h"
#include <bits/stdc++.h>
using namespace std;

template <typename T>
struct fenwick_tree
{
    vector<T> t;

    fenwick_tree() {}

    fenwick_tree(size_t n) { t.resize(n); }

    void update(int64_t i, T x)
    {
        ++i;
        while (i <= t.size())
            t[i - 1] += x, i += i & -i;
    }

    T range_sum(int64_t i, int64_t j)
    {
        T x = 0;
        ++j;
        while (j)
            x += t[j - 1], j -= j & -j;
        while (i)
            x -= t[i - 1], i -= i & -i;
        return x;
    }
};

constexpr size_t N = 100000;

vector<uint8_t> a, b;
fenwick_tree<int> c[3][3];

uint8_t conv(char c) { return c == 'A' ? 0 : (c == 'C' ? 1 : 2); }

void init(string a_, string b_)
{
    size_t n = a_.size();
    a.resize(n);
    b.resize(n);
    for (size_t i = 0; i < n; ++i)
        a[i] = conv(a_[i]), b[i] = conv(b_[i]);

    for (size_t i = 0; i < 3; ++i)
        for (size_t j = 0; j < 3; ++j)
            c[i][j] = fenwick_tree<int>(n);

    for (size_t i = 0; i < n; ++i)
        c[a[i]][b[i]].update(i, 1);
}

bool equal_set_in_range(size_t i, size_t j)
{
    return c[0][0].range_sum(i, j) + c[0][1].range_sum(i, j) + c[0][2].range_sum(i, j) ==
               c[0][0].range_sum(i, j) + c[1][0].range_sum(i, j) + c[2][0].range_sum(i, j) &&
           c[1][0].range_sum(i, j) + c[1][1].range_sum(i, j) + c[1][2].range_sum(i, j) ==
               c[0][1].range_sum(i, j) + c[1][1].range_sum(i, j) + c[2][1].range_sum(i, j) &&
           c[2][0].range_sum(i, j) + c[2][1].range_sum(i, j) + c[2][2].range_sum(i, j) ==
               c[0][2].range_sum(i, j) + c[1][2].range_sum(i, j) + c[2][2].range_sum(i, j);
}

int get_distance(int x, int y)
{
    if (!equal_set_in_range(x, y))
        return -1;

    int ans = 0, num_matched = 0;

    num_matched += c[0][0].range_sum(x, y) + c[1][1].range_sum(x, y) + c[2][2].range_sum(x, y);
    for (size_t i = 0; i < 3; ++i)
        for (size_t j = i + 1; j < 3; ++j)
        {
            int count = min(c[i][j].range_sum(x, y), c[j][i].range_sum(x, y));
            ans += count;
            num_matched += count << 1;
        }

    return ans + ((y - x + 1 - num_matched) / 3) * 2;
}

Compilation message

dna.cpp: In instantiation of 'void fenwick_tree<T>::update(int64_t, T) [with T = int; int64_t = long int]':
dna.cpp:53:34:   required from here
dna.cpp:17:18: warning: comparison of integer expressions of different signedness: 'int64_t' {aka 'long int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |         while (i <= t.size())
      |                ~~^~~~~~~~~~~

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 5828 KB Output is correct
2 Correct 47 ms 5964 KB Output is correct
3 Correct 46 ms 5540 KB Output is correct
4 Correct 48 ms 5976 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 5 ms 4564 KB Output is correct
5 Correct 6 ms 4564 KB Output is correct
6 Correct 5 ms 4584 KB Output is correct
7 Correct 4 ms 4308 KB Output is correct
8 Correct 5 ms 4628 KB Output is correct
9 Correct 4 ms 4564 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 5 ms 4564 KB Output is correct
5 Correct 6 ms 4564 KB Output is correct
6 Correct 5 ms 4584 KB Output is correct
7 Correct 4 ms 4308 KB Output is correct
8 Correct 5 ms 4628 KB Output is correct
9 Correct 4 ms 4564 KB Output is correct
10 Correct 48 ms 5868 KB Output is correct
11 Correct 48 ms 5948 KB Output is correct
12 Correct 65 ms 5984 KB Output is correct
13 Correct 66 ms 6116 KB Output is correct
14 Correct 66 ms 6292 KB Output is correct
15 Correct 66 ms 6184 KB Output is correct
16 Correct 58 ms 5972 KB Output is correct
17 Correct 63 ms 6136 KB Output is correct
18 Correct 53 ms 6232 KB Output is correct
19 Correct 44 ms 5964 KB Output is correct
20 Correct 48 ms 6112 KB Output is correct
21 Correct 51 ms 6296 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 5 ms 4564 KB Output is correct
5 Correct 6 ms 4564 KB Output is correct
6 Correct 5 ms 4584 KB Output is correct
7 Correct 4 ms 4308 KB Output is correct
8 Correct 5 ms 4628 KB Output is correct
9 Correct 4 ms 4564 KB Output is correct
10 Correct 5 ms 4180 KB Output is correct
11 Correct 5 ms 4564 KB Output is correct
12 Correct 5 ms 4364 KB Output is correct
13 Correct 5 ms 4628 KB Output is correct
14 Correct 5 ms 4564 KB Output is correct
15 Correct 5 ms 4548 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 5828 KB Output is correct
2 Correct 47 ms 5964 KB Output is correct
3 Correct 46 ms 5540 KB Output is correct
4 Correct 48 ms 5976 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 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 5 ms 4564 KB Output is correct
12 Correct 6 ms 4564 KB Output is correct
13 Correct 5 ms 4584 KB Output is correct
14 Correct 4 ms 4308 KB Output is correct
15 Correct 5 ms 4628 KB Output is correct
16 Correct 4 ms 4564 KB Output is correct
17 Correct 48 ms 5868 KB Output is correct
18 Correct 48 ms 5948 KB Output is correct
19 Correct 65 ms 5984 KB Output is correct
20 Correct 66 ms 6116 KB Output is correct
21 Correct 66 ms 6292 KB Output is correct
22 Correct 66 ms 6184 KB Output is correct
23 Correct 58 ms 5972 KB Output is correct
24 Correct 63 ms 6136 KB Output is correct
25 Correct 53 ms 6232 KB Output is correct
26 Correct 44 ms 5964 KB Output is correct
27 Correct 48 ms 6112 KB Output is correct
28 Correct 51 ms 6296 KB Output is correct
29 Correct 5 ms 4180 KB Output is correct
30 Correct 5 ms 4564 KB Output is correct
31 Correct 5 ms 4364 KB Output is correct
32 Correct 5 ms 4628 KB Output is correct
33 Correct 5 ms 4564 KB Output is correct
34 Correct 5 ms 4548 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 53 ms 5544 KB Output is correct
37 Correct 48 ms 5956 KB Output is correct
38 Correct 65 ms 6028 KB Output is correct
39 Correct 78 ms 6344 KB Output is correct
40 Correct 67 ms 6300 KB Output is correct
41 Correct 5 ms 4564 KB Output is correct
42 Correct 55 ms 5968 KB Output is correct
43 Correct 54 ms 6304 KB Output is correct
44 Correct 55 ms 6328 KB Output is correct
45 Correct 58 ms 6052 KB Output is correct
46 Correct 58 ms 6300 KB Output is correct
47 Correct 60 ms 6340 KB Output is correct