oj.uz

Submission #437025

# Submission time Handle Problem Language Result Execution time Memory
437025 2021-06-25T16:07:12 Z model_code Mutating DNA (IOI21_dna) C++17
100 / 100
 127 ms 7584 KB 
#include "dna.h"

#include <bits/stdc++.h>
using namespace std;

const string kDna = "ACT";
const int K = kDna.size();
vector<int> prefix_sum[sizeof(char) << 8][sizeof(char) << 8];

int cnt[sizeof(char) << 8][sizeof(char) << 8];
vector<string> dna_subsets;

constexpr int kImpossible = -1;

void init(string A, string B) {
  int N = A.size();
  for (int c1 : kDna) {
    for (int c2 : kDna) {
      prefix_sum[c1][c2].resize(N);
    }
  }
  for (int c1 : kDna) {
    for (int c2 : kDna) {
      for (int i = 0; i < N; ++i) {
        prefix_sum[c1][c2][i] = (c1 == A[i] && c2 == B[i]) ? 1 : 0;
        if (i > 0) {
          prefix_sum[c1][c2][i] += prefix_sum[c1][c2][i - 1];
        }
      }
    }
  }

  for (int bit = 1; bit < (1 << K); ++bit) {
    string dna_subset;
    for (int i = 0; i < K; ++i) {
      if (bit & (1 << i)) {
        dna_subset += kDna[i];
      }
    }
    dna_subsets.push_back(dna_subset);
  }
  sort(dna_subsets.begin(), dna_subsets.end(), [] (string a, string b) {
    return a.size() < b.size();
  });
}

