oj.uz

Submission #872607

# Submission time Handle Problem Language Result Execution time Memory
872607 2023-11-13T12:46:20 Z LucaLucaM Mutating DNA (IOI21_dna) C++17
100 / 100
 32 ms 7776 KB 
#include "dna.h"
#include <iostream>
#include <algorithm>

std::string s, q;
int n;

const int NMAX = 1e5;

int sum[NMAX + 1][3][3];

void init(std::string a, std::string b) {
  n = (int) a.size();
  for (auto &ch : a) {
    if (ch == 'A') {
      ch = 0;
    } else if (ch == 'C') {
      ch = 1;
    } else {
      ch = 2;
    }
  }
  for (auto &ch : b) {
    if (ch == 'A') {
      ch = 0;
    } else if (ch == 'C') {
      ch = 1;
    } else {
      ch = 2;
    }
  }
  s = '$' + a, q = '$' + b;
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j < 3; j++) {
      for (int k = 0; k < 3; k++) {
        sum[i][j][k] = sum[i - 1][j][k];
      }
    }
    sum[i][s[i]][q[i]]++;
  }
}

int get_distance(int x, int y) {
  ++x, ++y;
  int cnt[3][3] = {};
  int delta[3] = {};
  for (int i = 0; i < 3; i++) {
    for (int j = 0; j < 3; j++) {
      cnt[i][j] = sum[y][i][j] - sum[x - 1][i][j];
      delta[i] += cnt[i][j];
      delta[j] -= cnt[i][j];
    }
  }
  if (delta[0] != 0 || delta[1] != 0 || delta[2] != 0) {
    return -1;
  }
  std::vector<int> p = {0, 1, 2};
  int answer = 0;
  do {
    int cur = 0;
    for (int i = 0; i < 3; i++) {
      for (int j = i + 1; j < 3; j++) {
        cur += cnt[p[i]][p[j]];
      }
    }
    answer = std::max(answer, cur);
  } while (std::next_permutation(p.begin(), p.end()));
  return answer;
}

/**
6 3
ATACAT
ACTATA
1 3
4 5
3 5

123
231

**/

Compilation message

dna.cpp: In function 'void init(std::string, std::string)':
dna.cpp:39:16: warning: array subscript has type 'char' [-Wchar-subscripts]
   39 |     sum[i][s[i]][q[i]]++;
      |                ^
dna.cpp:39:22: warning: array subscript has type 'char' [-Wchar-subscripts]
   39 |     sum[i][s[i]][q[i]]++;
      |                      ^

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 6996 KB Output is correct
2 Correct 29 ms 6948 KB Output is correct
3 Correct 28 ms 6748 KB Output is correct
4 Correct 29 ms 6944 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 3 ms 4700 KB Output is correct
5 Correct 3 ms 4744 KB Output is correct
6 Correct 3 ms 4700 KB Output is correct
7 Correct 3 ms 4444 KB Output is correct
8 Correct 3 ms 4700 KB Output is correct
9 Correct 2 ms 4700 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 3 ms 4700 KB Output is correct
5 Correct 3 ms 4744 KB Output is correct
6 Correct 3 ms 4700 KB Output is correct
7 Correct 3 ms 4444 KB Output is correct
8 Correct 3 ms 4700 KB Output is correct
9 Correct 2 ms 4700 KB Output is correct
10 Correct 29 ms 7004 KB Output is correct
11 Correct 30 ms 6988 KB Output is correct
12 Correct 31 ms 7000 KB Output is correct
13 Correct 31 ms 7508 KB Output is correct
14 Correct 31 ms 7596 KB Output is correct
15 Correct 30 ms 7748 KB Output is correct
16 Correct 30 ms 7256 KB Output is correct
17 Correct 30 ms 7416 KB Output is correct
18 Correct 30 ms 7512 KB Output is correct
19 Correct 30 ms 7264 KB Output is correct
20 Correct 29 ms 7476 KB Output is correct
21 Correct 29 ms 7512 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 3 ms 4700 KB Output is correct
5 Correct 3 ms 4744 KB Output is correct
6 Correct 3 ms 4700 KB Output is correct
7 Correct 3 ms 4444 KB Output is correct
8 Correct 3 ms 4700 KB Output is correct
9 Correct 2 ms 4700 KB Output is correct
10 Correct 3 ms 4440 KB Output is correct
11 Correct 4 ms 4700 KB Output is correct
12 Correct 3 ms 4444 KB Output is correct
13 Correct 3 ms 4700 KB Output is correct
14 Correct 3 ms 4696 KB Output is correct
15 Correct 3 ms 4700 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 6996 KB Output is correct
2 Correct 29 ms 6948 KB Output is correct
3 Correct 28 ms 6748 KB Output is correct
4 Correct 29 ms 6944 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 3 ms 4700 KB Output is correct
12 Correct 3 ms 4744 KB Output is correct
13 Correct 3 ms 4700 KB Output is correct
14 Correct 3 ms 4444 KB Output is correct
15 Correct 3 ms 4700 KB Output is correct
16 Correct 2 ms 4700 KB Output is correct
17 Correct 29 ms 7004 KB Output is correct
18 Correct 30 ms 6988 KB Output is correct
19 Correct 31 ms 7000 KB Output is correct
20 Correct 31 ms 7508 KB Output is correct
21 Correct 31 ms 7596 KB Output is correct
22 Correct 30 ms 7748 KB Output is correct
23 Correct 30 ms 7256 KB Output is correct
24 Correct 30 ms 7416 KB Output is correct
25 Correct 30 ms 7512 KB Output is correct
26 Correct 30 ms 7264 KB Output is correct
27 Correct 29 ms 7476 KB Output is correct
28 Correct 29 ms 7512 KB Output is correct
29 Correct 3 ms 4440 KB Output is correct
30 Correct 4 ms 4700 KB Output is correct
31 Correct 3 ms 4444 KB Output is correct
32 Correct 3 ms 4700 KB Output is correct
33 Correct 3 ms 4696 KB Output is correct
34 Correct 3 ms 4700 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 32 ms 6856 KB Output is correct
37 Correct 29 ms 7252 KB Output is correct
38 Correct 30 ms 7508 KB Output is correct
39 Correct 32 ms 7776 KB Output is correct
40 Correct 30 ms 7760 KB Output is correct
41 Correct 3 ms 4700 KB Output is correct
42 Correct 30 ms 7252 KB Output is correct
43 Correct 30 ms 7504 KB Output is correct
44 Correct 30 ms 7508 KB Output is correct
45 Correct 29 ms 7248 KB Output is correct
46 Correct 30 ms 7680 KB Output is correct
47 Correct 29 ms 7508 KB Output is correct