int get_distance(int X, int Y) {
  for (int c1 : kDna) {
    for (int c2 : kDna) {
      cnt[c1][c2] = prefix_sum[c1][c2][Y];
      if (X > 0) {
        cnt[c1][c2] -= prefix_sum[c1][c2][X - 1];
      }
    }
  }
  
  int answer = Y - X + 1;
  for (string dna_subset : dna_subsets) {
    do {
      int res = INT_MAX;
      for (int i = 0; i < static_cast<int>(dna_subset.size()); ++i) {
        int c1 = dna_subset[i];
        int c2 = dna_subset[(i + 1) % dna_subset.size()];
        res = min(res, cnt[c1][c2]);
      }
      answer -= res;
      for (int i = 0; i < static_cast<int>(dna_subset.size()); ++i) {
        int c1 = dna_subset[i];
        int c2 = dna_subset[(i + 1) % dna_subset.size()];
        cnt[c1][c2] -= res;
      }
    } while (next_permutation(dna_subset.begin(), dna_subset.end()));
  }
  
  for (int c1 : kDna) {
    for (int c2 : kDna) {
      if (cnt[c1][c2] > 0) {
        return kImpossible;
      }
    }
  }

  return answer;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 125 ms 7132 KB Output is correct
2 Correct 118 ms 7192 KB Output is correct
3 Correct 105 ms 6860 KB Output is correct
4 Correct 103 ms 7192 KB Output is correct
5 Correct 2 ms 1740 KB Output is correct
6 Correct 2 ms 1868 KB Output is correct
7 Correct 2 ms 1740 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1740 KB Output is correct
2 Correct 2 ms 1792 KB Output is correct
3 Correct 3 ms 1740 KB Output is correct
4 Correct 10 ms 5836 KB Output is correct
5 Correct 10 ms 5964 KB Output is correct
6 Correct 10 ms 5836 KB Output is correct
7 Correct 9 ms 5592 KB Output is correct
8 Correct 10 ms 5972 KB Output is correct
9 Correct 8 ms 5964 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1740 KB Output is correct
2 Correct 2 ms 1792 KB Output is correct
3 Correct 3 ms 1740 KB Output is correct
4 Correct 10 ms 5836 KB Output is correct
5 Correct 10 ms 5964 KB Output is correct
6 Correct 10 ms 5836 KB Output is correct
7 Correct 9 ms 5592 KB Output is correct
8 Correct 10 ms 5972 KB Output is correct
9 Correct 8 ms 5964 KB Output is correct
10 Correct 109 ms 7152 KB Output is correct
11 Correct 100 ms 7204 KB Output is correct
12 Correct 115 ms 7308 KB Output is correct
13 Correct 106 ms 7404 KB Output is correct
14 Correct 106 ms 7580 KB Output is correct
15 Correct 100 ms 7548 KB Output is correct
16 Correct 127 ms 7296 KB Output is correct
17 Correct 123 ms 7420 KB Output is correct
18 Correct 106 ms 7576 KB Output is correct
19 Correct 95 ms 7280 KB Output is correct
20 Correct 101 ms 7436 KB Output is correct
21 Correct 96 ms 7576 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1740 KB Output is correct
2 Correct 2 ms 1792 KB Output is correct
3 Correct 3 ms 1740 KB Output is correct
4 Correct 10 ms 5836 KB Output is correct
5 Correct 10 ms 5964 KB Output is correct
6 Correct 10 ms 5836 KB Output is correct
7 Correct 9 ms 5592 KB Output is correct
8 Correct 10 ms 5972 KB Output is correct
9 Correct 8 ms 5964 KB Output is correct
10 Correct 9 ms 5592 KB Output is correct
11 Correct 10 ms 5972 KB Output is correct
12 Correct 9 ms 5720 KB Output is correct
13 Correct 10 ms 5964 KB Output is correct
14 Correct 11 ms 5964 KB Output is correct
15 Correct 9 ms 5896 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 125 ms 7132 KB Output is correct
2 Correct 118 ms 7192 KB Output is correct
3 Correct 105 ms 6860 KB Output is correct
4 Correct 103 ms 7192 KB Output is correct
5 Correct 2 ms 1740 KB Output is correct
6 Correct 2 ms 1868 KB Output is correct
7 Correct 2 ms 1740 KB Output is correct
8 Correct 2 ms 1740 KB Output is correct
9 Correct 2 ms 1792 KB Output is correct
10 Correct 3 ms 1740 KB Output is correct
11 Correct 10 ms 5836 KB Output is correct
12 Correct 10 ms 5964 KB Output is correct
13 Correct 10 ms 5836 KB Output is correct
14 Correct 9 ms 5592 KB Output is correct
15 Correct 10 ms 5972 KB Output is correct
16 Correct 8 ms 5964 KB Output is correct
17 Correct 109 ms 7152 KB Output is correct
18 Correct 100 ms 7204 KB Output is correct
19 Correct 115 ms 7308 KB Output is correct
20 Correct 106 ms 7404 KB Output is correct
21 Correct 106 ms 7580 KB Output is correct
22 Correct 100 ms 7548 KB Output is correct
23 Correct 127 ms 7296 KB Output is correct
24 Correct 123 ms 7420 KB Output is correct
25 Correct 106 ms 7576 KB Output is correct
26 Correct 95 ms 7280 KB Output is correct
27 Correct 101 ms 7436 KB Output is correct
28 Correct 96 ms 7576 KB Output is correct
29 Correct 9 ms 5592 KB Output is correct
30 Correct 10 ms 5972 KB Output is correct
31 Correct 9 ms 5720 KB Output is correct
32 Correct 10 ms 5964 KB Output is correct
33 Correct 11 ms 5964 KB Output is correct
34 Correct 9 ms 5896 KB Output is correct
35 Correct 2 ms 1740 KB Output is correct
36 Correct 107 ms 6888 KB Output is correct
37 Correct 105 ms 7196 KB Output is correct
38 Correct 100 ms 7284 KB Output is correct
39 Correct 102 ms 7584 KB Output is correct
40 Correct 124 ms 7580 KB Output is correct
41 Correct 10 ms 5964 KB Output is correct
42 Correct 100 ms 7308 KB Output is correct
43 Correct 109 ms 7584 KB Output is correct
44 Correct 111 ms 7540 KB Output is correct
45 Correct 106 ms 7344 KB Output is correct
46 Correct 93 ms 7552 KB Output is correct
47 Correct 109 ms 7548 KB Output is correct